Minimum weight pseudo-triangulations
From MaRDI portal
Publication:2385693
DOI10.1016/J.COMGEO.2007.05.004zbMATH Open1124.65024OpenAlexW2104031337MaRDI QIDQ2385693FDOQ2385693
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
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
- Triangulating a simple polygon in linear time
- On the number of pseudo-triangulations of certain point sets
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Drawing outerplanar minimum weight triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topologically sweeping visibility complexes via pseudotriangulations
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Ray shooting in polygons using geodesic triangulations
- Minimal Triangulations of Polygonal Domains
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- Minimal tangent visibility graphs
- Deformable free space tilings for kinetic collision detection.
- Title not available (Why is that?)
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- On constrained minimum pseudotriangulations
- Algorithms and Data Structures
- Minimum weight triangulation is NP-hard
- A new data structure for shortest path queries in a simple polygon
Cited In (12)
- Minimum weight convex Steiner partitions
- Empty pseudo-triangles in point sets
- Tight degree bounds for pseudo-triangulations of points
- On minimum weight pseudo-triangulations
- The stochastic walk algorithms for point location in pseudo-triangulations
- Resolving Loads with Positive Interior Stresses
- Algorithms and Computation
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Minimum weight disk triangulations and fillings
- Convexity minimizes pseudo-triangulations
- Decomposing a simple polygon into pseudo-triangles and convex polygons
- On constrained minimum pseudotriangulations
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)
