Computing the coarseness with strips or boxes

DOI10.1016/j.dam.2017.02.022zbMath1361.05043OpenAlexW2600326758MaRDI QIDQ526818

Yong-Cai Geng, Sumit K. Garg

Publication date: 15 May 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.022

zbMATH Keywords

discrepancycomputational geometrystripscoarsenessrectangles

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The class cover problem with boxes
• Computing optimal islands
• Matching colored points with rectangles
• New results on the coarseness of bicolored point sets
• On the coarseness of bicolored point sets
• The maximum box problem and its application to data analysis
• On the range maximum-sum segment query problem
• Classifying negative and positive points by optimal box clustering
• Fast Algorithms for Finding Nearest Common Ancestors
• Geometric clusterings
• Bichromatic separability with two boxes: A general approach
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines
• Lowest common ancestors in trees and directed acyclic graphs