scientific article; zbMATH DE number 7499212
From MaRDI portal
Publication:3391377
Recommendations
- A direct method for determining the lower convex hull of a finite point set in 3D
- A simple algorithm for building the 3-D convex hull
- Robust gift wrapping for the three-dimensional convex hull
- A new representation and algorithm for constructing convex hulls in higher dimensional spaces
- ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
- scientific article; zbMATH DE number 742638
- scientific article; zbMATH DE number 125273
- Quicker than Quickhull
- scientific article; zbMATH DE number 2123362
- scientific article; zbMATH DE number 123932
Cites work
- A direct method for determining the lower convex hull of a finite point set in 3D
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- A sweepline algorithm for Voronoi diagrams
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- Complexity and algorithms for computing Voronoi cells of lattices
- Computational Geometry in C
- Construction of K-Dimensional Delaunay Triangulations Using Local Transformations
- Convex hull based skew estimation
- Delaunay cells for arrangements of flats in hyperbolic space
- Design and implementation of a practical parallel Delaunay algorithm
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- Lifting projections of convex polyhedra
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
- Optimal \(N\)-term approximation by linear splines over anisotropic Delaunay triangulations
- Power Diagrams: Properties, Algorithms and Applications
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- QuickhullDisk: a faster convex hull algorithm for disks
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Rolling construction for anisotropic Delaunay surfaces
- Voronoi diagrams from convex hulls
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391377)
