An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
From MaRDI portal
Publication:2408208
DOI10.1007/s00454-017-9895-6zbMath1372.68271arXiv1408.3310OpenAlexW1961817304MaRDI QIDQ2408208
Publication date: 10 October 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.3310
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Shape reconstruction from apparent contours. Theory and algorithms
- An optimal convex hull algorithm in any fixed dimension
- Computing Hermite and Smith normal forms of triangular integer matrices
- Congruence, similarity, and symmetries of geometric objects
- Free differential calculus. I: Derivation in the free group ring. II: The isomerphism problem of groups. III: Subgroups
- Fast multiplication of large numbers
- Computational group theory.
- Free differential calculus. II: The isomorphism problem of groups
- Bounds for the orders of the finite subgroups of G(k)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
