Computing optimal islands

DOI10.1016/J.ORL.2011.04.008MaRDI QIDQ433119zbMATHOpenAlexFDO

Authors C. Bautista-Santiago, J. M. Díaz-Báñez, J. Urrutia, D. Lara, P. Pérez-Lantero, I. Ventura

Publication date 13 July 2012

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2011.04.008

zbMATH Keywords

algorithmsclassificationcomputational geometrymaximum convex polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Computing balanced islands in two colored point sets in the plane
• Covering a bichromatic point set with two disjoint monochromatic disks
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• scientific article; zbMATH DE number 1830740

Cites work

• scientific article; zbMATH DE number 2209732 (Why is no real title available?)
• A new family of proximity graphs: class cover catch digraphs
• Approximation Algorithms for the Minimum Convex Partition Problem
• Approximation algorithms for combinatorial problems
• Approximation algorithms for the class cover problem
• Computing shortest heterochromatic monotone routes
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Finding k points with minimum diameter and related problems
• Finding minimum area \(k\)-gons
• Introduction to algorithms
• Minimum convex partition of a constrained point set
• On a straight-line embedding problem of graphs
• Pattern classification.
• Planar Formulae and Their Uses
• Sequential and parallel algorithms for finding a maximum convex polygon
• Simple alternating path problem
• Surface Approximation and Geometric Partitions
• The maximum box problem and its application to data analysis

Cited in

(13)

• Monochromatic partitioning of colored points by lines
• On rainbow quadrilaterals in colored point sets
• Computing the coarseness measure of a bicolored point set over guillotine partitions
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Maximum rectilinear convex subsets
• Optimal space coverage with white convex polygons
• Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
• Computing balanced islands in two colored point sets in the plane
• New results on the coarseness of bicolored point sets
• Computing the coarseness with strips or boxes
• Peeling potatoes near-optimally in near-linear time
• New results on stabbing segments with a polygon
• On weighted sums of numbers of convex polygons in point sets

This page was built for publication: Computing optimal islands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433119)