Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
From MaRDI portal
Publication:2022326
DOI10.1007/s10898-020-00953-5zbMath1466.52001arXiv1710.10888OpenAlexW3092256677MaRDI QIDQ2022326
Carlos Alegría, Carlos Seara, Jorge Urrutia, David Orden
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10888
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
A fast and efficient algorithm for determining the connected orthogonal convex hulls, Shortcut hulls: vertex-restricted outer simplifications of polygons, Separating bichromatic point sets in the plane by restricted orientation convex hulls
Cites Work
- Unnamed Item
- Unnamed Item
- Fitting a two-joint orthogonal chain to a point set
- Reconstructing orthogonal polyhedra from putative vertex sets
- On the definition and computation of rectilinear convex hulls
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- Separating bichromatic point sets by L-shapes
- Computing \(D\)-convex hulls in the plane
- Convex hull properties and algorithms
- On the X-Y convex hull of a set of X-Y polygons
- On functional separately convex hulls
- Restricted-orientation convexity.
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Algorithms for Reporting and Counting Geometric Intersections
- On Finding the Maxima of a Set of Vectors
- Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
- Illumination of Orthogonal Polygons with Orthogonal Floodlights
- Preprocessing Steiner problems from VLSI layout
- Rectilinear Convex Hull with Minimum Area
