Pages that link to "Item:Q1356410"
From MaRDI portal
The following pages link to Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410):
Displaying 18 items.
- About \(f\)-vectors of inscribed simplicial polytopes (Q282733) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces (Q1660623) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- Characterizing proximity trees (Q1920422) (← links)
- Scaffolding skeletons using spherical Voronoi diagrams (Q2413150) (← links)
- Intersection number and stability of some inscribable graphs (Q2520774) (← links)
- Six Topics on Inscribable Polytopes (Q2832782) (← links)
- Outerplanar Graphs and Delaunay Triangulations (Q2891323) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere (Q4020141) (← links)
- Weakly inscribed polyhedra (Q5864304) (← links)
- COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES (Q6134981) (← links)
