Pages that link to "Item:Q1309732"

The following pages link to The expected number of \(k\)-faces of a Voronoi diagram (Q1309732):

Displayed 7 items.

• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) ‎ (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) ‎ (← links)
• Bounds on the geometric complexity of optimal centroidal Voronoi tesselations in 3D (Q779651) ‎ (← links)
• Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) ‎ (← links)
• On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes (Q1873689) ‎ (← links)
• Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) ‎ (← links)
• (Q5075759) ‎ (← links)