The geometry of inner spanning trees for planar polygons

DOI10.1070/IM2012V076N02ABEH002581zbMath1242.05071OpenAlexW1971340633MaRDI QIDQ2889554

A. A. Tuzhilin, Alexandr O. Ivanov

Publication date: 8 June 2012

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im2012v076n02abeh002581

zbMATH Keywords

Voronoi diagramDelaunay triangulationSteiner ratioplanar polygoncharacteristic domainEuclidean spanning treeinner spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Inequalities and extremum problems in real or complex geometry (51M16)

This page was built for publication: The geometry of inner spanning trees for planar polygons