Rectilinear convex hull of points in 3D and applications
From MaRDI portal
Publication:6618155
DOI10.1007/S10898-024-01402-3zbMATH Open1548.52025MaRDI QIDQ6618155
P. Pérez-Lantero, J. Urrutia, Carlos Seara
Publication date: 14 October 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Convex sets in (3) dimensions (including convex surfaces) (52A15) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Title not available (Why is that?)
- Fitting a two-joint orthogonal chain to a point set
- Reconstructing orthogonal polyhedra from putative vertex sets
- The layer number of \(\alpha \)-evenly distributed point 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
- Restricted-orientation convexity.
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Three-dimensional layers of maxima
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- New estimates for convex layer numbers
- Linear-time fitting of a \(k\)-step function
- Maximal and convex layers of random point sets
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- On the convex layers of a planar set
- Computing the width of a set
- On Finding the Maxima of a Set of Vectors
- Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
- Maximum Rectilinear Convex Subsets
This page was built for publication: Rectilinear convex hull of points in 3D and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618155)
