Computing the coarseness measure of a bicolored point set over guillotine partitions

DOI10.1016/j.rinam.2024.100503MaRDI QIDQ6657381

Pablo Pérez-Lantero, Luis H. Herrera, Carlos Seara, José Fernández Goycoolea

Publication date: 6 January 2025

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

zbMATH Keywords

dynamic programmingclusteringdiscrepancyguillotine partitioncoarseness measure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing optimal islands
• New results on the coarseness of bicolored point sets
• Computing the coarseness with strips or boxes
• On the coarseness of bicolored point sets
• The number of guillotine partitions in \(d\) dimensions
• Bichromatic lines with few points
• Importance of numerical implementation and clustering analysis in force-directed algorithms for accurate community detection
• A sequential ensemble clusterings generation algorithm for mixed data
• BALANCED SUBDIVISIONS WITH BOUNDARY CONDITION OF TWO SETS OF POINTS IN THE PLANE
• Geometric clusterings
• Bichromatic separability with two boxes: A general approach
• General Balanced Subdivision of Two Sets of Points in the Plane
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• Geometric discrepancy. An illustrated guide
• Monochromatic partitioning of colored points by lines

This page was built for publication: Computing the coarseness measure of a bicolored point set over guillotine partitions