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
Planning algorithm for a convex polygonal object in two-dimensional polygonal space
Discrete & Computational Geometry
Almost tight upper bounds for the single cell and zone problems in three dimensions
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
| Hi-index | 0.00 |
The recent breakthrough of Halperin and Sharir on the complexity of lower envelopes of surfaces is described.