{"id":"https://openalex.org/W2964758622","doi":"https://doi.org/10.2312/pgv.20191107","title":"Task-based Augmented Reeb Graphs with Dynamic ST-Trees","display_name":"Task-based Augmented Reeb Graphs with Dynamic ST-Trees","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2964758622","doi":"https://doi.org/10.2312/pgv.20191107","mag":"2964758622"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-02159825v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02159825","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Eurographics Symposium on Parallel Graphics and Visualization, Jun 2019, Porto, Portugal. ⟨10.2312/pgv.20191107⟩","raw_type":"Conference papers"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-02159825","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063064518","display_name":"Charles Gueunet","orcid":"https://orcid.org/0000-0001-6288-4540"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gueunet, Charles","raw_affiliation_strings":["APR - Algorithmes, Programmes et R\u00e9solution (France)","Kitware SAS ( 6 Cours Andr\u00e9 Philip 69100 Villeurbanne - France)"],"affiliations":[{"raw_affiliation_string":"APR - Algorithmes, Programmes et R\u00e9solution (France)","institution_ids":[]},{"raw_affiliation_string":"Kitware SAS ( 6 Cours Andr\u00e9 Philip 69100 Villeurbanne - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060046643","display_name":"Pierre Fortin","orcid":"https://orcid.org/0000-0003-3117-9122"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fortin, Pierre","raw_affiliation_strings":["PEQUAN - Performance et Qualit\u00e9 des Algorithmes Num\u00e9riques (France)"],"affiliations":[{"raw_affiliation_string":"PEQUAN - Performance et Qualit\u00e9 des Algorithmes Num\u00e9riques (France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024770277","display_name":"Julien Jomier","orcid":"https://orcid.org/0000-0002-9020-3770"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jomier, Julien","raw_affiliation_strings":["Kitware SAS ( 6 Cours Andr\u00e9 Philip 69100 Villeurbanne - France)"],"affiliations":[{"raw_affiliation_string":"Kitware SAS ( 6 Cours Andr\u00e9 Philip 69100 Villeurbanne - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074734666","display_name":"Julien Tierny","orcid":"https://orcid.org/0000-0003-0056-2831"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tierny, Julien","raw_affiliation_strings":["APR - Algorithmes, Programmes et R\u00e9solution (France)"],"affiliations":[{"raw_affiliation_string":"APR - Algorithmes, Programmes et R\u00e9solution (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5063064518"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.13434119,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88365532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.72793048620224},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.5389164090156555},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.50323885679245},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44981956481933594},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.42292100191116333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4183371663093567},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4077829122543335},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.387453556060791},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37187302112579346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18650436401367188},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.09354391694068909}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.72793048620224},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.5389164090156555},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.50323885679245},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44981956481933594},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.42292100191116333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4183371663093567},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4077829122543335},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.387453556060791},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37187302112579346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18650436401367188},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.09354391694068909},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-02159825v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02159825","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Eurographics Symposium on Parallel Graphics and Visualization, Jun 2019, Porto, Portugal. ⟨10.2312/pgv.20191107⟩","raw_type":"Conference papers"},{"id":"doi:10.2312/pgv.20191107","is_oa":true,"landing_page_url":"https://doi.org/10.2312/pgv.20191107","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02159825v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02159825","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Eurographics Symposium on Parallel Graphics and Visualization, Jun 2019, Porto, Portugal. ⟨10.2312/pgv.20191107⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1557607869","https://openalex.org/W2366350639","https://openalex.org/W2087496541","https://openalex.org/W2028455732","https://openalex.org/W4313703117","https://openalex.org/W2085564391","https://openalex.org/W1984758362","https://openalex.org/W2042049060","https://openalex.org/W2992936613","https://openalex.org/W2108615321"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents,":[2],"to":[3,81,128,134,151],"the":[4,9,14,17,54,83,93,99,117,122,130],"best":[5],"of":[6,16,21,34,64,78,98,121],"our":[7,157],"knowledge,":[8],"first":[10],"parallel":[11,115],"algorithm":[12,159],"for":[13,179],"computation":[15],"augmented":[18,27],"Reeb":[19,28,58],"graph":[20,59],"piecewise":[22],"linear":[23],"scalar":[24],"data.":[25],"Such":[26],"graphs":[29],"have":[30],"a":[31,135],"wide":[32],"range":[33],"applications,":[35],"including":[36],"contour":[37],"seeding":[38],"and":[39,70,145,154,170],"feature":[40],"based":[41],"segmentation.":[42],"Our":[43],"approach":[44],"targets":[45],"shared-memory":[46],"multi-core":[47],"workstations.":[48],"For":[49],"this,":[50],"it":[51],"completely":[52],"revisits":[53],"optimal,":[55,94],"but":[56],"sequential,":[57],"algorithm,":[60],"which":[61],"is":[62,177],"capable":[63],"handing":[65],"data":[66,85],"in":[67,114,161,165,168,171],"arbitrary":[68],"dimension":[69],"with":[71],"optimal":[72],"time":[73,96,163],"complexity.":[74],"We":[75,138,148],"take":[76],"advantage":[77],"Fibonacci":[79],"heaps":[80],"exploit":[82],"ST-Tree":[84],"structure":[86],"through":[87],"independent":[88,104],"local":[89],"propagations,":[90],"while":[91,125],"maintaining":[92],"linearithmic":[95],"complexity":[97],"sequential":[100,169],"reference":[101],"algorithm.":[102],"These":[103],"propagations":[105],"can":[106],"be":[107],"expressed":[108],"using":[109],"OpenMP":[110],"tasks,":[111],"hence":[112],"benefiting":[113],"from":[116],"dynamic":[118],"load":[119],"balancing":[120],"task":[123],"runtime":[124],"enabling":[126],"us":[127],"increase":[129],"parallelism":[131],"degree":[132],"thanks":[133],"dual":[136],"sweep.":[137],"present":[139],"performance":[140,164],"results":[141,160],"on":[142],"triangulated":[143],"surfaces":[144],"tetrahedral":[146],"meshes.":[147],"provide":[149],"comparisons":[150],"related":[152],"work":[153],"show":[155],"that":[156],"new":[158],"superior":[162],"practice,":[166],"both":[167],"parallel.":[172],"An":[173],"open-source":[174],"C++":[175],"implementation":[176],"provided":[178],"reproducibility.":[180]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}