Equal-area locus-based convex polygon decomposition
From MaRDI portal
(Redirected from Publication:962170)
Recommendations
Cites work
- scientific article; zbMATH DE number 5506221 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1507290 (Why is no real title available?)
- scientific article; zbMATH DE number 1507295 (Why is no real title available?)
- Equipartitions of measures by 2-fans
- Equitable subdivisions within polygonal regions
- Finding equitable convex partitions of points in a polygon efficiently
- Generalizing ham sandwich cuts to equitable subdivisions
- On partitioning a cake
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- Simultaneous partitions of measures by \(k\)-fans
- The Early History of the Ham Sandwich Theorem
Cited in
(5)- A general method for decomposing self-intersecting polygon to normal based on self-intersection points
- Equal-Area Locus-Based Convex Polygon Decomposition
- Algorithms for fair partitioning of convex polygons
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- Algorithms for fair partitioning of convex polygons
This page was built for publication: Equal-area locus-based convex polygon decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962170)