Proceedings of the Eighth Annual Symposium on Computational Geometry: Berlin, Germany, June 10-12, 1992 |
Contents
June 1012 | 1 |
A Class of Convex Programs with Applications to Computational Geometry | 9 |
Linear Optimization Queries | 16 |
Copyright | |
24 other sections not shown
Common terms and phrases
3-space angle apply boundary cell Chazelle complexity Computational Geometry Computer Science consider constant construction contains convex hull curve d-simplices data structure decomposition define Delaunay triangulation denote dimension distance dynamic Edelsbrunner edges endpoints Euclidean face facet Figure finite flip function geodesic given gorithm graph greedy algorithm Guibas halfspace Hausdorff distance Hence hourglasses hyperplanes input intersection k-box Lemma linear programming minimum node O(log O(n log O(n² O(nlogn obtain optical optimal pair parallel parameter parametric search partition planar planar graphs plane point set polyhedral polynomial polytope preprocessing problem Proc processors Proof random range searching ray shooting recursively region resp result rithm segment sequence Sharir shortest path simple polygon simplex simplex range searching simplices solved space spanners Step subdivision subset Symp technique Theorem tion topological total number tree v₁ vector vertex vertices visible Voronoi diagram weight