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)
Computing a face in an arrangement of line segments
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Tail estimates for the space complexity of randomized incremental algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An upper bound for conforming Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
IEEE Transactions on Visualization and Computer Graphics
Introducing alpha shapes for the analysis of path integral Monte Carlo results
VIS '94 Proceedings of the conference on Visualization '94
SCCG '03 Proceedings of the 19th spring conference on Computer graphics
Urban Data Visualization with Voronoi Diagrams
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Kinetic Euclidean minimum spanning tree in the plane
Journal of Discrete Algorithms
| Hi-index | 0.00 |