Combinatorics and Algorithms of Arrangements
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- A singly exponential stratification scheme for real semi-algebraic varieties and its applicationsTheoretical Computer Science, 1991
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- On the shortest paths between two convex polyhedraJournal of the ACM, 1988
- On a circle placement problemComputing, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979