Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

GC
2006
Springer

favoriteEmaildiscussreport

112views Applied Computing» more GC 2006»

Alternating Paths along Axis-Parallel Segments

13 years 4 months ago

Alternating Paths along Axis-Parallel Segments

Download math.mit.edu

It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axis-parallel line segments are protruded (that is, if the intersection point of the lines through every two nonparallel segments is not visible from both segments), there is a simple alternating path of length n.

Csaba D. Tóth

Real-time Traffic

Applied Computing | Axis-parallel Line Segments | GC 2006 | Simple Alternating Path | Worst Case |

claim paper

Related Content

» HomotopyBased SemiSupervised Hidden Markov Models for Sequence Labeling

» Accurately modeling speculative instruction fetching in tracedriven simulation

» Implicit Trajectory Modeling through Gaussian Transition Models for Speech Recognition

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	GC
Authors	Csaba D. Tóth

Comments (0)