Digital Plane Recognition with Fewer Probes

DOI10.1007/978-3-030-14085-4_30OpenAlexW2916822346MaRDI QIDQ5237084

Tristan Roussillon, Jacques-Olivier Lachaud

Publication date: 16 October 2019

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_30

zbMATH Keywords

digital plane recognitionnormal estimationplane-probing algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

A new lattice-based plane-probing algorithm ⋮ An optimized framework for plane-probing algorithms ⋮ An alternative definition for digital convexity

Cites Work

• Unnamed Item
• Unnamed Item
• An output-sensitive algorithm to compute the normal vector of a digital plane
• Generation and recognition of digital planes using multi-dimensional continued fractions
• Decomposition of a three-dimensional discrete object surface into discrete plane pieces
• Two plane-probing algorithms for the computation of the normal vector to a digital plane
• An elementary digital plane recognition algorithm
• Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects
• A linear incremental algorithm for naive and standard digital lines and planes recognition
• Fast Combinatorial Algorithm for Tightly Separating Hyperplanes
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
• Computation of the Normal Vector to a Digital Plane by Sampling Significant Points

This page was built for publication: Digital Plane Recognition with Fewer Probes