首页 | 本学科首页   官方微博 | 高级检索  
     


Cycle bases of graphs and sampled manifolds
Authors:Craig Gotsman  Kanela Kaligosi  Kurt Mehlhorn  Dimitrios Michail  Evangelia Pyrga  
Affiliation:

aTechnion-Israel Institute of Technology, Haifa, Israel

bMax-Planck-Institut für Informatik, Saarbrücken, Germany

Abstract:Point samples of a surface in View the MathML source are the dominant output of a multitude of 3D scanning devices. The usefulness of these devices rests on being able to extract properties of the surface from the sample. We show that, under certain sampling conditions, the minimum cycle basis of a nearest neighbor graph of the sample encodes topological information about the surface and yields bases for the trivial and non-trivial loops of the surface. We validate our results by experiments.
Keywords:Cycle basis  Homology basis  Manifold  Nearest neighbor graph  Non-trivial and trivial loops  Sample points
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号