Triangulations without pointed spanning trees
From MaRDI portal
Publication:2479476
DOI10.1016/j.comgeo.2007.07.006zbMath1159.05304WikidataQ61732490 ScholiaQ61732490MaRDI QIDQ2479476
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
05C05: Trees
05C10: Planar graphs; geometric and topological aspects of graph theory
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
A History of Flips in Combinatorial Triangulations, Making triangulations 4-connected using flips, Pointed binary encompassing trees: simple and optimal, Connecting colored point sets, On minimum weight pseudo-triangulations, Arc diagrams, flip distances, and Hamiltonian triangulations
Cites Work