An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
A fast planar partition algorithm, II
Journal of the ACM (JACM)
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimization over k-set Polytopes and Efficient k-set Enumeration
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An output-sensitive approach for the L1/L∞k-nearest-neighbor Voronoi diagram
ESA'11 Proceedings of the 19th European conference on Algorithms
Higher order city voronoi diagrams
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |