• Login
    View Item 
    •   Eurographics DL Home
    • Eurographics Workshops and Symposia
    • EGPGV: Eurographics Workshop on Parallel Graphics and Visualization
    • EGPGV19: Eurographics Symposium on Parallel Graphics and Visualization
    • View Item
    •   Eurographics DL Home
    • Eurographics Workshops and Symposia
    • EGPGV: Eurographics Workshop on Parallel Graphics and Visualization
    • EGPGV19: Eurographics Symposium on Parallel Graphics and Visualization
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Task-based Augmented Reeb Graphs with Dynamic ST-Trees

    Thumbnail
    View/Open
    027-037.pdf (2.740Mb)
    1027-file1.md (4.863Kb)
    1027-file2.tar (78.40Mb)
    Date
    2019
    Author
    Gueunet, Charles ORCID
    Fortin, Pierre ORCID
    Jomier, Julien ORCID
    Tierny, Julien ORCID
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    This paper presents, to the best of our knowledge, the first parallel algorithm for the computation of the augmented Reeb graph of piecewise linear scalar data. Such augmented Reeb graphs have a wide range of applications, including contour seeding and feature based segmentation. Our approach targets shared-memory multi-core workstations. For this, it completely revisits the optimal, but sequential, Reeb graph algorithm, which is capable of handing data in arbitrary dimension and with optimal time complexity. We take advantage of Fibonacci heaps to exploit the ST-Tree data structure through independent local propagations, while maintaining the optimal, linearithmic time complexity of the sequential reference algorithm. These independent propagations can be expressed using OpenMP tasks, hence benefiting in parallel from the dynamic load balancing of the task runtime while enabling us to increase the parallelism degree thanks to a dual sweep. We present performance results on triangulated surfaces and tetrahedral meshes. We provide comparisons to related work and show that our new algorithm results in superior time performance in practice, both in sequential and in parallel. An open-source C++ implementation is provided for reproducibility.
    BibTeX
    @inproceedings {10.2312:pgv.20191107,
    booktitle = {Eurographics Symposium on Parallel Graphics and Visualization},
    editor = {Childs, Hank and Frey, Steffen},
    title = {{Task-based Augmented Reeb Graphs with Dynamic ST-Trees}},
    author = {Gueunet, Charles and Fortin, Pierre and Jomier, Julien and Tierny, Julien},
    year = {2019},
    publisher = {The Eurographics Association},
    ISSN = {1727-348X},
    ISBN = {978-3-03868-079-6},
    DOI = {10.2312/pgv.20191107}
    }
    URI
    https://doi.org/10.2312/pgv.20191107
    https://diglib.eg.org:443/handle/10.2312/pgv20191107
    Collections
    • EGPGV19: Eurographics Symposium on Parallel Graphics and Visualization

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA