Equal-area locus-based convex polygon decomposition

DOI10.1016/J.TCS.2010.01.012zbMATH Open1191.68752OpenAlexW2054501634MaRDI QIDQ962170FDOQ962170

David Adjiashvili, David Peleg

Publication date: 6 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.012

Recommendations

• Equal-Area Locus-Based Convex Polygon Decomposition
• Algorithms for fair partitioning of convex polygons
• Algorithms for fair partitioning of convex polygons
• Finding equitable convex partitions of points in a polygon efficiently
• Polygon Area Decomposition for Multiple-Robot Workspace Division

zbMATH Keywords

polygon decompositionequitable subdivisionham sandwich

Mathematics Subject Classification ID

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

Cites Work

• Equitable subdivisions within polygonal regions
• Title not available (Why is that?)
• Generalizing ham sandwich cuts to equitable subdivisions
• Title not available (Why is that?)
• Simultaneous partitions of measures by \(k\)-fans
• Equipartitions of measures by 2-fans
• The Early History of the Ham Sandwich Theorem
• Title not available (Why is that?)
• Finding equitable convex partitions of points in a polygon efficiently
• Title not available (Why is that?)
• Discrete and Computational Geometry
• Polygon Area Decomposition for Multiple-Robot Workspace Division

Cited In (3)

• A general method for decomposing self-intersecting polygon to normal based on self-intersection points
• Equal-Area Locus-Based Convex Polygon Decomposition
• Polygon Area Decomposition for Multiple-Robot Workspace Division

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)