Discrete geometry on colored point sets in the plane -- a survey
From MaRDI portal
Publication:2657063
DOI10.1007/s00373-020-02210-8zbMath1459.05032MaRDI QIDQ2657063
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02210-8
measure; geometric graph; empty polygon; balanced partition; plane lattice; balanced line; colored point set; discrete geometry in the plane
05B25: Combinatorial aspects of finite geometries
Related Items
A survey of mass partitions, Unnamed Item, Unnamed Item, Unnamed Item, Computing balanced convex partitions of lines, Advice complexity of online non-crossing matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balanced line for a 3-colored point set in the plane
- Balanced partitions of 3-colored geometric sets in the plane
- On balanced 4-holes in bichromatic point sets
- New results on the coarseness of bicolored point sets
- The number of generalized balanced lines
- On the coarseness of bicolored point sets
- Pointed binary encompassing trees: simple and optimal
- Vertex-colored encompassing graphs
- Empty monochromatic triangles
- On plane spanning trees and cycles of multicolored point sets with few intersections
- Geodesic ham-sandwich cuts
- Simple alternating path problem
- Long alternating paths in bicolored point sets
- Orthogonal equipartitions
- On polygons enclosing point sets. II
- Splitting necklaces
- Bipartite embeddings of trees in the plane
- Algorithms for ham-sandwich cuts
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Intersection number of two connected geometric graphs
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- Bichromatic lines with few points
- Generalizing ham sandwich cuts to equitable subdivisions
- Equipartition of two measures by a 4-fan
- Plane bichromatic trees of low degree
- Linear transformation distance for bichromatic matchings
- On Hamiltonian alternating cycles and paths
- The hamburger theorem
- Computing balanced islands in two colored point sets in the plane
- Convex equipartitions of colored point sets
- A note on caterpillar-embeddings with no two parallel edges
- Balanced partitions of two sets of points in the plane
- Perfect partitions of convex sets in the plane
- Hamiltonian orthogeodesic alternating paths
- Cutting the same fraction of several measures
- Functions, measures, and equipartitioning convex \(k\)-fans
- On a matching problem in the plane
- Straight line embeddings of rooted star forests in the plane
- Empty monochromatic simplices
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points
- Bichromatic compatible matchings
- Bichromatic and equichromatic lines in \(\mathbb C^2\) and \(\mathbb R^2\)
- Near equipartitions of colored point sets
- Convex equipartitions: the spicy chicken theorem
- Encompassing colored planar straight line graphs
- Equipartitions of measures by 2-fans
- Equitable subdivisions within polygonal regions
- On the length of longest alternating paths for multicoloured point sets in convex position
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
- Measure partitions using hyperplanes with fixed directions
- On polygons excluding point sets
- Using equivariant obstruction theory in combinatorial geometry
- Generalized sandwich theorems
- Discrete Geometry on Red and Blue Points in the Plane Lattice
- Universal Sets for Straight-Line Embeddings of Bicolored Graphs
- Monochromatic geometric k-factors in red-blue sets with white and Steiner points
- On Erdős-Szekeres-type problems
- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
- BALANCED SUBDIVISIONS WITH BOUNDARY CONDITION OF TWO SETS OF POINTS IN THE PLANE
- BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ d
- Bisection of Circle Colorings
- General Balanced Subdivision of Two Sets of Points in the Plane
- Partitioning with two lines in the plane
- Weight-Equitable Subdivision of Red and Blue Points in the Plane
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Bisecting measures with hyperplane arrangements
- $K_{1,3}$-covering red and blue points in the plane
- Combinatorial Geometry and Graph Theory
- Combinatorial Geometry and Graph Theory
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Sur la division des ensembles de l'espace par les plans et des ensembles plans par les cercles
- Graph Drawing
- 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
- On the number of balanced lines
- Matching colored points in the plane: Some new results
- Simultaneous partitions of measures by \(k\)-fans
