On the union of fat wedges and separating a collection of segments by a line
- 30 November 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 3 (5) , 277-288
- https://doi.org/10.1016/0925-7721(93)90018-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- A fast planar partition algorithm, IJournal of Symbolic Computation, 1990
- An optimal algorithm for the boundary of a cell in a union of raysAlgorithmica, 1990
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986