Pages that link to "Item:Q5056107"
From MaRDI portal
The following pages link to Fast algorithms for greedy triangulation (Q5056107):
Displaying 5 items.
- Greedy drawings of triangulations (Q848683) (← links)
- The farthest point Delaunay triangulation minimizes angles (Q1188284) (← links)
- Approximating the minimum weight Steiner triangulation (Q1317876) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time (Q6102307) (← links)