Gift-wrapping based preimage computation algorithm
From MaRDI portal
Publication:834263
DOI10.1016/J.PATCOG.2008.10.003zbMATH Open1192.68573OpenAlexW1997952917MaRDI QIDQ834263FDOQ834263
Fabien Feschet, Yan Gerard, David Coeurjolly
Publication date: 19 August 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.10.003
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
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- The quickhull algorithm for convex hulls
- Digital straightness -- a review
- On digital plane preimage structure
- An elementary digital plane recognition algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
- Digital planarity -- a review
- Title not available (Why is that?)
- Discrete Representation of Straight Lines
- Title not available (Why is that?)
- Geometric constructions in the digital plane
- Recognition of Blurred Pieces of Discrete Planes
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- Gift-Wrapping Based Preimage Computation Algorithm
Cited In (3)
Uses Software
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)
