Polygon Area Decomposition for Multiple-Robot Workspace Division

DOI10.1142/S0218195998000230MaRDI QIDQ4513222zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Equal-Area Locus-Based Convex Polygon Decomposition
• Equal-area locus-based convex polygon decomposition
• Algorithms for fair partitioning of convex polygons
• Algorithms for fair partitioning of convex polygons
• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

Cites work

• Decomposing a Polygon into Simpler Components
• Finding a manhattan path and related problems
• Nonobtuse triangulation of polygons
• On the geodesic Voronoi diagram of point sites in a simple polygon
• On the minimality of polygon triangulation
• On the Optimal Bisection of a Polygon
• Some NP-hard polygon decomposition problems
• Tiling polygons with parallelograms

Cited in

(5)

• Optimal multirobot coverage path planning: ideal-shaped spanning tree
• Approximate convex decomposition of polygons
• Equal-Area Locus-Based Convex Polygon Decomposition
• 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

This page was built for publication: Polygon Area Decomposition for Multiple-Robot Workspace Division

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513222)