Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
The visibility graph of congruent discs is Hamiltonian
Computational Geometry: Theory and Applications
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry: Theory and Applications
Locating an Obnoxious Line among Planar Objects
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Largest bounding box, smallest diameter, and related problems on imprecise points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry: Theory and Applications
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
Hi-index | 0.00 |