Gift-wrapping based preimage computation algorithm

DOI10.1016/J.PATCOG.2008.10.003MaRDI QIDQ834263zbMATH OpenOpenAlexFDO

Authors Yan Gerard, David Coeurjolly, Fabien Feschet

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)

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)

• Gift-Wrapping Based Preimage Computation Algorithm
• 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

Describes a project that uses

Uses Software

• Qhull

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)