Pages that link to "Item:Q599355"
From MaRDI portal
The following pages link to On the complexity of d-dimensional Voronoi diagrams (Q599355):
Displayed 10 items.
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993) (← links)
- Simplex based space filling designs (Q1044050) (← links)
- Arbitrarily large neighborly families of symmetric convex polytopes (Q1074868) (← links)
- On the randomized construction of the Delaunay tree (Q1210297) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Illuminating high-dimensional convex sets (Q1900056) (← links)
- Kernel interpolation (Q2275648) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- Representing stereo data with the Delaunay triangulation (Q2638828) (← links)
- Voronoi Diagrams of Moving Points (Q4513216) (← links)