Pages that link to "Item:Q911323"

The following pages link to Realizability of Delaunay triangulations (Q911323):

Displaying 23 items.

• An optimal algorithm for realizing a Delaunay triangulation (Q287080) (← links)
• Witness (Delaunay) graphs (Q551502) (← links)
• Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
• Toughness and Delaunay triangulations (Q803161) (← links)
• Approximating constrained tetrahedrizations (Q1208496) (← links)
• Simpler proof of a realizability theorem on Delaunay triangulations (Q1327308) (← links)
• The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
• Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
• Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces (Q1660623) (← links)
• Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
• Voronoi drawings of trees (Q1869748) (← links)
• The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
• Outerplanar Graphs and Delaunay Triangulations (Q2891323) (← links)
• An Experimental Study on Generating Planar Graphs (Q3004691) (← links)
• Approximate Proximity Drawings (Q3223952) (← links)
• Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
• Star-Unfolding Polygons (Q3452273) (← links)
• Subdivision Drawings of Hypergraphs (Q3611876) (← links)
• A simple method for resolving degeneracies in Delaunay triangulations (Q4630259) (← links)
• Nearest neighbour graph realizability is NP-hard (Q5096336) (← links)
• (Q5743479) (← links)
• The drawability problem for minimum weight triangulations (Q5958308) (← links)
• Computational geometry and discrete computations (Q6567748) (← links)