QuickhullDisk: a faster convex hull algorithm for disks
From MaRDI portal
Publication:2286150
DOI10.1016/j.amc.2019.124626zbMath1433.52002OpenAlexW2968391919MaRDI QIDQ2286150
Phan Thanh An, Deok-Soo Kim, Chanyoung Song, Joonghyun Ryu, Nguyen Kieu Linh, Nam Dũng Hoàng
Publication date: 9 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124626
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Unnamed Item ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Near optimal minimal convex hulls of disks ⋮ QuickhullDisk
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
- Region-expansion for the Voronoi diagram of 3D spheres
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
- On common transversals
- The complexity of incremental convex hull algorithms in \(R^ d\)
- Largest and smallest convex hulls for imprecise points
- Convex hull properties and algorithms
- Some dynamic computational geometry problems
- A convex hull algorithm for discs, and applications
- Convex hull of a finite set of points in two dimensions
- On the ball spanned by balls
- An approximate algorithm for computing multidimensional convex hulls
- An algorithmic separating hyperplane theorem and its applications
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
- On computing the convex hull of (piecewise) curved objects
- On the expected diameter, width, and complexity of a stochastic convex hull
- A characterization theorem and an algorithm for a convex hull problem
- 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
- Voronoi Diagrams and Delaunay Triangulations
- An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves
- gHull
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- The Ultimate Planar Convex Hull Algorithm?
- Convex hulls of finite sets of points in two and three dimensions
- A New Convex Hull Algorithm for Planar Sets
- Computational Geometry in C
- Data Structures for Mobile Data
- The quickhull algorithm for convex hulls
- Convex hull of a planar set of straight and circular line segments
- Finding the Convex Hull of Discs in Parallel
- Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
- An Algorithm for Convex Polytopes
- Computational Science and Its Applications – ICCSA 2004
- Computational Science and Its Applications – ICCSA 2004
- Quicksort
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
