Decomposing a simple polygon into pseudo-triangles and convex polygons

Redirect to:

• Decomposing a simple polygon into pseudo-triangles and convex polygons

DOI10.1016/J.COMGEO.2007.10.005MaRDI QIDQ934018zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decompositiondynamic programmingconvex polygonssimple polygonpseudo-triangles

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• Algorithms and Data Structures
• Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
• Approximation Algorithms for the Minimum Convex Partition Problem
• Decomposing a Polygon into Simpler Components
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Enumerating pseudo-triangulations in the plane
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Minimum convex partition of a constrained point set
• Minimum weight pseudo-triangulations
• Minimum weight triangulation is NP-hard
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• Ray shooting in polygons using geodesic triangulations
• Topologically sweeping visibility complexes via pseudotriangulations

Cited in

(12)

• 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
• Singularity-free theory and adaptive finite element computations of arbitrarily-shaped dislocation loop dynamics in 3D heterogeneous material structures
• Decomposing Octilinear Polygons into Triangles and Rectangles
• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• scientific article; zbMATH DE number 2197927 (Why is no real title available?)
• scientific article; zbMATH DE number 515326 (Why is no real title available?)
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
• scientific article; zbMATH DE number 1424443 (Why is no real title available?)

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)