Pages that link to "Item:Q1764170"
From MaRDI portal
The following pages link to Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty'' (Q1764170):
Displaying 7 items.
- Computing convex quadrangulations (Q412380) (← links)
- Neighborly inscribed polytopes and Delaunay triangulations (Q1707359) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Multi-region Delaunay complex segmentation (Q2443059) (← links)
- (Q5075759) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
