Minimum weight pseudo-triangulations

DOI10.1016/j.comgeo.2007.05.004zbMath1124.65024OpenAlexW2104031337MaRDI QIDQ2385693

Christos Levcopoulos, Joachim Gudmundsson

Publication date: 12 October 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/55072

zbMATH Keywords

computational geometryapproximation algorithmsgeometric networksminimum weight pseudo-triangulation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

On minimum weight pseudo-triangulations ⋮ Decomposing a simple polygon into pseudo-triangles and convex polygons ⋮ Minimum weight convex Steiner partitions ⋮ Empty pseudo-triangles in point sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• A new data structure for shortest path queries in a simple polygon
• Ray shooting in polygons using geodesic triangulations
• Drawing outerplanar minimum weight triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• Minimal tangent visibility graphs
• On the number of pseudo-triangulations of certain point sets
• On Constrained Minimum Pseudotriangulations
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Minimal Triangulations of Polygonal Domains
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Algorithms and Data Structures

This page was built for publication: Minimum weight pseudo-triangulations