Arrangements of curves in the plane—topology, combinatorics, and algorithms
- 1 January 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 92 (2) , 319-336
- https://doi.org/10.1016/0304-3975(92)90319-b
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An optimal algorithm for the boundary of a cell in a union of raysAlgorithmica, 1990
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- An optimal algorithm for intersecting line segments in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- On a circle placement problemComputing, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985