Computing optimal islands

DOI10.1016/j.orl.2011.04.008zbMath1242.90183OpenAlexW2057213951MaRDI QIDQ433119

C. Bautista-Santiago, José-Miguel Díaz-Báñez, Jorge Urrutia, Inmaculada Ventura, Dolores Lara, Pablo Pérez-Lantero

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

classificationalgorithmscomputational geometrymaximum convex polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

On weighted sums of numbers of convex polygons in point sets ⋮ Carathéodory's theorem in depth ⋮ Peeling Potatoes Near-Optimally in Near-Linear Time ⋮ On rainbow quadrilaterals in colored point sets ⋮ Monochromatic partitioning of colored points by lines ⋮ Maximum-weight planar boxes in \(O(n^2)\) time (and better) ⋮ New results on stabbing segments with a polygon ⋮ Maximum Rectilinear Convex Subsets ⋮ New results on the coarseness of bicolored point sets ⋮ Computing the coarseness with strips or boxes ⋮ Optimum turn-restricted paths, nested compatibility, and optimum convex polygons

Cites Work

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

This page was built for publication: Computing optimal islands