Maximum rectilinear convex subsets

DOI10.1007/978-3-030-25027-0_19MaRDI QIDQ2291424zbMATH OpenOpenAlexFDO

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

Publication date 30 January 2020

Full work available at URL https://arxiv.org/abs/1907.07441

zbMATH Keywords

convex subsetsErdős-Szekeres problemsoptimizationorthoconvexityrectilinear convex hull

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Maximum rectilinear convex subsets
• On the definition and computation of rectilinear convex hulls
• Rectilinear convex hull with minimum area
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• scientific article; zbMATH DE number 4213490

Cited in

(7)

• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• Bottleneck convex subsets: finding k large convex sets in a point set
• Finding the Maximum Subset with Bounded Convex Curvature
• Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
• Rectilinear convex hull of points in 3D and applications
• Blaschke and separation theorems for orthogonal convex sets and some applications

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 Q2291424)