Skip to content

Alicewithrabbit/HoleDetection3D

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 

Repository files navigation

HoleDetection3D

3D holes detection algorithm

This work extend the 2D holes detection strategy proposed by Gypaets (2016.6.18) to 3D situation. Here, we propose the conectivity length of a local manifold to replace the area of polygon to detect the irragular triangular mesh patches which should be the holes. It achieves pretty good performance in finding holes in 3D situation. Example of the conectivity length of a local manifold (p1p2p3p4):

p1 ------ p2    
\         / \   
 \       /   \
  \     /     \
   \   /       \
    p3 ------- p4 

The connectivity length of above manifold is calculated as follows,

Conlen(p3) = length(p1-p3) + length(p1-p2) + length(p2-p3) + length(p2-p4) + length(p3-p4).   

Author: Chong WU, Department of Electronic Engineering, City University of Hong Kong, Hong Kong SAR, China.

Released Date: 2018.10.16

Inspired by the work of Gypaets, 2016.6.18, and URL is    
https://ww2.mathworks.cn/matlabcentral/fileexchange/57739-gypaets-findtheholes.

If you have found any bugs, have any suggestions or problems, please contact me at 

Email: imroxaswc@gmail.com

Syntax:

Input:    

p is a N-by-3 point clouds data, L is a thredshold (its value usually takes 2 to 3), and t is a raw triangular mesh of p which needs to be detected and remove the holes.

Output:     

t is a new triangular mesh after holes detection and elimination.

About

A 3D holes detection algorithm for triangular mesh

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages