Polygon Area Decomposition for Multiple-Robot Workspace Division
From MaRDI portal
Publication:4513222
DOI10.1142/S0218195998000230zbMath1035.68536OpenAlexW2140047299MaRDI QIDQ4513222
Susan Hert, Vladimir J. Lumelsky
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195998000230
Related Items (5)
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Equal-Area Locus-Based Convex Polygon Decomposition ⋮ Optimal multirobot coverage path planning: ideal-shaped spanning tree ⋮ Equal-area locus-based convex polygon decomposition ⋮ Approximate convex decomposition of polygons
Cites Work
- On the minimality of polygon triangulation
- Nonobtuse triangulation of polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Tiling polygons with parallelograms
- Finding a manhattan path and related problems
- Decomposing a Polygon into Simpler Components
- Some NP-hard polygon decomposition problems
- On the Optimal Bisection of a Polygon
This page was built for publication: Polygon Area Decomposition for Multiple-Robot Workspace Division
