On the \(\mathcal{O}_\beta\)-hull of a planar point set

DOI10.1016/j.comgeo.2017.06.003zbMath1385.65021arXiv1509.02601OpenAlexW3103940077MaRDI QIDQ1699299

David Orden, Jorge Urrutia, Carlos Seara, Carlos Alegría-Galicia

Publication date: 19 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

fittingconvex hullarea optimizationperimeter optimizationrestricted-orientation geometry

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (7)

A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Empty squares in arbitrary orientation among points ⋮ Set estimation under biconvexity restrictions ⋮ Maximum Rectilinear Convex Subsets ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations

Cites Work

• Fitting a two-joint orthogonal chain to a point set
• On the definition and computation of rectilinear convex hulls
• Computing minimum-area rectilinear convex hull and \(L\)-shape
• Computing \(D\)-convex hulls in the plane
• Restricted-orientation convexity.
• Optimal computation of finitely oriented convex hulls
• On Some Distance Problems in Fixed Orientations
• On Finding the Maxima of a Set of Vectors
• Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
• Rectilinear Convex Hull with Minimum Area
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(\mathcal{O}_\beta\)-hull of a planar point set