An efficient algorithm to compute subsets of points in Z^n

DOI10.1007/978-3-642-30238-1_7MaRDI QIDQ2900563zbMATH OpenOpenAlexWikidataFDO

Authors A. M. Pacheco, Pedro Real

Publication date 23 July 2012

Published in Computational Topology in Image Context (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30238-1_7

zbMATH Keywords

\(n\)-xeldigital imagegridhypercubeisometry

Mathematics Subject Classification ID

General topology of complexes (57Q05) Computing methodologies for image processing (68U10)

Recommendations

• An elementary digital plane recognition algorithm
• An optimal algorithm for geometrical congruence
• A fast and elementary algorithm for digital plane recognition
• scientific article; zbMATH DE number 738979
• scientific article; zbMATH DE number 2079720

Cited in

(5)

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
• scientific article; zbMATH DE number 738979 (Why is no real title available?)
• scientific article; zbMATH DE number 1440917 (Why is no real title available?)
• Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$

This page was built for publication: An efficient algorithm to compute subsets of points in \(\mathbb Z^n\)

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