S. Delest, R. Boné, and H. Cardot (France)
3D Segmentation, Hierarchical Queue Watershed, Water fall, Merging
This paper describes a patch-type segmentation method for fast partitioning of 3D triangular meshes. This method uses the hierarchical queue watershed algorithm as well as a merging process to limit over segmentation. The merging process is based on waterfall and offers an effective struc ture for checking the different merging levels in order to find the best level of segmentation. This method has ap plications for different problems in visualization and geo metrical modelling such as 3D feature extraction, mesh re duction, texture mapping of 3D surfaces or computer aided design.
Important Links:
Go Back
