Immersed polygons and their diagonal triangulations
DOI10.1070/IM2008V072N01ABEH002392zbMATH Open1178.05034OpenAlexW2038094768MaRDI QIDQ3520100FDOQ3520100
Authors: A. A. Tuzhilin, A. O. Ivanov
Publication date: 20 August 2008
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/im2008v072n01abeh002392
Recommendations
- Uniqueness of Steiner minimal trees on boundaries in general position
- Steiner polygons in the Steiner problem
- On Steiner minimal trees with \(L_ p\) distance
- Analytic formulas for full Steiner trees
- Two new criteria for finding Steiner hulls in Steiner tree problems
- Steiner minimal trees for regular polygons
- Solution of the Steiner problem for convex boundaries
- The Steiner minimal network for convex configurations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Differential geometry of immersions (minimal, prescribed curvature, tight, etc.) (53C42) Inequalities and extremum problems in real or complex geometry (51M16) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Cited In (4)
This page was built for publication: Immersed polygons and their diagonal triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520100)