ShortLoop software can compute a set of non-trivial loops from point cloud data/simplicial complexes that represent a shortest homology basis. The simplicial complex need not be a surface and thus the software can handle very general input of triangulated domains with non-manifold artifacts. If the input is a point cloud data sampled from a smooth manifold, the loops will approximate a true shortest homology basis of the manifold. For precise definitions and explanations, please see the paper and also see the image gallery: T. K. Dey, J. Sun, and Yusu Wang. Approximating Loops in a Shortest Homology Basis from Point Data. ACM 26th Annual Symposium on Computational Geometry, 2010, pages 166-175.