ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS

DOI10.1142/S0218195999000121zbMath1028.65013OpenAlexW2100595965MaRDI QIDQ4513241

Jorge Urrutia, Evangelos Kranakis

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195999000121

zbMATH Keywords

algorithmssimple polygonsSteiner pointsisomorphic triangulations

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Constructing pairwise disjoint paths with few links ⋮ INTRINSIC MORPHING OF COMPATIBLE TRIANGULATIONS ⋮ Compatible connectivity augmentation of planar disconnected graphs ⋮ On compatible triangulations with a minimum number of Steiner points ⋮ Towards compatible triangulations.

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• On compatible triangulations of simple polygons

This page was built for publication: ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS