Decomposing a simple polygon into pseudo-triangles and convex polygons
DOI10.1016/J.COMGEO.2007.10.005zbMATH Open1160.68044OpenAlexW2170271613MaRDI QIDQ934018FDOQ934018
Authors: Stefan Gerdjikov, Alexander Wolff 
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
Recommendations
- scientific article; zbMATH DE number 3986641
- Decomposing a Polygon into Simpler Components
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Topologically sweeping visibility complexes via pseudotriangulations
- Ray shooting in polygons using geodesic triangulations
- Approximation Algorithms for the Minimum Convex Partition Problem
- Minimum convex partition of a constrained point set
- Enumerating pseudo-triangulations in the plane
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Minimum weight pseudo-triangulations
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- Decomposing a Polygon into Simpler Components
- Title not available (Why is that?)
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Algorithms and Data Structures
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Minimum weight triangulation is NP-hard
Cited In (11)
- Decomposing a Polygon into Simpler Components
- Approximation algorithms for decomposing octilinear polygons
- A general method for decomposing self-intersecting polygon to normal based on self-intersection points
- Polygon vertex extremality and decomposition of polygons
- Decomposing Octilinear Polygons into Triangles and Rectangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
- Title not available (Why is that?)
This page was built for publication: Decomposing a simple polygon into pseudo-triangles and convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q934018)
