A workbench for computational geometry
- 1 April 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 11 (4) , 404-428
- https://doi.org/10.1007/bf01187021
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Uniform generation of forests of restricted heightInformation Processing Letters, 1994
- On Generating Random Intervals and HyperrectanglesJournal of Computational and Graphical Statistics, 1993
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Connect-the-dots: A new heuristicComputer Vision, Graphics, and Image Processing, 1987
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Visibility of a simple polygonComputer Vision, Graphics, and Image Processing, 1983
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973