Maximum rectilinear convex subsets

DOI10.1137/19M1303010MaRDI QIDQ5149759zbMATH OpenOpenAlexFDO

Authors David Orden, P. Pérez-Lantero, David Rappaport, Carlos Seara, J. Urrutia, Hernán González-Aguilar, Javier Tejel

Publication date 8 February 2021

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19m1303010

zbMATH Keywords

convex subsetsErdős-Szekeres problemsoptimizationrectilinear convex hull

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Rectilinear convex hull with minimum area
• scientific article; zbMATH DE number 4213490
• On the definition and computation of rectilinear convex hulls
• Sequential and parallel algorithms for finding a maximum convex polygon
• Finding Extremal Polygons

Cites work

• 4-holes in point sets
• Computing optimal islands
• scientific article; zbMATH DE number 4062042 (Why is no real title available?)
• scientific article; zbMATH DE number 3744018 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Lower bounds for the number of small convex \(k\)-holes
• On \(k\)-gons and \(k\)-holes in point sets
• On finding an empty staircase polygon of largest area (width) in a planar point-set
• On the \(\mathcal{O}_\beta\)-hull of a planar point set
• On the definition and computation of rectilinear convex hulls
• Recognition of largest empty orthoconvex polygon in a point set
• Research Problems in Discrete Geometry
• Restricted-orientation convexity.
• The Erdos-Szekeres problem on points in convex position – a survey

Cited in

(8)

• On finding an empty staircase polygon of largest area (width) in a planar point-set
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Maximum rectilinear convex subsets
• Finding the Maximum Subset with Bounded Convex Curvature
• Rectilinear convex hull with minimum area
• Rectilinear convex hull of points in 3D and applications
• Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
• On the definition and computation of rectilinear convex hulls

This page was built for publication: Maximum rectilinear convex subsets

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