Discrete geometry on colored point sets in the plane -- a survey
From MaRDI portal
Publication:2657063
DOI10.1007/S00373-020-02210-8zbMATH Open1459.05032OpenAlexW3120210689MaRDI QIDQ2657063FDOQ2657063
Authors: J. Urrutia, Mikio Kano 
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
Recommendations
measuregeometric graphempty polygonbalanced partitionplane latticebalanced linecolored point setdiscrete geometry in the plane
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Equitable subdivisions within polygonal regions
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- Large bichromatic point sets admit empty monochromatic 4-gons
- Title not available (Why is that?)
- Empty monochromatic triangles
- On Erdős-Szekeres-type problems
- Using equivariant obstruction theory in combinatorial geometry
- Bipartite embeddings of trees in the plane
- On Hamiltonian alternating cycles and paths
- Straight line embeddings of rooted star forests in the plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Simple alternating path problem
- Algorithms for ham-sandwich cuts
- Splitting necklaces
- Cutting the same fraction of several measures
- Generalized sandwich theorems
- Geodesic ham-sandwich cuts
- Balanced partitions of two sets of points in the plane
- Balanced line for a 3-colored point set in the plane
- Balanced partitions of 3-colored geometric sets in the plane
- On the number of balanced lines
- Orthogonal equipartitions
- Generalizing ham sandwich cuts to equitable subdivisions
- Discrete geometry on red and blue points in the plane lattice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simultaneous partitions of measures by \(k\)-fans
- Partitioning with two lines in the plane
- On balanced 4-holes in bichromatic point sets
- Monochromatic empty triangles in two-colored point sets
- Edge-removal and non-crossing configurations in geometric graphs
- On a matching problem in the plane
- Matching colored points in the plane: Some new results
- Equipartition of two measures by a 4-fan
- Convex equipartitions: the spicy chicken theorem
- New results on the coarseness of bicolored point sets
- On the coarseness of bicolored point sets
- Encompassing colored planar straight line graphs
- Equipartitions of measures by 2-fans
- Title not available (Why is that?)
- The number of generalized balanced lines
- Bisection of Circle Colorings
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Title not available (Why is that?)
- Perfect partitions of convex sets in the plane
- Title not available (Why is that?)
- Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane
- Title not available (Why is that?)
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Convex equipartitions of colored point sets
- Near equipartitions of colored point sets
- Pointed binary encompassing trees: simple and optimal
- Title not available (Why is that?)
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- Vertex-colored encompassing graphs
- Sur la division des ensembles de l'espace par les plans et des ensembles plans par les cercles
- Title not available (Why is that?)
- Intersection number of two connected geometric graphs
- Combinatorial Geometry and Graph Theory
- On plane spanning trees and cycles of multicolored point sets with few intersections
- On the length of longest alternating paths for multicoloured point sets in convex position
- Long alternating paths in bicolored point sets
- General Balanced Subdivision of Two Sets of Points in the Plane
- On polygons enclosing point sets. II
- On polygons enclosing point sets
- Bichromatic lines with few points
- Bichromatic and equichromatic lines in \(\mathbb C^2\) and \(\mathbb R^2\)
- The hamburger theorem
- Linear transformation distance for bichromatic matchings
- Bichromatic compatible matchings
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
- Universal sets for straight-line embeddings of bicolored graphs
- Computing balanced islands in two colored point sets in the plane
- Balanced convex partitions of measures in \(\mathbb R^{d}\)
- A note on caterpillar-embeddings with no two parallel edges
- Hamiltonian orthogeodesic alternating paths
- Functions, measures, and equipartitioning convex \(k\)-fans
- Empty monochromatic simplices
- $K_{1,3}$-covering red and blue points in the plane
- Bisecting measures with hyperplane arrangements
- Measure partitions using hyperplanes with fixed directions
- On polygons excluding point sets
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points
- Monochromatic geometric \(k\)-factors in red-blue sets with white and Steiner points
- Balanced subdivisions with boundary condition of two sets of points in the plane
- Weight-equitable subdivision of red and blue points in the plane
- Combinatorial Geometry and Graph Theory
- Graph Drawing
Cited In (8)
This page was built for publication: Discrete geometry on colored point sets in the plane -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657063)
