Rectilinear Convex Hull with Minimum Area
From MaRDI portal
Publication:4899283
DOI10.1007/978-3-642-34191-5_22zbMath1374.68632arXiv1509.02627OpenAlexW3102835983MaRDI QIDQ4899283
Carlos Seara, Tzolkin Garduño, Carlos Alegría-Galicia, Areli Rosas-Navarrete, Jorge Urrutia
Publication date: 7 January 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.02627
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
On the \(\mathcal{O}_\beta\)-hull of a planar point set ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
Cites Work
- 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
- Computing \(D\)-convex hulls in the plane
- On functional separately convex hulls
- Strong restricted-orientation convexity
- 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
- Preprocessing Steiner problems from VLSI layout
- An Introduction to Metric Spaces and Fixed Point Theory
