Equal-area locus-based convex polygon decomposition

DOI10.1016/j.tcs.2010.01.012zbMath1191.68752OpenAlexW2054501634MaRDI QIDQ962170

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

zbMATH Keywords

polygon decompositionequitable subdivisionham sandwich

Mathematics Subject Classification ID

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

Related Items

A general method for decomposing self-intersecting polygon to normal based on self-intersection points

Cites Work

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