scientific article; zbMATH DE number 4064506
From MaRDI portal
Publication:3798256
Recommendations
Cited in
(17)- A space efficient greedy triangulation algorithm
- Voronoi diagrams with barriers and the shortest diagonal problem
- Time-space trade-offs for triangulations and Voronoi diagrams
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- A time-space trade-off for triangulations of points in the plane
- Fast greedy triangulation algorithms.
- On parallel complexity of planar triangulations
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
- Explicit Array-Based Compact Data Structures for Triangulations
- A Quadratic Time Algorithm for the Minmax Length Triangulation
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
- Spiral serpentine polygonization of a planar point set
- Fast algorithms for greedy triangulation
- An Algorithm to Construct Greedy Drawings of Triangulations
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
- Greedy triangulation can be efficiently implemented in the average case
- Greedy permutations and Finite Voronoi diagrams (media exposition)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798256)
