Immersed polygons and their diagonal triangulations
From MaRDI portal
Publication:3520100
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)
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
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)