OiO.lk Community platform!

Oio.lk is an excellent forum for developers, providing a wide range of resources, discussions, and support for those in the developer community. Join oio.lk today to connect with like-minded professionals, share insights, and stay updated on the latest trends and technologies in the development field.
  You need to log in or register to access the solved answers to this problem.
  • You have reached the maximum number of guest views allowed
  • Please register below to remove this limitation

mesh and non-manifold vertices: lokking for literature/algorithm

  • Thread starter Thread starter Paul18fr
  • Start date Start date
P

Paul18fr

Guest
I'm looking for literatures on how to detect non-manifold vertices (3d quads and trias); the following picture has been found on internet.

I'm starting from scratch without previous experience on that topic.

Thanks for any information

enter image description here

After detection, i guess the solution will be to renumber vertices so that each part becomes independant, but I need first to automatically detect the non-manifold vertices.

I would like to code it (Python), not using any external library.

Thanks
<p>I'm looking for literatures on how to detect non-manifold vertices (3d quads and trias); the following picture has been found on internet.</p>
<p>I'm starting from scratch without previous experience on that topic.</p>
<p>Thanks for any information</p>
<p><a href="https://i.sstatic.net/iiLuC5j8.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/iiLuC5j8.png" alt="enter image description here" /></a></p>
<p>After detection, i guess the solution will be to renumber vertices so that each part becomes independant, but I need first to automatically detect the non-manifold vertices.</p>
<p>I would like to code it (Python), not using any external library.</p>
<p>Thanks</p>
 
Top