Pages that link to "Item:Q701788"
From MaRDI portal
The following pages link to A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788):
Displaying 5 items.
- A tight bound for the Delaunay triangulation of points on a polyhedron (Q443906) (← links)
- Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space (Q603856) (← links)
- Parallel Delaunay triangulation in three dimensions (Q695951) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
