{"id":"https://openalex.org/W7162523217","doi":"https://doi.org/10.4230/lipics.socg.2026.40","title":"Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface","display_name":"Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162523217","doi":"https://doi.org/10.4230/lipics.socg.2026.40"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25846","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.40/LIPIcs.SoCG.2026.40.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.40/LIPIcs.SoCG.2026.40.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122329792","display_name":"Lo\u00efc Dubois","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dubois, Lo\u00efc","raw_affiliation_strings":["Notre Dame, IN, USA"],"raw_orcid":"https://orcid.org/0000-0002-0366-4959","affiliations":[{"raw_affiliation_string":"Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5122329792"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62643392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.0019000000320374966,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.0010999999940395355,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.8140000104904175},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.6664000153541565},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.6182000041007996},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.5769000053405762},{"id":"https://openalex.org/keywords/chews-second-algorithm","display_name":"Chew's second algorithm","score":0.5498999953269958},{"id":"https://openalex.org/keywords/surface-triangulation","display_name":"Surface triangulation","score":0.5450000166893005},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.5304999947547913},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.5063999891281128},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.4932999908924103},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.4927000105381012}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.8140000104904175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7203999757766724},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.6664000153541565},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.6182000041007996},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5824999809265137},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.5769000053405762},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.5498999953269958},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.5450000166893005},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.5304999947547913},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.5063999891281128},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.4932999908924103},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.4927000105381012},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.43860000371932983},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4154999852180481},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.40959998965263367},{"id":"https://openalex.org/C194401833","wikidata":"https://www.wikidata.org/wiki/Q3456889","display_name":"Triangle mesh","level":3,"score":0.40619999170303345},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.3481000065803528},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3305000066757202},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.31189998984336853},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.29269999265670776},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2797999978065491},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.2587999999523163},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.257999986410141},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C170589453","wikidata":"https://www.wikidata.org/wiki/Q7940896","display_name":"Volume mesh","level":4,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25846","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.40/LIPIcs.SoCG.2026.40.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.40","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25846","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.40/LIPIcs.SoCG.2026.40.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162523217.pdf","grobid_xml":"https://content.openalex.org/works/W7162523217.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Every":[0],"surface":[1,53,99],"that":[2,84,165],"is":[3,32,65,130,140,171],"intrinsically":[4],"polyhedral":[5,98],"can":[6,175],"be":[7,176],"represented":[8,101],"by":[9,102],"a":[10,12,42,48,96,103,180],"portalgon:":[11],"collection":[13],"of":[14,23,116,123,137,145,151,156,161,196],"polygons":[15,38],"in":[16,39,51,142,148,168],"the":[17,52,56,72,85,113,121,143,149,152,166,194],"Euclidean":[18],"plane":[19],"with":[20],"some":[21],"pairs":[22],"equally":[24],"long":[25],"edges":[26],"abstractly":[27],"identified.":[28],"While":[29],"this":[30,93],"representation":[31],"arguably":[33],"simpler":[34],"than":[35],"meshes":[36],"(flat":[37],"\u211d\u00b3":[40],"forming":[41],"surface),":[43],"it":[44],"has":[45],"unbounded":[46],"happiness:":[47],"shortest":[49,185],"path":[50],"may":[54],"visit":[55],"same":[57],"polygon":[58],"arbitrarily":[59],"many":[60],"times.":[61],"This":[62],"pathological":[63],"behavior":[64],"an":[66,109],"obstacle":[67],"towards":[68],"efficient":[69],"algorithms.":[70],"On":[71],"other":[73],"hand,":[74],"L\u00f6ffler,":[75],"Ophelders,":[76],"Staals,":[77],"and":[78,147,190],"Silveira":[79],"[SoCG":[80],"2023]":[81],"recently":[82],"proved":[83],"(intrinsic)":[86],"Delaunay":[87,114],"triangulations":[88],"have":[89],"bounded":[90],"happiness.":[91],"In":[92],"paper,":[94],"given":[95],"closed":[97],"S,":[100],"triangular":[104,181,198],"portalgon":[105,182],"T,":[106],"we":[107,163],"provide":[108],"algorithm":[110,139,174],"to":[111,178,191],"compute":[112],"triangulation":[115],"S":[117,124],"whose":[118,127],"vertices":[119],"are":[120,200],"singularities":[122],"(the":[125],"points":[126],"surrounding":[128],"angle":[129],"distinct":[131],"from":[132],"2\u03c0).":[133],"The":[134],"time":[135],"complexity":[136],"our":[138,159],"polynomial":[141],"number":[144],"triangles":[146],"logarithm":[150],"aspect":[153],"ratio":[154],"r":[155,170],"T.":[157],"Within":[158],"model":[160],"computation,":[162],"show":[164],"dependency":[167],"log":[169],"unavoidable.":[172],"Our":[173],"used":[177],"pre-process":[179],"before":[183],"computing":[184],"paths":[186],"on":[187],"its":[188],"surface,":[189],"determine":[192],"whether":[193],"surfaces":[195],"two":[197],"portalgons":[199],"isometric.":[201]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}