Approximate convex decomposition of polygons
From MaRDI portal
Publication:5361650
DOI10.1145/997817.997823zbMath1376.68152OpenAlexW2108865768MaRDI QIDQ5361650
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/997817.997823
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard Analysis ⋮ A practical algorithm for decomposing polygonal domains into convex polygons by diagonals ⋮ Approximate convex decomposition of polyhedra and its applications
This page was built for publication: Approximate convex decomposition of polygons