Crystallographic AlgoRithms And Tables
Version 2.1b1
Released 2008-07-19
This project is maintained by Dominik Berhardt
CARAT is a package for solving certain problems in mathematical crystallography.
It is distributed via
Lehrstuhl B fuer Mathematik
RWTH-Aachen
Prof. Plesken
Pontdriesch 10-16
52064 Aachen
Germany
email: carat@momo.math.rwth-aachen.de
NOTE: CARAT was developed for crystallographic groups in dimensions up to 6. Most algorithms also work in higher dimensions. However, integer overflow is not trapped in general.
The easiest way to compile CARAT is to go to the CARAT base directory (the one containing this REAMDME), and issue the following
./configure
make
CARAT relies on the GMP library (along with its header files) being installed at a standard location, so that the compiler and linker will find it. Otherwise, you will have to indicate their location with appropriate compiler/linker flags.
In order to clean up from a previous installation, you may want to to a
make clean
before building CARAT again.
Please submit bug reports and support requests via our GitHub issue tracker:
https://github.com/lbfm-rwth/carat/issues
CARAT is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
For details see the file LICENSE.