# An Algorithm for Canonical Forms of Finite Subsets of $$\mathbb {Z}^d$$Zd up to Affinities

@article{Paolini2017AnAF,
title={An Algorithm for Canonical Forms of Finite Subsets of \$\$\mathbb \{Z\}^d\$\$Zd up to Affinities},
author={Giovanni Paolini},
journal={Discrete & Computational Geometry},
year={2017},
volume={58},
pages={293-312}
}
• Giovanni Paolini
• Published in Discret. Comput. Geom. 2017
• Computer Science, Mathematics
• Discrete & Computational Geometry
• In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $$\mathbb {Z}^d$$Zd, up to affinities over $$\mathbb {Z}$$Z. For fixed dimension d, this algorithm has worst-case asymptotic complexity $$O(n \log ^2 n \, s\,\mu (s))$$O(nlog2nsμ(s)), where n is the number of points in the given subset, s is an upper bound to the size of the binary representation of any of the n points, and $$\mu (s)$$μ(s) is an upper bound to the number of operations required to… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

4

## Normal forms of triangles and quadrilaterals up to similarity

• Mathematics
• 2015
VIEW 2 EXCERPTS
CITES BACKGROUND

#### References

##### Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

## Orders of Finite Groups of Matrices

• Mathematics
• 2005
VIEW 1 EXCERPT

## Computing Hermite and Smith normal forms of triangular integer matrices

VIEW 2 EXCERPTS

## A course in computational algebraic number theory

• Henri Cohen
• Mathematics, Computer Science
• 1993
VIEW 1 EXCERPT

## Asymptotically fast triangulation of matrices over rings

• Mathematics, Computer Science
• SODA '90
• 1990
VIEW 1 EXCERPT

## Free Differential Calculus. II: The Isomorphism Problem of Groups

VIEW 1 EXCERPT

## Hafner and Kevin S . McCurley , Asymptotically fast triangularization of matrices over rings

• L. James
• SIAM Journal on Computing