Near equipartitions of colored point sets
From MaRDI portal
Publication:2401334
DOI10.1016/j.comgeo.2017.05.001zbMath1377.65026arXiv1602.02264OpenAlexW3103266813MaRDI QIDQ2401334
Claudiu Valculescu, Andreas F. Holmsen, Jan Kynčl
Publication date: 8 September 2017
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.02264
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Computational issues in computer and robotic vision (65D19)
Related Items
Diverse partitions of colored points ⋮ A survey of mass partitions ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Convex equipartitions of colored point sets ⋮ Rainbow polygons for colored point sets in the plane ⋮ CUTTING A PART FROM MANY MEASURES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stronger conclusion to the classical ham sandwich theorem
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Generalizing ham sandwich cuts to equitable subdivisions
- Convex equipartitions via equivariant obstruction theory
- Convex equipartitions: the spicy chicken theorem
- Generalized sandwich theorems
- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
- BALANCED SUBDIVISIONS WITH BOUNDARY CONDITION OF TWO SETS OF POINTS IN THE PLANE
- BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ d
- General Balanced Subdivision of Two Sets of Points in the Plane
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler