Balanced partitions of 3-colored geometric sets in the plane

DOI10.1016/j.dam.2014.10.015zbMath1304.05008arXiv1708.06062OpenAlexW2142165987MaRDI QIDQ479011

Sergey Bereg, Carlos Seara, Kevin Verbeek, Jorge Urrutia, Mikio Kano, Rodrigo I. Silveira, Dolores Lara, Matias Korman, Ferran Hurtado

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.06062

zbMATH Keywords

dualitybipartitioncolored point setsham-sandwich theorem

Mathematics Subject Classification ID

Partitions of sets (05A18)

Related Items

Geometric systems of unbiased representatives, An optimal algorithm for plane matchings in multipartite geometric graphs, Diverse partitions of colored points, An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs, A survey of mass partitions, Discrete geometry on colored point sets in the plane -- a survey, Unnamed Item, Ham-sandwich cuts and center transversals in subspaces, Rainbow polygons for colored point sets in the plane, The balanced connected subgraph problem, Ham-Sandwich Cuts and Center Transversals in Subspaces

Cites Work

• Balanced line for a 3-colored point set in the plane
• Orthogonal equipartitions
• Sets on which several measures agree
• Generalizing ham sandwich cuts to equitable subdivisions
• Cutting the same fraction of several measures
• Discrete Geometry on Red and Blue Points in the Plane Lattice
• Simultaneous partitions of measures by \(k\)-fans
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item