The geometry of inner spanning trees for planar polygons

DOI10.1070/IM2012V076N02ABEH002581MaRDI QIDQ2889554zbMATH OpenOpenAlexFDO

Authors A. A. Tuzhilin, A. 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

Delaunay triangulationVoronoi diagramSteiner ratioplanar polygoncharacteristic domainEuclidean spanning treeinner spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Geometry of convex polygons and locally minimal binary trees spanning these polygons
• On geometric independency trees for points in the plane
• Transitions in geometric minimum spanning trees
• Sequences of spanning trees and a fixed tree theorem
• Short trees in polygons

Cited in

(1)

• Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon

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

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