A non-Hamiltonian, nondegenerate Delaunay triangulation

DOI10.1016/0020-0190(87)90124-4MaRDI QIDQ1108041zbMATH OpenOpenAlexFDO

Authors Michael B. Dillencourt

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90124-4

zbMATH Keywords

computational geometryDelaunay triangulationVoronoi diagramHamiltonian graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Other problems of combinatorial convexity (52A37)

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Traveling salesman cycles are not always subgraphs of Voronoi duals

Cited in

(14)

• Angle-restricted tours in the plane.
• On certain Hamiltonian inner triangulations
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• Good triangulations yield good tours
• Toughness and Delaunay triangulations
• 10-Gabriel graphs are Hamiltonian
• Matching points with squares
• An upper bound on the shortness exponent of inscribable polytopes
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• The \(\gamma\)-neighborhood graph
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
• 2-change for k-connected networks
• Connectivity of plane triangulations

This page was built for publication: A non-Hamiltonian, nondegenerate Delaunay triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108041)