Computational geometry: an introduction
Computational geometry: an introduction
The number of small semispaces of a finite set of points in the plane
Journal of Combinatorial Theory Series A
Voronoi diagrams and arrangements
Discrete & Computational Geometry
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
On k-hulls and related problems
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Helly-type theorems and geometric transversals
Handbook of discrete and computational geometry
Ray shooting and lines in space
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
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We illustrate the rich interface between computational and combinatorial geometry by a series of examples, including k-sets, randomized incremental algorithms, random sampling and partitioning, and analysis of geometric arrangements.