Minimum weight pseudo-triangulations

DOI10.1016/J.COMGEO.2007.05.004MaRDI QIDQ2385693zbMATHOpenAlexFDO

Authors 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)

Recommendations

• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• New results for the minimum weight triangulation problem
• Polynomial-time instances of the minimum weight triangulation problem
• scientific article; zbMATH DE number 742947
• A New Heuristic for Minimum Weight Triangulation

Cites work

• scientific article; zbMATH DE number 4155925 (Why is no real title available?)
• scientific article; zbMATH DE number 2079328 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• A new data structure for shortest path queries in a simple polygon
• Algorithms and Data Structures
• Deformable free space tilings for kinetic collision detection.
• Drawing outerplanar minimum weight triangulations
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Minimal Triangulations of Polygonal Domains
• Minimal tangent visibility graphs
• Minimum weight triangulation is NP-hard
• On constrained minimum pseudotriangulations
• On the number of pseudo-triangulations of certain point sets
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• Ray shooting in polygons using geodesic triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• Triangulating a simple polygon in linear time

Cited in

(12)

• The stochastic walk algorithms for point location in pseudo-triangulations
• Convexity minimizes pseudo-triangulations
• On minimum weight pseudo-triangulations
• Resolving Loads with Positive Interior Stresses
• Empty pseudo-triangles in point sets
• On constrained minimum pseudotriangulations
• Minimum weight convex Steiner partitions
• Algorithms and Computation
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• Tight degree bounds for pseudo-triangulations of points
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Minimum weight disk triangulations and fillings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385693)