{"id":"https://openalex.org/W7125515250","doi":"https://doi.org/10.4230/lipics.itcs.2026.53","title":"Average Sensitivity of Geometric Algorithms","display_name":"Average Sensitivity of Geometric Algorithms","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7125515250","doi":"https://doi.org/10.4230/lipics.itcs.2026.53"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25340","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.53","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.53/LIPIcs.ITCS.2026.53.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-vol362-itcs2026/LIPIcs.ITCS.2026.53/LIPIcs.ITCS.2026.53.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039508009","display_name":"Matthijs Ebbens","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ebbens, Matthijs","raw_affiliation_strings":["University of Cologne, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4704-3484","affiliations":[{"raw_affiliation_string":"University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123655445","display_name":"Yuichi Yoshida","orcid":null},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshida, Yuichi","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0001-8919-8479","affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08977556,"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.9485999941825867,"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.9485999941825867,"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.014100000262260437,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.004699999932199717,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.8015000224113464},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.671500027179718},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.6628999710083008},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.6086999773979187},{"id":"https://openalex.org/keywords/power-diagram","display_name":"Power diagram","score":0.5590000152587891},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.5267000198364258},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5098000168800354},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.48989999294281006},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4629000127315521},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4609000086784363}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8015000224113464},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.671500027179718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6657999753952026},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.6628999710083008},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.6086999773979187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6080999970436096},{"id":"https://openalex.org/C20573064","wikidata":"https://www.wikidata.org/wiki/Q13410436","display_name":"Power diagram","level":3,"score":0.5590000152587891},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.5267000198364258},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5098000168800354},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.48989999294281006},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.382099986076355},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C136520226","wikidata":"https://www.wikidata.org/wiki/Q302814","display_name":"Geometric data analysis","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.3109000027179718},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29899999499320984},{"id":"https://openalex.org/C153008295","wikidata":"https://www.wikidata.org/wiki/Q6535093","display_name":"Level set (data structures)","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.28859999775886536},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.265500009059906},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C110202963","wikidata":"https://www.wikidata.org/wiki/Q1783542","display_name":"Convex geometry","level":5,"score":0.25769999623298645},{"id":"https://openalex.org/C104065381","wikidata":"https://www.wikidata.org/wiki/Q1002535","display_name":"Geometric modeling","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25340","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.53","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.53/LIPIcs.ITCS.2026.53.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.itcs.2026.53","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.53","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:25340","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.53","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.53/LIPIcs.ITCS.2026.53.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":[{"id":"https://metadata.un.org/sdg/11","score":0.6143328547477722,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G6671305791","display_name":"Desensitization of Algorithms for Decision Making and Knowledge Discovery","funder_award_id":"24K02903","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G6911520579","display_name":"FOR 5361: KIFOR Algorithmische Datenanalyse f\u00fcr die Geod\u00e4sie (AlgoForGe)","funder_award_id":"459420781","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7125515250.pdf","grobid_xml":"https://content.openalex.org/works/W7125515250.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"modern":[1],"applications":[2],"of":[3,21,41,57,100,122,133,159,173,187],"geometric":[4],"algorithms,":[5],"it":[6],"is":[7,28,45,76,86,168],"often":[8,29],"unrealistic":[9],"to":[10],"assume":[11],"that":[12,97,150],"the":[13,22,25,39,48,54,58,66,74,81,89,108,120,130,163,169,185],"input":[14,26,64,68],"representation":[15],"fully":[16],"captures":[17],"all":[18],"relevant":[19],"aspects":[20],"problem,":[23],"because":[24],"data":[27],"large":[30],"and":[31,65,80,113,192],"dynamic.":[32],"To":[33],"address":[34],"this":[35,174],"challenge,":[36],"we":[37,140],"consider":[38],"notion":[40],"average":[42,49,75,123,131,148],"sensitivity,":[43],"which":[44,176],"defined":[46],"as":[47],"earth":[50],"mover\u2019s":[51],"distance":[52,82],"between":[53,83],"output":[55],"distributions":[56],"algorithm":[59,135,145],"when":[60],"run":[61],"on":[62],"an":[63,144],"same":[67],"with":[69,146,182],"one":[70],"point":[71],"removed,":[72],"where":[73],"over":[77],"removed":[78],"points":[79],"two":[84],"outputs":[85],"measured":[87],"using":[88],"symmetric":[90],"difference":[91],"size.":[92],"We":[93],"start":[94],"by":[95,125,142],"showing":[96],"a":[98,157],"number":[99],"classical":[101],"problems":[102],"from":[103,119,179,184],"computational":[104,180],"geometry,":[105],"in":[106],"particular":[107],"convex":[109],"hull,":[110],"Delaunay":[111],"triangulation,":[112],"Voronoi":[114],"diagram":[115],"problems,":[116],"are":[117],"\"simple\"":[118],"viewpoint":[121],"sensitivity":[124,132,149],"proving":[126],"tight":[127],"bounds":[128],"for":[129,136,152,162],"any":[134,153],"these":[137],"problems.":[138],"Then,":[139],"continue":[141],"constructing":[143],"low":[147],"computes,":[151],"\u03b5":[154],">":[155],"0,":[156],"set":[158],"(1/3+\u03b5)n":[160],"guards":[161],"art":[164],"gallery":[165],"problem.":[166],"This":[167],"main":[170],"technical":[171],"contribution":[172],"work,":[175],"combines":[177],"algorithms":[178,190],"geometry":[181],"results":[183],"theory":[186],"local":[188],"computation":[189],"(LCAs)":[191],"property":[193],"testing.":[194]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-01-24T00:00:00"}