Maximum rectilinear convex subsets
From MaRDI portal
Publication:2291424
DOI10.1007/978-3-030-25027-0_19OpenAlexW2965622787MaRDI QIDQ2291424
Carlos Seara, Pablo Pérez-Lantero, Jorge Urrutia, David Rappaport, Hernán González-Aguilar, David Orden, F. Javier Tejel
Publication date: 30 January 2020
Full work available at URL: https://arxiv.org/abs/1907.07441
Related Items
A fast and efficient algorithm for determining the connected orthogonal convex hulls, Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set, Bottleneck convex subsets: finding \(k\) large convex sets in a point set, A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
