QuickhullDisk: a faster convex hull algorithm for disks
From MaRDI portal
Publication:2286150
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- A New Convex Hull Algorithm for Planar Sets
- A characterization theorem and an algorithm for a convex hull problem
- A convex hull algorithm for discs, and applications
- An Algorithm for Convex Polytopes
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
- An algorithmic separating hyperplane theorem and its applications
- An approximate algorithm for computing multidimensional convex hulls
- An efficient algorithm for determining the convex hull of a finite planar set
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Computational Geometry in C
- Computational Science and Its Applications – ICCSA 2004
- Computational Science and Its Applications – ICCSA 2004
- Convex hull of a finite set of points in two dimensions
- Convex hull of a planar set of straight and circular line segments
- Convex hull properties and algorithms
- Convex hulls of finite sets of points in two and three dimensions
- Data Structures for Mobile Data
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
- Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
- Finding the Convex Hull of Discs in Parallel
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
- Largest and smallest convex hulls for imprecise points
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- On common transversals
- On computing the convex hull of (piecewise) curved objects
- On the ball spanned by balls
- On the identification of the convex hull of a finite set of points in the plane
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Quicksort
- Region-expansion for the Voronoi diagram of 3D spheres
- Some dynamic computational geometry problems
- The Ultimate Planar Convex Hull Algorithm?
- The complexity of incremental convex hull algorithms in \(R^ d\)
- The quickhull algorithm for convex hulls
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- 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
- Voronoi diagrams and Delaunay triangulations
- gHull, a GPU algorithm for 3D convex hull
Cited in
(9)- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- Near optimal minimal convex hulls of disks
- scientific article; zbMATH DE number 7499212 (Why is no real title available?)
- Faster algorithms for growing prioritized disks and rectangles
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- QuickhullDisk
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- scientific article; zbMATH DE number 7278008 (Why is no real title available?)
This page was built for publication: QuickhullDisk: a faster convex hull algorithm for disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286150)
