Recognition of pieces of arithmetic hyperplanes using the Stern-Brocot tree

DOI10.1007/S10851-025-01229-XMaRDI QIDQ7009605zbMATH OpenFDO

Authors Bastien Laboureix, Alban Mattei, Jacques-Olivier Lachaud, Isabelle Debled-Rennesson

Publication date 20 March 2025

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10851-025-01229-X

zbMATH Keywords

arithmetic hyperplanesdigital plane recognitiondiscrete linesStern-Brocot tree

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A new lattice-based plane-probing algorithm
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
• An elementary digital plane recognition algorithm
• An output-sensitive algorithm to compute the normal vector of a digital plane
• Analysis of the subtractive algorithm for greatest common divisors
• Computation of the normal vector to a digital plane by sampling significant points
• Digital planarity -- a review
• Digital straightness -- a review
• Discrete geometry and symbolic dynamics
• Discrete Representation of Straight Lines
• scientific article; zbMATH DE number 16592 (Why is no real title available?)
• scientific article; zbMATH DE number 2087482 (Why is no real title available?)
• scientific article; zbMATH DE number 1436417 (Why is no real title available?)
• Revisiting Digital Straight Segment Recognition
• The \(n\)-dimensional Stern-Brocot tree
• Two plane-probing algorithms for the computation of the normal vector to a digital plane
• Ueber eine zahlentheoretische Funktion.

This page was built for publication: Recognition of pieces of arithmetic hyperplanes using the Stern-Brocot tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009605)