Flexible Mesh Segmentation through Integration of Geometric andTopological Features of Reeb Graphs
Mesh segmentation represents a crucial task in computer graphics and geometric analysis, with diverse applications spanning texture mapping, animation, and beyond. This paper introduces an innovative Reeb graph-based mesh segmentation method that seamlessly integrates geometric and topological featu...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2024-12 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Beguet Florian Lanquetin Sandrine Raffin Romain |
description | Mesh segmentation represents a crucial task in computer graphics and geometric analysis, with diverse applications spanning texture mapping, animation, and beyond. This paper introduces an innovative Reeb graph-based mesh segmentation method that seamlessly integrates geometric and topological features to achieve flexible and robust segmentation results. The proposed approach encompasses three primary phases. First, an enhanced topological skeleton construction efficiently captures the Reeb graph structure while preserving degenerate critical points. Second, a topological simplification process employing critical point cancellation reduces graph complexity while maintaining essential shape features and correspondences. Finally, a region growing algorithm leverages both Reeb graph adjacency and mesh vertex connectivity to generate contiguous, semantically meaningful segments. The presented method exhibits computational efficiency, achieving a complexity of \(O(n \log n\)) for a mesh containing n vertices. Its versatility and effectiveness are validated through application to both local geometry-based segmentation using the Shape Index and part-based decomposition utilizing the Shape Diameter Function. This flexible framework establishes a solid foundation for advanced analysis and applications across various domains, offering new possibilities for mesh processing and understanding. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3142732469</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3142732469</sourcerecordid><originalsourceid>FETCH-proquest_journals_31427324693</originalsourceid><addsrcrecordid>eNqNit0KgjAYQEcQJOU7DLoWdPOnriOti27Ke5n2OZW5z7YJPX5FPUBXB845C-IxzqNgFzO2Ir61QxiGLM1YknCP1LmCZ18roBewHb2BHEE74XrU1HUGZ9nRs3YgzddhSwvAEZzpGyr0vcQJFcq-EYrmINxswH6mK0BNCyOmzm7IshXKgv_jmmzzY3k4BZPBxwzWVQPORr9TxaOYZZzF6Z7_d70AtWZF3w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3142732469</pqid></control><display><type>article</type><title>Flexible Mesh Segmentation through Integration of Geometric andTopological Features of Reeb Graphs</title><source>Freely Accessible Journals</source><creator>Beguet Florian ; Lanquetin Sandrine ; Raffin Romain</creator><creatorcontrib>Beguet Florian ; Lanquetin Sandrine ; Raffin Romain</creatorcontrib><description>Mesh segmentation represents a crucial task in computer graphics and geometric analysis, with diverse applications spanning texture mapping, animation, and beyond. This paper introduces an innovative Reeb graph-based mesh segmentation method that seamlessly integrates geometric and topological features to achieve flexible and robust segmentation results. The proposed approach encompasses three primary phases. First, an enhanced topological skeleton construction efficiently captures the Reeb graph structure while preserving degenerate critical points. Second, a topological simplification process employing critical point cancellation reduces graph complexity while maintaining essential shape features and correspondences. Finally, a region growing algorithm leverages both Reeb graph adjacency and mesh vertex connectivity to generate contiguous, semantically meaningful segments. The presented method exhibits computational efficiency, achieving a complexity of \(O(n \log n\)) for a mesh containing n vertices. Its versatility and effectiveness are validated through application to both local geometry-based segmentation using the Shape Index and part-based decomposition utilizing the Shape Diameter Function. This flexible framework establishes a solid foundation for advanced analysis and applications across various domains, offering new possibilities for mesh processing and understanding.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Animation ; Apexes ; Complexity ; Computer graphics ; Critical point ; Graph theory ; Segmentation ; Texture mapping ; Topology</subject><ispartof>arXiv.org, 2024-12</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Beguet Florian</creatorcontrib><creatorcontrib>Lanquetin Sandrine</creatorcontrib><creatorcontrib>Raffin Romain</creatorcontrib><title>Flexible Mesh Segmentation through Integration of Geometric andTopological Features of Reeb Graphs</title><title>arXiv.org</title><description>Mesh segmentation represents a crucial task in computer graphics and geometric analysis, with diverse applications spanning texture mapping, animation, and beyond. This paper introduces an innovative Reeb graph-based mesh segmentation method that seamlessly integrates geometric and topological features to achieve flexible and robust segmentation results. The proposed approach encompasses three primary phases. First, an enhanced topological skeleton construction efficiently captures the Reeb graph structure while preserving degenerate critical points. Second, a topological simplification process employing critical point cancellation reduces graph complexity while maintaining essential shape features and correspondences. Finally, a region growing algorithm leverages both Reeb graph adjacency and mesh vertex connectivity to generate contiguous, semantically meaningful segments. The presented method exhibits computational efficiency, achieving a complexity of \(O(n \log n\)) for a mesh containing n vertices. Its versatility and effectiveness are validated through application to both local geometry-based segmentation using the Shape Index and part-based decomposition utilizing the Shape Diameter Function. This flexible framework establishes a solid foundation for advanced analysis and applications across various domains, offering new possibilities for mesh processing and understanding.</description><subject>Algorithms</subject><subject>Animation</subject><subject>Apexes</subject><subject>Complexity</subject><subject>Computer graphics</subject><subject>Critical point</subject><subject>Graph theory</subject><subject>Segmentation</subject><subject>Texture mapping</subject><subject>Topology</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNit0KgjAYQEcQJOU7DLoWdPOnriOti27Ke5n2OZW5z7YJPX5FPUBXB845C-IxzqNgFzO2Ir61QxiGLM1YknCP1LmCZ18roBewHb2BHEE74XrU1HUGZ9nRs3YgzddhSwvAEZzpGyr0vcQJFcq-EYrmINxswH6mK0BNCyOmzm7IshXKgv_jmmzzY3k4BZPBxwzWVQPORr9TxaOYZZzF6Z7_d70AtWZF3w</recordid><startdate>20241205</startdate><enddate>20241205</enddate><creator>Beguet Florian</creator><creator>Lanquetin Sandrine</creator><creator>Raffin Romain</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20241205</creationdate><title>Flexible Mesh Segmentation through Integration of Geometric andTopological Features of Reeb Graphs</title><author>Beguet Florian ; Lanquetin Sandrine ; Raffin Romain</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_31427324693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Animation</topic><topic>Apexes</topic><topic>Complexity</topic><topic>Computer graphics</topic><topic>Critical point</topic><topic>Graph theory</topic><topic>Segmentation</topic><topic>Texture mapping</topic><topic>Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Beguet Florian</creatorcontrib><creatorcontrib>Lanquetin Sandrine</creatorcontrib><creatorcontrib>Raffin Romain</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beguet Florian</au><au>Lanquetin Sandrine</au><au>Raffin Romain</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Flexible Mesh Segmentation through Integration of Geometric andTopological Features of Reeb Graphs</atitle><jtitle>arXiv.org</jtitle><date>2024-12-05</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Mesh segmentation represents a crucial task in computer graphics and geometric analysis, with diverse applications spanning texture mapping, animation, and beyond. This paper introduces an innovative Reeb graph-based mesh segmentation method that seamlessly integrates geometric and topological features to achieve flexible and robust segmentation results. The proposed approach encompasses three primary phases. First, an enhanced topological skeleton construction efficiently captures the Reeb graph structure while preserving degenerate critical points. Second, a topological simplification process employing critical point cancellation reduces graph complexity while maintaining essential shape features and correspondences. Finally, a region growing algorithm leverages both Reeb graph adjacency and mesh vertex connectivity to generate contiguous, semantically meaningful segments. The presented method exhibits computational efficiency, achieving a complexity of \(O(n \log n\)) for a mesh containing n vertices. Its versatility and effectiveness are validated through application to both local geometry-based segmentation using the Shape Index and part-based decomposition utilizing the Shape Diameter Function. This flexible framework establishes a solid foundation for advanced analysis and applications across various domains, offering new possibilities for mesh processing and understanding.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-12 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_3142732469 |
source | Freely Accessible Journals |
subjects | Algorithms Animation Apexes Complexity Computer graphics Critical point Graph theory Segmentation Texture mapping Topology |
title | Flexible Mesh Segmentation through Integration of Geometric andTopological Features of Reeb Graphs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T18%3A05%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Flexible%20Mesh%20Segmentation%20through%20Integration%20of%20Geometric%20andTopological%20Features%20of%20Reeb%20Graphs&rft.jtitle=arXiv.org&rft.au=Beguet%20Florian&rft.date=2024-12-05&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3142732469%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3142732469&rft_id=info:pmid/&rfr_iscdi=true |