{"id":"https://openalex.org/W7162496450","doi":"https://doi.org/10.4230/lipics.socg.2026.15","title":"Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity","display_name":"Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162496450","doi":"https://doi.org/10.4230/lipics.socg.2026.15"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25821","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.15/LIPIcs.SoCG.2026.15.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.15/LIPIcs.SoCG.2026.15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136864384","display_name":"Sujoy Bhore","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bhore, Sujoy","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology Bombay, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0003-0104-1659","affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137122967","display_name":"S\u00e1ndor Kisfaludi\u2011Bak","orcid":"https://orcid.org/0000-0002-6856-2902"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Kisfaludi\u2011Bak, S\u00e1ndor","raw_affiliation_strings":["Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0002-6856-2902","affiliations":[{"raw_affiliation_string":"Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137102019","display_name":"Lazar Milenkovi\u0107","orcid":"https://orcid.org/0000-0001-5777-2229"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I58918642","display_name":"Sofia University \"St. Kliment Ohridski\"","ror":"https://ror.org/02jv3k292","country_code":"BG","type":"education","lineage":["https://openalex.org/I58918642"]}],"countries":["BG","IL"],"is_corresponding":false,"raw_author_name":"Milenkovi\u0107, Lazar","raw_affiliation_strings":["Tel Aviv University, Israel","INSAIT, Sofia University \"St. Kliment Ohridski\", Bulgaria"],"raw_orcid":"https://orcid.org/0000-0001-5777-2229","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"INSAIT, Sofia University \"St. Kliment Ohridski\", Bulgaria","institution_ids":["https://openalex.org/I58918642"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030799674","display_name":"Csaba D. T\u00f3th","orcid":"https://orcid.org/0000-0002-8769-3190"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]},{"id":"https://openalex.org/I157638225","display_name":"California State University, Northridge","ror":"https://ror.org/005f5hv41","country_code":"US","type":"education","lineage":["https://openalex.org/I157638225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T\u00f3th, Csaba D.","raw_affiliation_strings":["Department of Mathematics, California State University Northridge, Los Angeles, CA, USA","Department of Computer Science, Tufts University, Medford, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8769-3190","affiliations":[{"raw_affiliation_string":"Department of Mathematics, California State University Northridge, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I157638225"]},{"raw_affiliation_string":"Department of Computer Science, Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055238529","display_name":"Karol W\u0119grzycki","orcid":"https://orcid.org/0000-0001-9746-5733"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W\u0119grzycki, Karol","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9746-5733","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029179453","display_name":"Sampson Wong","orcid":"https://orcid.org/0000-0003-3803-3804"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Wong, Sampson","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-3803-3804","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":7,"institutions_distinct_count":8,"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.67941016,"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.9045000076293945,"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.9045000076293945,"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/T11870","display_name":"Structural Analysis and Optimization","score":0.022600000724196434,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.008700000122189522,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.691100001335144},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5788000226020813},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.499099999666214},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49889999628067017},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46959999203681946},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46389999985694885},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4535999894142151},{"id":"https://openalex.org/keywords/euclidean-distance-matrix","display_name":"Euclidean distance matrix","score":0.40959998965263367},{"id":"https://openalex.org/keywords/euclidean-domain","display_name":"Euclidean domain","score":0.40689998865127563}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.840499997138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7932000160217285},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.691100001335144},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5788000226020813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.499099999666214},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49889999628067017},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46959999203681946},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46389999985694885},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4535999894142151},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.414900004863739},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.40959998965263367},{"id":"https://openalex.org/C23719512","wikidata":"https://www.wikidata.org/wiki/Q867345","display_name":"Euclidean domain","level":4,"score":0.40689998865127563},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4018000066280365},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3382999897003174},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.28369998931884766},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.259799987077713},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.25609999895095825}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25821","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.15/LIPIcs.SoCG.2026.15.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":"pmh:oai:aaltodoc.aalto.fi:123456789/146133","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/dd6f71af-fa9d-4573-813c-06b273955532","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"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":"info:eu-repo/semantics/article"},{"id":"doi:10.4230/lipics.socg.2026.15","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.15","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"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":"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:25821","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.15/LIPIcs.SoCG.2026.15.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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162496450.pdf","grobid_xml":"https://content.openalex.org/works/W7162496450.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"Euclidean":[1,37,46,96],"noncrossing":[2,47,97],"Steiner":[3,48,98],"(1+\u03b5)-spanner":[4,49,99],"for":[5,18,53,93,103],"a":[6,13,27,40,45],"point":[7],"set":[8,55],"P":[9],"\u2282":[10],"\u211d\u00b2":[11],"is":[12,31],"planar":[14],"straight-line":[15],"graph":[16],"that,":[17],"any":[19,54,95,104],"two":[20],"points":[21,58,89],"a,":[22],"b":[23],"\u2208":[24],"P,":[25],"contains":[26],"path":[28],"whose":[29],"length":[30],"at":[32],"most":[33],"1+\u03b5":[34],"times":[35],"the":[36,60,66,91,115],"distance":[38],"between":[39],"and":[41],"b.":[42],"We":[43,78],"construct":[44],"with":[50],"O(n/\u03b5^{3/2})":[51],"edges":[52,102],"of":[56,71,114],"n":[57,88],"in":[59,90,121],"plane.":[61],"This":[62],"result":[63],"improves":[64],"upon":[65],"previous":[67],"best":[68],"upper":[69],"bound":[70,110],"O(n/\u03b5\u2074)":[72],"obtained":[73],"nearly":[74],"three":[75],"decades":[76],"ago.":[77],"also":[79],"establish":[80],"an":[81],"almost":[82],"matching":[83],"lower":[84,109],"bound:":[85],"There":[86],"exist":[87],"plane":[92],"which":[94],"has":[100],"\u03a9_\u03bc(n/\u03b5^{3/2-\u03bc})":[101],"\u03bc":[105],">":[106],"0.":[107],"Our":[108],"uses":[111],"recent":[112],"generalizations":[113],"Szemer\u00e9di-Trotter":[116],"theorem":[117],"to":[118],"disk-tube":[119],"incidences":[120],"geometric":[122],"measure":[123],"theory.":[124]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-05-28T00:00:00"}