A workbench for computational geometry
From MaRDI portal
Publication:1322571
DOI10.1007/BF01187021zbMath0804.68148WikidataQ62037500 ScholiaQ62037500MaRDI QIDQ1322571
Publication date: 5 May 1994
Published in: Algorithmica (Search for Journal in Brave)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- A sweepline algorithm for Voronoi diagrams
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On-line construction of the convex hull of a simple polyline
- A new data structure for representing sorted lists
- Generating binary trees at random
- Triangulating a simple polygon
- Uniform generation of forests of restricted height
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Visibility of a simple polygon
- Triangulating Simple Polygons and Equivalent Problems
- Self-adjusting binary search trees
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Connect-the-dots: A new heuristic
- A New Approach to Planar Point Location
- Optimal Search in Planar Subdivisions
- Sorting jordan sequences in linear time using level-linked search trees
