Decomposing a simple polygon into pseudo-triangles and convex polygons
From MaRDI portal
Publication:934018
DOI10.1016/j.comgeo.2007.10.005zbMath1160.68044OpenAlexW2170271613MaRDI QIDQ934018
Alexander Wolff, Stefan Gerdjikov
Publication date: 29 July 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.005
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Related Items (2)
Approximation algorithms for decomposing octilinear polygons ⋮ A general method for decomposing self-intersecting polygon to normal based on self-intersection points
Cites Work
- Unnamed Item
- Unnamed Item
- Ray shooting in polygons using geodesic triangulations
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Enumerating pseudo-triangulations in the plane
- Topologically sweeping visibility complexes via pseudotriangulations
- Minimum weight pseudo-triangulations
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Decomposing a Polygon into Simpler Components
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Approximation Algorithms for the Minimum Convex Partition Problem
- Algorithms and Data Structures
- Minimum convex partition of a constrained point set
This page was built for publication: Decomposing a simple polygon into pseudo-triangles and convex polygons
