Another efficient algorithm for convex hulls in two dimensions
From MaRDI portal
Publication:1134526
DOI10.1016/0020-0190(79)90072-3zbMath0423.68032OpenAlexW1967241124WikidataQ55951483 ScholiaQ55951483MaRDI QIDQ1134526
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90072-3
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)
Related Items
Silhouette vectorization by affine scale-space ⋮ Continuous Markov equilibria with quasi-geometric discounting ⋮ Compressing spatio-temporal trajectories ⋮ An adaptable and extensible geometry kernel ⋮ Mean area of the convex hull of a run and tumble particle in two dimensions ⋮ Convergence of the embedded mean-variance optimal points with discrete sampling ⋮ On determining the on-line minimax linear fit to a discrete point set in the plane ⋮ Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data ⋮ A time-optimal parallel algorithm for three-dimensional convex hulls ⋮ COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON ⋮ Algorithm 995 ⋮ Space-efficient planar convex hull algorithms ⋮ Deconstructing approximate offsets ⋮ Geometry and algorithms for upper triangular tropical matrix identities ⋮ A fast algorithm to solve large-scale matrix games based on dimensionality reduction and its application in multiple unmanned combat air vehicles attack-defense decision-making ⋮ An efficient convex hull algorithm using affine transformation in planar point set ⋮ Further comments on Bykat's convex hull algorithm ⋮ Convex hulls of spheres and convex hulls of disjoint convex polytopes ⋮ Existence and hardness of conveyor belts ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ Testing convexity of figures under the uniform distribution ⋮ The convex hull of the run-and-tumble particle in a plane ⋮ Hommel's procedure in linear time ⋮ The two variable per inequality abstract domain ⋮ An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier ⋮ Linear time algorithm for optimal feed-link placement ⋮ An algorithm for continuous piecewise linear bounding of discrete time series data ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ On polyhedra induced by point sets in space ⋮ Classroom examples of robustness problems in geometric computations ⋮ AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE ⋮ On finding the convex hull of a simple polygon ⋮ Quasi-Monotonic Sequences: Theory, Algorithms and Applications ⋮ Unnamed Item ⋮ EXACT AND OPTIMAL CONVEX HULLS IN 2D ⋮ Unnamed Item ⋮ A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) ⋮ A new variational approach based on level-set function for convex hull problem with outliers ⋮ Robust Adaptive Routing Under Uncertainty ⋮ Grid peeling and the affine curve-shortening flow ⋮ Parameter identification of 1D fractal interpolation functions using bounding volumes ⋮ An effective implementation of a modified Laguerre method for the roots of a polynomial ⋮ Quicker than Quickhull
Cites Work
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
- A more efficient convex hull algorithm
- Convex hull of a finite set of points in two dimensions
- Two remarks on a convex hull algorithm
- Divide and conquer for linear expected time
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Constructing the convex hull of a set of points in the plane
- Convex hulls of finite sets of points in two and three dimensions
- A New Convex Hull Algorithm for Planar Sets
- Comments on convex hull of a finite set of points in two dimensions
This page was built for publication: Another efficient algorithm for convex hulls in two dimensions
