Gift-wrapping based preimage computation algorithm

DOI10.1016/j.patcog.2008.10.003zbMath1192.68573OpenAlexW1997952917MaRDI QIDQ834263

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

zbMATH Keywords

convex hulldigital geometrychords setgift-wrappingvisibility cone

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Separability and Tight Enclosure of Point Sets

Uses Software

• Qhull

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Digital planarity -- a review
• Geometric constructions in the digital plane
• Digital straightness -- a review
• On digital plane preimage structure
• An elementary digital plane recognition algorithm
• Discrete Representation of Straight Lines
• The quickhull algorithm for convex hulls
• Recognition of Blurred Pieces of Discrete Planes
• A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
• Gift-Wrapping Based Preimage Computation Algorithm
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition