{"id":"https://openalex.org/W2731194386","doi":"https://doi.org/10.2312/egsh.20171014","title":"Conformal Factor Persistence for Fast Hierarchical Cone Extraction","display_name":"Conformal Factor Persistence for Fast Hierarchical Cone Extraction","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2731194386","doi":"https://doi.org/10.2312/egsh.20171014","mag":"2731194386"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-01508966v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01508966","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 2017, Apr 2017, Lyon, France","raw_type":"Conference papers"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01508966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105953450","display_name":"Ana M Vintescu","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vintescu, Ana-Maria","raw_affiliation_strings":["T\u00e9l\u00e9com ParisTech","Performance et Qualit\u00e9 des Algorithmes Num\u00e9riques"],"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9com ParisTech","institution_ids":["https://openalex.org/I12356871"]},{"raw_affiliation_string":"Performance et Qualit\u00e9 des Algorithmes Num\u00e9riques","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030154822","display_name":"Florent Dupont","orcid":"https://orcid.org/0000-0001-6611-4420"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dupont, Florent","raw_affiliation_strings":["Geometry Processing and Constrained Optimization"],"affiliations":[{"raw_affiliation_string":"Geometry Processing and Constrained Optimization","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015332851","display_name":"Guillaume Lavou\u00e9","orcid":"https://orcid.org/0000-0003-3988-6702"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lavou\u00e9, Guillaume","raw_affiliation_strings":["Geometry Processing and Constrained Optimization"],"affiliations":[{"raw_affiliation_string":"Geometry Processing and Constrained Optimization","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057831763","display_name":"Pooran Memari","orcid":"https://orcid.org/0000-0002-8811-6889"},"institutions":[{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Memari, Pooran","raw_affiliation_strings":["Laboratoire d'informatique de l'\u00c9cole polytechnique [Palaiseau]"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique de l'\u00c9cole polytechnique [Palaiseau]","institution_ids":["https://openalex.org/I4210139461"]}]},{"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":["Performance et Qualit\u00e9 des Algorithmes Num\u00e9riques"],"affiliations":[{"raw_affiliation_string":"Performance et Qualit\u00e9 des Algorithmes Num\u00e9riques","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5105953450"],"corresponding_institution_ids":["https://openalex.org/I12356871"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9994999766349792,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9681000113487244,"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/maxima-and-minima","display_name":"Maxima and minima","score":0.7785553932189941},{"id":"https://openalex.org/keywords/conformal-map","display_name":"Conformal map","score":0.67484450340271},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.6475557684898376},{"id":"https://openalex.org/keywords/gravitational-singularity","display_name":"Gravitational singularity","score":0.6253693103790283},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6160460710525513},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5784688591957092},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.5631996393203735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5085686445236206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48358410596847534},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4175741374492645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39249667525291443},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32091379165649414},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.25676119327545166},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2111746072769165}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7785553932189941},{"id":"https://openalex.org/C98214594","wikidata":"https://www.wikidata.org/wiki/Q850275","display_name":"Conformal map","level":2,"score":0.67484450340271},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.6475557684898376},{"id":"https://openalex.org/C12843","wikidata":"https://www.wikidata.org/wiki/Q201721","display_name":"Gravitational singularity","level":2,"score":0.6253693103790283},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6160460710525513},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5784688591957092},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.5631996393203735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5085686445236206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48358410596847534},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4175741374492645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39249667525291443},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32091379165649414},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.25676119327545166},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2111746072769165},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C194257627","wikidata":"https://www.wikidata.org/wiki/Q211554","display_name":"Amplifier","level":3,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-01508966v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01508966","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 2017, Apr 2017, Lyon, France","raw_type":"Conference papers"},{"id":"doi:10.2312/egsh.20171014","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egsh.20171014","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"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01508966v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01508966","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 2017, Apr 2017, Lyon, France","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W3188646203","https://openalex.org/W2909957174","https://openalex.org/W136674370","https://openalex.org/W4246278799","https://openalex.org/W2105527480","https://openalex.org/W2052387497","https://openalex.org/W2037368097","https://openalex.org/W4287265602"],"abstract_inverted_index":{"This":[0,73],"paper":[1],"presents":[2],"a":[3,102,122,162],"new":[4],"algorithm":[5,106],"for":[6,15,189],"the":[7,27,36,68,80,87,109,113,117,126,167],"fast":[8],"extraction":[9],"of":[10,12,29,90,116,125,170,178,181],"hierarchies":[11,99],"cone":[13,98,127],"singularities":[14,20,128],"conformal":[16,118],"surface":[17],"parameterization.":[18],"Cone":[19],"have":[21],"been":[22],"shown":[23],"to":[24,96,100,154],"greatly":[25],"improve":[26],"distortion":[28,50],"such":[30,55,158],"parameterizations":[31],"since":[32],"they":[33],"locally":[34],"absorb":[35],"area":[37,49],"distortion.":[38],"Therefore,":[39],"existing":[40],"automatic":[41],"approaches":[42,56,141],"aim":[43],"at":[44],"inserting":[45],"cones":[46,92],"where":[47,139],"large":[48],"can":[51],"be":[52],"predicted.":[53],"However,":[54],"are":[57],"iterative,":[58],"which":[59,183],"results":[60],"in":[61,85],"slow":[62],"computations,":[63],"even":[64,75],"often":[65,79],"slower":[66],"than":[67],"actual":[69],"subsequent":[70],"parameterization":[71],"procedure.":[72],"becomes":[74],"more":[76],"problematic":[77],"as":[78],"user":[81],"does":[82],"not":[83],"know":[84],"advance":[86],"right":[88],"number":[89],"needed":[91,142],"and":[93,174],"thus":[94],"needs":[95],"explore":[97],"obtain":[101],"satisfying":[103],"result.":[104],"Our":[105],"relies":[107],"on":[108],"key":[110],"observation":[111],"that":[112],"local":[114,159],"extrema":[115,160],"factor":[119],"already":[120],"provide":[121],"good":[123],"approximation":[124,168],"extracted":[129],"with":[130],"previous":[131,140],"techniques,":[132],"while":[133],"needing":[134],"only":[135],"one":[136,143,179],"linear":[137],"solving":[138,144],"per":[145],"hierarchy":[146],"level.":[147],"We":[148],"apply":[149],"concepts":[150],"from":[151],"persistent":[152],"homology":[153],"organize":[155],"very":[156],"efficiently":[157],"into":[161],"global":[163],"hierarchy.":[164],"Experiments":[165],"demonstrate":[166],"quality":[169],"our":[171,185],"approach":[172],"quantitatively":[173],"report":[175],"time-performance":[176],"improvements":[177],"order":[180],"magnitude,":[182],"makes":[184],"technique":[186],"well":[187],"suited":[188],"interactive":[190],"contexts.":[191]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}