Hierarchical Mesh Decomposition using Fuzzy Clustering and Cuts
Hierarchical Mesh Decomposition using Fuzzy Clustering and Cuts
Hierarchical Mesh Decomposition using Fuzzy Clustering and Cuts
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
K way case(3/3)• The probability that face f i belonging to patch P j is1defined as• To extract the fuzzy area, each pair of neighboringcomponents are proceeded similarly to the binarycase• Complexity: O(V 2 logV+IV 2 )P j( fi) 1Dist(f , REP(P ))V is number of vertex, I is number of iterationV 2 logV for all pair shortest path <strong>and</strong> minimum cut algorithmIV 2 for assigning faces to patcheslDist(f , REP(P ))iijl
Change language