Oleksiy Busaryev, Tamal K Dey , Jian Sun, Yusu Wang
Research
Publications
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.
For detailed usage of the software, see the README file.
This software is based on a recent result described in the paper given below.
Codes are available for Linux, and
Windows. Please send an email to tamaldey@cse.ohio-state.edu to get
the password to access the download area.
paper.
Web-page
Image
gallery. Download
area.
- T. K. Dey, J. Sun, and Y. Wang. Approximating Loops in a Shortest Homology Basis from Point Data. ACM 26th Annual Symposium on Computational Geometry, 2010, pages 166--175.
Other Software : DelPSC,
Qualmesh,
SurfRemesh,
Cocone,
AMLS,
NormFet,
CurveSkel,
HanTun,
Segmatch
Acknowledgements:
The output
of the ShortLoop software can be viewed with GEOMVIEW.
Disclaimer: We do not intend to be responsible for the maintenance of the software.
Copyright: Jyamiti group at the Ohio State University. No commercial use of the software is permitted without proper license.