An optimal algorithm for intersecting line segments in the plane

@article{Chazelle1992AnOA,
  title={An optimal algorithm for intersecting line segments in the plane},
  author={Bernard Chazelle and Herbert Edelsbrunner},
  journal={J. ACM},
  year={1992},
  volume={39},
  pages={1-54}
}
The main contribution of this work is an <italic>O</italic>(<italic>n</italic> log <italic>n</italic> + <italic>k</italic>)-time algorithm for computing all <italic>k</italic> intersections among <italic>n</italic> line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and… 
The Complexity of Sensing by Point
In assembly tasks it is often necessary to recognize parts arriving via a conveyor belt or a parts feeder at some robot work cell. Generally the parts feeder will have reduced the number of possible
5 Conclusions and Open Problems 4.4 an Algorithm with Subquadratic Overhead
A singly-exponential stratiication scheme for real semi-algebraic varieties and its applications. 28 If we stop because of (i), this means that throughout the way z + (y) and z ? (y) are visible to
Packing [1, Δ]-factors in graphs of small degree
TLDR
The problem of deciding whether a graph admits a [1,Δ]-factor k-packing is shown to be solvable in linear time for k = 2, but NP-complete for all k≥ 3, and the optimisation problem of minimising the total number of edges of the subgraphs of the packing is NP-hard even when restricted to subcubic planar graphs.
Randomized Algorithms for Minimum Distance Localization
TLDR
Two randomized approximation algorithms are presented that solve minimum distance localization in environments that may contain self-similarities and the performance of the proposed algorithms is evaluated empirically.
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
TLDR
The technique reduces the approximate range counting problem to that of finding the minimum rank of a data object in the range, with respect to a <i>random</i> permutation of the input.
Finding the Shortest Watchman Route in a Simple Polygon
TLDR
The first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route is presented, called the shortest watchman route.
Computing faces in segment and simplex arrangements (Preliminary Version).
Further Comparison of Algorithms for Geometric Intersection ProblemsD
The usual rst step in computing an overlay of two vector maps is to determine which pairs of segments (one from each map) intersect so as to perform line-breaking. We identify two classes of
Geometric and computational aspects of manufacturing processes
TLDR
This work focuses on stereolithography, which is emerging as one of the most popular rapid prototyping systems and casting processes, and model the process and its components geometrically, and recognizes the objects that can be formed using a re-usable two-part cast.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Lower bounds for algebraic computation trees
  • M. Ben-Or
  • Computer Science, Mathematics
    STOC
  • 1983
TLDR
All the apparently known lower bounds for linear decision trees are extended to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20].
Journal of the Aswmaatm for Computmg Machm.ry. Vd
  • Journal of the Aswmaatm for Computmg Machm.ry. Vd
  • 1990
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
  • B. Chazelle
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1988
TLDR
These results include, in particular, linear-size data structures for range and rectangle counting in two dimensions with logarithmic query time and a redefinition of data structures in terms of functional specifications.
A fast planar partition algorithm. I
  • K. Mulmuley
  • Mathematics, Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
Though the algorithm itself is simple, the global evolution of the partition is complex, which makes the analysis of the algorithm theoretically interesting in its own right.
Afastplanar partition algorithm, 1
  • Proceedings of the29th Anrrual IEEE Sy)?zposiu~n on Foundatiorzs of Conzpt~ter Scierzce
  • 1988
Afastplanar partition algorithm, 1
  • Proceedings of the29th Anrrual IEEE Sy)?zposiu~n on Foundatiorzs of Conzpt~ter Scierzce
  • 1988
Applications of random sampling in computational geometry, II
TLDR
Asymptotically tight bounds for a combinatorial quantity of interest in discrete and computational geometry, related to halfspace partitions of point sets, are given.
Reporting and Counting Intersections Between Two Sets of Line Segments
We consider the problem of computing all intersections between two sets S and T of line segments in the plane, where no two segments in S (similarly, T) intersect. We present an asymptotically
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
TLDR
A general purpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms, and it is believed that this technique will become a standard tool in writing geometric software.
Algorithms in Combinatorial Geometry
  • H. Edelsbrunner
  • Mathematics, Computer Science
    EATCS Monographs in Theoretical Computer Science
  • 1987
TLDR
This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.
...
1
2
3
4
...