A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
From MaRDI portal
Publication:1001364
DOI10.1007/s11750-008-0055-2zbMath1154.68542OpenAlexW2114531006MaRDI QIDQ1001364
Lázaro Cánovas, José Fernández, Blas Pelegrín, Boglárka G.-Tóth
Publication date: 17 February 2009
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-008-0055-2
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- DECOPOL -- Codes for decomposing a polygon into convex subpolygons
- Algorithms for the decomposition of a polygon into convex polygons
- The concept of state in discrete dynamic programming
- COMPUTATIONAL GEOMETRY COLUMN 29
- Decomposing a Polygon into Simpler Components
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Approximate convex decomposition of polygons
- FIST: fast industrial-strength triangulation of polygons
This page was built for publication: A practical algorithm for decomposing polygonal domains into convex polygons by diagonals