The rectilinear convex hull of line segments
From MaRDI portal
Publication:6546584
DOI10.1007/978-3-031-43587-4_3MaRDI QIDQ6546584
P. Pérez-Lantero, Carlos Seara, Carlos Alegría, Unnamed Author
Publication date: 29 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Fitting a two-joint orthogonal chain to a point set
- Reconstructing orthogonal polyhedra from putative vertex sets
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
- On the definition and computation of rectilinear convex hulls
- Computing \(D\)-convex hulls in the plane
- On the X-Y convex hull of a set of X-Y polygons
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- On-line construction of the convex hull of a simple polyline
- An optimal convex hull algorithm in any fixed dimension
- Restricted-orientation convexity.
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Partial convexity
- A quantum search algorithm of two-dimensional convex hull
This page was built for publication: The rectilinear convex hull of line segments
