Triangulations without pointed spanning trees

DOI10.1016/J.COMGEO.2007.07.006MaRDI QIDQ2479476zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Clemens Huemer, Hannes Krasser, Oswin Aichholzer

Publication date 26 March 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://idus.us.es/xmlui/handle/11441/56020

zbMATH Keywords

triangulationHamiltonian cyclespanning treeedge flippointed pseudo-triangulation

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Flipping edges in triangulations
• Flip distance between two triangulations of a point set is NP-complete
• A proof of the orbit conjecture for flipping edge-labelled triangulations

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 1142760 (Why is no real title available?)
• Acute triangulations of polygons
• Flipping edges in triangulations
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip

Cited in

(7)

• COMPUTATIONAL GEOMETRY COLUMN 23
• A history of flips in combinatorial triangulations
• Connecting colored point sets
• Pointed binary encompassing trees: simple and optimal
• On minimum weight pseudo-triangulations
• Arc diagrams, flip distances, and Hamiltonian triangulations
• Making triangulations 4-connected using flips

This page was built for publication: Triangulations without pointed spanning trees

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