An efficient algorithm for determining the convex hull of a finite planar set

Cites work

A Tournament Problem

Cited in

(only showing first 100 items - show all)

Fast algorithms for the density finding problem
Highway hull revisited
A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
A note on the expected time required to construct the outer layer
Lipschitz condition in minimum norm problems on bounded functions
Some performance tests of convex hull algorithms
Some dynamic computational geometry problems
Quasi-convex optimization
Generalized Delaunay triangulation for planar graphs
Finding transversals for sets of simple geometric figures
Polygonizations of point sets in the plane
An O(n) algorithm for least squares quasi-convex approximation
On determining the on-line minimax linear fit to a discrete point set in the plane
Geometric complexity of some location problems
Geometric problems on two-dimensional array processors
A new O(n \,n) algorithm for computing the intersection of convex polygons
A lower bound on the complexity of the convex hull problem for simple polyhedra
Finding the convex hull of a sorted point set in parallel
An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
A linear algorithm for finding the convex hull of a simple polygon
Another efficient algorithm for convex hulls in two dimensions
Voronoi diagrams from convex hulls
On the (n n) lower bound for convex hull and maximal vector determination
A note on linear expected time algorithms for finding convex hulls
A note on finding convex hulls via maximal vectors
Average time behavior of distributive sorting algorithms
The design and analysis of a new hybrid sorting algorithm
How to reduce the average complexity of convex hull finding algorithms
Linear decision trees are too weak for convex hull problem
On the computer generation of random convex hulls
On the average complexity of some bucketing algorithms
On the complexity of finding the convex hull of a set of points
Maintenance of configurations in the plane
A constant-time parallel algorithm for computing convex hulls
Moment inequalities for random variables in computational geometry
Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
Small-dimensional linear programming and convex hulls made easy
Computing the convex hull in a hammock
The role of Steiner hulls in the solution to Steiner tree problems
Applications of a semi-dynamic convex hull algorithm
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
Constructing strongly convex hulls using exact or rounded arithmetic
Fast linear expected-time algorithms for computing maxima and convex hulls
A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
A more efficient convex hull algorithm
A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them
Convex hull of a finite set of points in two dimensions
A fast convex hull algorithm
Divide and conquer for linear expected time
An approximate algorithm for computing multidimensional convex hulls
Numerical stability of a convex hull algorithm for simple polygons
An optimal convex hull algorithm in any fixed dimension
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
A workbench for computational geometry
Computing minimum length paths of a given homotopy class
Robust gift wrapping for the three-dimensional convex hull
Derandomizing an output-sensitive convex hull algorithm in three dimensions
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
The biobjective absolute center problem
An algorithm reconstructing convex lattice sets.
A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
On shortest three-edge-connected Steiner networks with Euclidean distance
Visual attractiveness in routing problems: a review
\(\alpha\)-concave hull, a generalization of convex hull
Convex-hull algorithms: implementation, testing, and experimentation
A force-directed algorithm for drawing directed graphs symmetrically
Targeted influential nodes selection in location-aware social networks
Near-linear time approximation schemes for geometric maximum coverage
Determination of Q-convex sets by X-rays
Considering the attractor structure of chaotic maps for observer-based synchronization problems
Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots
Constructing the convex hull of a partially sorted set of points
Optimal output-sensitive convex hull algorithms in two and three dimensions
Output-sensitive results on convex hulls, extreme points, and related problems
Lower bounds for maximal and convex layers problems
Applications of a two-dimensional hidden-line algorithm to other geometric problems
Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
A time-optimal parallel algorithm for three-dimensional convex hulls
An algorithm for the construction of convex hulls in simple integer recourse programming
Convex hulls of spheres and convex hulls of disjoint convex polytopes
On computing the convex hull of (piecewise) curved objects
Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Multimesh finite element methods: solving PDEs on multiple intersecting meshes
Index-based, high-dimensional, cosine threshold querying with optimality guarantees
A new variational approach based on level-set function for convex hull problem with outliers
Extremal convex polygons inscribed in a given convex polygon
Affine invariant triangulations
Further steps on the reconstruction of convex polyominoes from orthogonal projections
A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
Rearranging a sequence of points onto a line
Speed optimizations for liner networks with business constraints
A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
A new framework to relax composite functions in nonlinear programs
A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
Implementation of Pellet's theorem
City-courier routing and scheduling problems

This page was built for publication: An efficient algorithm for determining the convex hull of a finite planar set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2552382)