Probabilistic analysis for combinatorial functions of moving points

Authors:
Li Zhang;Harish Devarajan;Julien Basch;Piotr Indyk
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Year:
1997

Constructing higher-dimensional convex hulls at logarithmic cost per face

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Higher-dimensional Voronoi diagrams in linear expected time

Discrete & Computational Geometry
Fast collision detection among multiple moving spheres

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A practical evaluation of kinetic data structures

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Data structures for mobile data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Voronoi diagrams based on convex distance functions

SCG '85 Proceedings of the first annual symposium on Computational geometry
Kinder, gentler average-case analysis for convex hulls and maximal vectors

ACM SIGACT News
Voronoi Diagrams of Moving Points in the Plane

WG '91 Proceedings of the 17th International Workshop

Hi-index	0.01