Gift-wrapping based preimage computation algorithm
From MaRDI portal
Publication:834263
Recommendations
- Gift-Wrapping Based Preimage Computation Algorithm
- Robust gift wrapping for the three-dimensional convex hull
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A generalized preimage for the digital analytical hyperplane recognition
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 2079735 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- scientific article; zbMATH DE number 1436417 (Why is no real title available?)
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
- An elementary digital plane recognition algorithm
- Digital planarity -- a review
- Digital straightness -- a review
- Discrete Representation of Straight Lines
- Geometric constructions in the digital plane
- Gift-Wrapping Based Preimage Computation Algorithm
- On digital plane preimage structure
- Recognition of Blurred Pieces of Discrete Planes
- The quickhull algorithm for convex hulls
Cited in
(3)
This page was built for publication: Gift-wrapping based preimage computation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834263)