An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A geometric consistency theorem for a symbolic perturbation scheme
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Output sensitive construction of levels and Voronoi diagrams in Rd of order 1 to k
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Selection and sorting in totally monotone arrays
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A note on higher order Voronoi diagrams
Nordic Journal of Computing
| Hi-index | 0.00 |