Least path criterion (LPC) for unique indexing in a two-dimensional decagonal quasilattice
| dc.contributor.author | Mukhopadhyay N.K.; Lord E.A. | |
| dc.date.accessioned | 2025-05-24T09:55:12Z | |
| dc.description.abstract | The least path criterion or least path length in the context of redundant basis vector systems is discussed and a mathematical proof is presented of the uniqueness of indices obtained by applying the least path criterion. Though the method has greater generality, this paper concentrates on the two-dimensional decagonal lattice. The order of redundancy is also discussed; this will help eventually to correlate with other redundant but desirable indexing sets. © 2002 International Union of Crystallography Printed in Great Britain-all rights reserved. | |
| dc.identifier.doi | https://doi.org/10.1107/S0108767302008747 | |
| dc.identifier.uri | http://172.23.0.11:4000/handle/123456789/19611 | |
| dc.relation.ispartofseries | Acta Crystallographica Section A: Foundations of Crystallography | |
| dc.title | Least path criterion (LPC) for unique indexing in a two-dimensional decagonal quasilattice |