Triangulations Loosing Bundles and Weight

We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations can be used as an approximate solution for the minimum weight Steiner triangulation problem. We present new algorithms, implementations and experimental study for computing minimum weight Steiner triangulations.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Cem Boyaci, Hale Erten, Alper Üngör
• Keywords: CCCG 2007, Computational Geometry, Minimum Weight Steiner, Steiner Triangulations, Weight Steiner Triangulations