Maximum Rectilinear Convex Subsets
From MaRDI portal
Publication:5149759
DOI10.1137/19M1303010OpenAlexW2956823442MaRDI QIDQ5149759
David Orden, Carlos Seara, David Rappaport, Pablo Pérez-Lantero, Jorge Urrutia, Hernán González-Aguilar, F. 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
Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Recognition of largest empty orthoconvex polygon in a point set
- Computing optimal islands
- On the definition and computation of rectilinear convex hulls
- On \(k\)-gons and \(k\)-holes in point sets
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- Restricted-orientation convexity.
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- Research Problems in Discrete Geometry
- The Erdos-Szekeres problem on points in convex position – a survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum Rectilinear Convex Subsets