Equitable subdivisions within polygonal regions
From MaRDI portal
Publication:2489545
DOI10.1016/J.COMGEO.2005.06.003zbMATH Open1098.65023OpenAlexW2023414931MaRDI QIDQ2489545FDOQ2489545
Authors: Sergey Bereg, Prosenjit Bose, David Kirkpatrick 
Publication date: 28 April 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.06.003
Recommendations
Cites Work
- Algorithms for ham-sandwich cuts
- Balanced partitions of two sets of points in the plane
- A characterization of planar graphs by pseudo-line arrangements
- Generalizing ham sandwich cuts to equitable subdivisions
- Geodesic ham-sandwich cuts
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constrained equitable \(3\)-cuttings
Cited In (14)
- Equal-area locus-based convex polygon decomposition
- Diverse partitions of colored points
- Geometric partitioning and robust ad-hoc network design
- Weight-equitable subdivision of red and blue points in the plane
- Finding equitable convex partitions of points in a polygon efficiently
- Generalized ham-sandwich cuts
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Title not available (Why is that?)
- A survey of mass partitions
- Discrete geometry on colored point sets in the plane -- a survey
- Dividing a territory among several vehicles
- Generalizing ham sandwich cuts to equitable subdivisions
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Computational geometric approaches to equitable districting: a survey
This page was built for publication: Equitable subdivisions within polygonal regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489545)
