{"title":"Hierarchical Mesh Segmentation Using Waterfall and Dynamics","authors":"S. Delest, R. Boné, H. Cardot","doi":"10.1109/ISPA.2007.4383683","DOIUrl":null,"url":null,"abstract":"Mesh segmentation is a fundamental problem in computer graphics and has become an important component in many applications. This paper proposes a new hierarchical mesh segmentation method based on waterfall and dynamics. Watershed transformation allows segmenting the mesh in small patches and dynamics provide information about boundaries and merging possibilities. From region and boundary information, a hierarchical process based on waterfall is computed in order to build the merging tree. This tree contains all the schemes of segmentation and the user can easily browse the different levels of segmentation.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 5th International Symposium on Image and Signal Processing and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2007.4383683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Mesh segmentation is a fundamental problem in computer graphics and has become an important component in many applications. This paper proposes a new hierarchical mesh segmentation method based on waterfall and dynamics. Watershed transformation allows segmenting the mesh in small patches and dynamics provide information about boundaries and merging possibilities. From region and boundary information, a hierarchical process based on waterfall is computed in order to build the merging tree. This tree contains all the schemes of segmentation and the user can easily browse the different levels of segmentation.