Proceedings of the Eighth Annual Symposium on Computational Geometry: Berlin, Germany, June 10-12, 1992
ACM Press, 1992 - Mathematics - 368 pages
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Class of Convex Programs with Applications to Computational Geometry
y Linear Optimization Queries
23 other sections not shown
0(n log 3-space angle apply approximate boundary cell Chazelle combinatorial complexity Computational Geometry Computer Science consider constant constraints construction contains convex hull copy curve d-simplices data structure decomposition define Delaunay triangulation denote dimension distance dynamic Edelsbrunner edges endpoints Euclidean face facet Figure finite flip function given gorithm graph greedy algorithm grid Guibas halfspace Hausdorff distance Hence hourglasses hyperplanes input intersection Lemma linear programming logn lower bound minimum node O(logn obtain optical optimal pair parallel parameter parametric search partition perturbation planar planar graphs plane point location 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 spanner Step subdivision subset Symp technique Theorem tion topological total number tree vector vertex vertices visible Voronoi diagram weight