Introduction:
Shape segmentation is a fundamental problem of computer graphics and geometric modeling.
Although the existence segmentation algorithms of shapes have been widely studied in mathematics community, little
progress has been made on how to compute them on polygonal surfaces interactively using geodesic loops.
Method:
We compute the geodesic distance fields with improved Fast March Method (FMM) proposed by Xin and Wang.
We propose a new algorithm to compute geodesic loops over a triangulate surface and a new interactive shape
segmentation manner on triangulate surface.
Result:
The average computation time on 50K vertices model is less than 0.08s.
Discussion:
In the future, we will use an accurate geodesic algorithm and parallel computing techniques to improve our
algorithm to obtain better smooth geodesic loop.
Conclusion:
A large number of experimental results show that the algorithm proposed in this paper can effectively
achieve high precision geodesic loop paths, and our method can also be used to interactive shape segmentation in real
time.
Short geodesic loops and $$L^p$$ norms of eigenfunctions on large genus random surfaces
