Voronoi diagrams and arrangements
Discrete & Computational Geometry
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Handbook of discrete and computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
Journal of Algorithms - Special issue on SODA '95 papers
Lectures on Discrete Geometry
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
SIAM Journal on Computing
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
Almost tight upper bounds for vertical decompositions in four dimensions
Journal of the ACM (JACM)
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
SIAM Journal on Computing
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research.