An optimal real-time algorithm for planar convex hulls
From MaRDI portal
Cited in
(34)- Topological sweep of the complete graph
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
- On determining the on-line minimax linear fit to a discrete point set in the plane
- On-line construction of the convex hull of a simple polyline
- Finding the convex hull of a sorted point set in parallel
- Maintenance of configurations in the plane
- Steady-paced-output and fractional-on-line algorithms on a RAM
- Computing the convex hull in a hammock
- Applications of a semi-dynamic convex hull algorithm
- Geometrical tools in classification
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel
- An algorithm for discrete approximation by quasi-convex functions on R^m
- Lower bounds for maximal and convex layers problems
- Connected component and simple polygon intersection searching
- Convex hulls of spheres and convex hulls of disjoint convex polytopes
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
- Two approaches to building time-windowed geometric data structures
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- On finding the convex hull of a simple polygon
- The convex hull of a set of convex polygons
- Convex hull of a planar set of straight and circular line segments
- Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
- Relative convex hulls in semi-dynamic arrangements
- Applications of a semi-dynamic convex hull algorithm
- Connected component and simple polygon intersection searching
- Inconstancy of finite and infinite sequences
- Interval scheduling on related machines
- Space-efficient planar convex hull algorithms
- Dynamic convex hulls under window-sliding updates
- Fitting a two-joint orthogonal chain to a point set
- Dynamic convex hulls for simple paths
- Dynamic convex hulls under window-sliding updates
- Dynamic convex hulls for simple paths
- The complexity of incremental convex hull algorithms in \(R^ d\)
This page was built for publication: An optimal real-time algorithm for planar convex hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190154)
