Convex hulls of finite sets of points in two and three dimensions

General topics in the theory of software (68N01) Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Convex sets in (2) dimensions (including convex curves) (52A10) Algorithms in computer science (68W99) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Cited in

(only showing first 100 items - show all)

Distribution-sensitive algorithms
Geometric medians
On the two-dimensional Davenport-Schinzel problem
Linear time algorithms for convex and monotone approximation
An n log n algorithm for determining the congruity of polyhedra
Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
A note on the expected time required to construct the outer layer
Finding extreme points in three dimensions and solving the post-office problem in the plane
Linear time approximation of 3D convex polytopes
Finding transversals for sets of simple geometric figures
An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
Outlier respecting points approximation
A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
A new duality result concerning Voronoi diagrams
Quasi-convex optimization
Edge-skeletons in arrangements with applications
LR-visibility in polygons
Lower bounds for maximal and convex layers problems
An efficient algorithm for the three-dimensional diameter problem
A lower bound on the complexity of the convex hull problem for simple polyhedra
Random convex hulls and extreme value statistics
Space-efficient planar convex hull algorithms
Inconstancy of finite and infinite sequences
Mathematical morphological operations of boundary-represented geometric objects.
Hausdorff approximation of 3D convex polytopes
\(\alpha\)-concave hull, a generalization of convex hull
Two algorithms for constructing a Delaunay triangulation
QuickhullDisk: a faster convex hull algorithm for disks
Inner -approximation of the convex hull of finite sets
Parallel computational geometry
How to reduce the average complexity of convex hull finding algorithms
Finding the intersection of two convex polyhedra
Geometric containment and vector dominance
On determining the on-line minimax linear fit to a discrete point set in the plane
An approximate algorithm for computing multidimensional convex hulls
Pargeo: a library for parallel computational geometry
Computing smallest convex intersecting polygons
New parallel algorithms for convex hull and triangulation in 3-dimensional space
Robust gift wrapping for the three-dimensional convex hull
Derandomizing an output-sensitive convex hull algorithm in three dimensions
Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
A new O(n \,n) algorithm for computing the intersection of convex polygons
Geometric complexity of some location problems
Bisections and ham-sandwich cuts of convex polygons and polyhedra
A note on finding convex hulls via maximal vectors
Self-stabilizing gathering with strong multiplicity detection
Evaluation of sphericity error from coordinate measurement data using computational geometric techniques
Representing geometric structures in \(d\) dimensions: Topology and order
Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
Tetrahedrizing point sets in three dimensions
The \(\gamma\)-neighborhood graph
O(n) algorithms for discrete n-point approximation by quasi-convex functions
An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
Voronoi diagrams and arrangements
Computing depth contours of bivariate point clouds
An optimal convex hull algorithm in any fixed dimension
Fuzzy clustering using the convex hull as geometrical model
On the randomized construction of the Delaunay tree
Convex hulls of spheres and convex hulls of disjoint convex polytopes
A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
Extended box clustering for classification problems
Efficient Algorithms to Test Digital Convexity
The Persistent Homology of Cyclic Graphs
Maintaining multiple representations of dynamic data structures
On computing approximate convex hulls
Efficiently testing digital convexity and recognizing digital convex polygons
A time-optimal parallel algorithm for three-dimensional convex hulls
On finding the convex hull of a simple polygon
Comments on convex hull of a finite set of points in two dimensions
Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification
Another efficient algorithm for convex hulls in two dimensions
Voronoi diagrams from convex hulls
Applications of random sampling in computational geometry. II
Optimal output-sensitive convex hull algorithms in two and three dimensions
A dual approach for the continuous collapsing knapsack problem
Fast linear expected-time algorithms for computing maxima and convex hulls
Optimal algorithms for symmetry detection in two and three dimensions
On the (n n) lower bound for convex hull and maximal vector determination
Optimal parallel algorithms for computing convex hulls and for sorting
Parallel algorithms for some functions of two convex polygons
Parallel construction of subdivision hierarchies
The complexity of linear programming
Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
Maintenance of configurations in the plane
A new variational approach based on level-set function for convex hull problem with outliers
Output-sensitive results on convex hulls, extreme points, and related problems
Divide and conquer for linear expected time
Finding the intersection of n half-spaces in time O(n log n)
Approximating spheres and sphere patches
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
A simple algorithm for building the 3-D convex hull
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
Some dynamic computational geometry problems
Computing minimum-area rectilinear convex hull and L-shape
A comparison of sequential Delaunay triangulation algorithms.
Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée
Online multivariate changepoint detection: leveraging links with computational geometry

This page was built for publication: Convex hulls of finite sets of points in two and three dimensions

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