Another efficient algorithm for convex hulls in two dimensions
From MaRDI portal
Cites work
- A more efficient convex hull algorithm
- A New Convex Hull Algorithm for Planar Sets
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
- An efficient algorithm for determining the convex hull of a finite planar set
- Comments on convex hull of a finite set of points in two dimensions
- Constructing the convex hull of a set of points in the plane
- Convex hull of a finite set of points in two dimensions
- Convex hulls of finite sets of points in two and three dimensions
- Divide and conquer for linear expected time
- On the identification of the convex hull of a finite set of points in the plane
- Two remarks on a convex hull algorithm
Cited in
(49)- Parameter identification of 1D fractal interpolation functions using bounding volumes
- On determining the on-line minimax linear fit to a discrete point set in the plane
- Further comments on Bykat's convex hull algorithm
- Convex-hull algorithms: implementation, testing, and experimentation
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Convex hulls of spheres and convex hulls of disjoint convex polytopes
- A new variational approach based on level-set function for convex hull problem with outliers
- Silhouette vectorization by affine scale-space
- Existence and hardness of conveyor belts
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Quicker than Quickhull
- An adaptable and extensible geometry kernel
- Geometry and algorithms for upper triangular tropical matrix identities
- On polyhedra induced by point sets in space
- Classroom examples of robustness problems in geometric computations
- Convergence of the embedded mean-variance optimal points with discrete sampling
- Continuous Markov equilibria with quasi-geometric discounting
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data
- On finding the convex hull of a simple polygon
- Hommel's procedure in linear time
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- EXACT AND OPTIMAL CONVEX HULLS IN 2D
- COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
- Linear time algorithm for optimal feed-link placement
- An algorithm for continuous piecewise linear bounding of discrete time series data
- Algorithm 995: An efficient parallel anisotropic Delaunay mesh generator for two-dimensional finite element analysis
- Robust adaptive routing under uncertainty
- Mean area of the convex hull of a run and tumble particle in two dimensions
- A manual comparison of convex hull algorithms (multimedia exposition)
- Streaming algorithms for planar convex hulls
- The convex hull of the run-and-tumble particle in a plane
- Testing convexity of figures under the uniform distribution
- Space-efficient planar convex hull algorithms
- 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
- The two variable per inequality abstract domain
- The power and limitations of uniform samples in testing properties of figures
- Dynamic convex hulls for simple paths
- Inner -approximation of the convex hull of finite sets
- Optimality and robustness in path-planning under initial uncertainty
- Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
- Dynamic convex hulls for simple paths
- Accelerating and verifying constant-time modular inversion
- Calculating the convex hull function and its nonsmooth points for a class of piecewise smooth functions
- Methods for identifying all extreme points of convex hulls in spaces of dimension greater than 3 revisited
- Compressing spatio-temporal trajectories
- An efficient convex hull algorithm using affine transformation in planar point set
This page was built for publication: Another efficient algorithm for convex hulls in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134526)
