Pages that link to "Item:Q5361564"

The following pages link to Nice point sets can have nasty Delaunay triangulations (Q5361564):

Displaying 12 items.

• Collision detection for deforming necklaces (Q598233) (← links)
• A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788) (← links)
• Quality mesh generation for molecular skin surfaces using restricted union of balls (Q1000920) (← links)
• Nice point sets can have nasty Delaunay triangulations (Q1404533) (← links)
• Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) (← links)
• Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty'' (Q1764170) (← links)
• On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes (Q1873689) (← links)
• There are simple and robust refinements (almost) as good as Delaunay (Q2229908) (← links)
• Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
• Modified Delaunay empty sphere condition in the problem of approximation of the gradient (Q2821885) (← links)
• (Q5075759) (← links)
• The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)