An efficient algorithm to compute subsets of points in ℤn

Authors:
Ana Pacheco;Pedro Real
Affiliations:
Dpto. Matemática Aplicada I, ETS Ingeniería Informática, Universidad de Sevilla, Spain;Dpto. Matemática Aplicada I, ETS Ingeniería Informática, Universidad de Sevilla, Spain
Venue:
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
Year:
2012

Citing 4
Cited 0

Connectivity in Digital Pictures

Journal of the ACM (JACM)
The Symmetry Group of Znq in the Lee Space and the Zqn-Linear Codes

AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hashing and canonicalizing Notation 3 graphs

Journal of Computer and System Sciences
Counting cases in substitope algorithms

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show a more efficient algorithm than that in [8] to compute subsets of points non-congruent by isometries. This algorithm can be used to reconstruct the object from the digital image. Both algorithms are compared, highlighting the improvements obtained in terms of CPU time.