Equitable subdivisions within polygonal regions
From MaRDI portal
Publication:2489545
Recommendations
Cites work
- scientific article; zbMATH DE number 1182904 (Why is no real title available?)
- scientific article; zbMATH DE number 1507295 (Why is no real title available?)
- A characterization of planar graphs by pseudo-line arrangements
- Algorithms for ham-sandwich cuts
- Balanced partitions of two sets of points in the plane
- Constrained equitable \(3\)-cuttings
- Generalizing ham sandwich cuts to equitable subdivisions
- Geodesic ham-sandwich cuts
Cited in
(14)- Equal-area locus-based convex polygon decomposition
- Diverse partitions of colored points
- Geometric partitioning and robust ad-hoc network design
- Finding equitable convex partitions of points in a polygon efficiently
- Weight-equitable subdivision of red and blue points in the plane
- Generalized ham-sandwich cuts
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- scientific article; zbMATH DE number 1507295 (Why is no real title available?)
- 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)