{"id":"https://openalex.org/W2762701907","doi":"https://doi.org/10.1137/090759112","title":"Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings","display_name":"Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2762701907","doi":"https://doi.org/10.1137/090759112","mag":"2762701907"},"language":"en","primary_location":{"id":"doi:10.1137/090759112","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090759112","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0812.0893","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108527295","display_name":"David Eppstein","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Eppstein","raw_affiliation_strings":["eppstein@ics.uci.edu and goodrich@ics.uci.edu and dstrash@ics.uci.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"eppstein@ics.uci.edu and goodrich@ics.uci.edu and dstrash@ics.uci.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["Dept. of Computer Science University of California, Irvine"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science University of California, Irvine","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066225806","display_name":"Darren Strash","orcid":"https://orcid.org/0000-0001-7095-8749"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darren Strash","raw_affiliation_strings":["Dept. of Computer Science University of California, Irvine"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science University of California, Irvine","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108527295"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7408,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83212378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"39","issue":"8","first_page":"3814","last_page":"3829"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9957000017166138,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9926000237464905,"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/time-complexity","display_name":"Time complexity","score":0.4912554621696472},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48894134163856506},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.48456206917762756},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4706639051437378},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4326171576976776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4277421832084656},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42164182662963867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37971168756484985},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14752760529518127}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4912554621696472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48894134163856506},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.48456206917762756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4706639051437378},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4326171576976776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4277421832084656},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42164182662963867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37971168756484985},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14752760529518127}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/090759112","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090759112","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0812.0893","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0812.0893","pdf_url":"https://arxiv.org/pdf/0812.0893","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0812.0893","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0812.0893","pdf_url":"https://arxiv.org/pdf/0812.0893","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W594463866","https://openalex.org/W1493214567","https://openalex.org/W1552092932","https://openalex.org/W1552413686","https://openalex.org/W1575510715","https://openalex.org/W1595295153","https://openalex.org/W1760870166","https://openalex.org/W1874694348","https://openalex.org/W1964869106","https://openalex.org/W1967005434","https://openalex.org/W1968215127","https://openalex.org/W1968647828","https://openalex.org/W1990317614","https://openalex.org/W1997631839","https://openalex.org/W1999545213","https://openalex.org/W2000879295","https://openalex.org/W2008034501","https://openalex.org/W2014889099","https://openalex.org/W2015696135","https://openalex.org/W2019814699","https://openalex.org/W2029814178","https://openalex.org/W2032841680","https://openalex.org/W2038176627","https://openalex.org/W2038643780","https://openalex.org/W2049413646","https://openalex.org/W2058432138","https://openalex.org/W2060113403","https://openalex.org/W2062277720","https://openalex.org/W2064969820","https://openalex.org/W2068019092","https://openalex.org/W2071717275","https://openalex.org/W2072977082","https://openalex.org/W2077383738","https://openalex.org/W2077585014","https://openalex.org/W2083669067","https://openalex.org/W2084224084","https://openalex.org/W2085761844","https://openalex.org/W2095352457","https://openalex.org/W2100586428","https://openalex.org/W2106114602","https://openalex.org/W2106413026","https://openalex.org/W2118169763","https://openalex.org/W2128865241","https://openalex.org/W2138304862","https://openalex.org/W2144713886","https://openalex.org/W2150861432","https://openalex.org/W2166542580","https://openalex.org/W2170017394","https://openalex.org/W2465715994","https://openalex.org/W2762051376","https://openalex.org/W2762935521","https://openalex.org/W3145128584","https://openalex.org/W4248634500","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337","https://openalex.org/W4226126352","https://openalex.org/W1519201794","https://openalex.org/W2767824041"],"abstract_inverted_index":{"We":[0],"provide":[1,15],"linear-time":[2],"algorithms":[3,16,56,94],"for":[4,110,135,150],"geometric":[5,23,116],"graphs":[6,24,117],"with":[7,108,118],"sublinearly":[8,119],"many":[9,120],"edge":[10,80,105],"crossings.":[11,121],"That":[12],"is,":[13],"we":[14,46,69,84],"running":[17],"in":[18,59,62,147,157],"$O(n)$":[19],"time":[20,61],"on":[21,89,97,104],"connected":[22],"having":[25,141],"n":[26,37,142,158],"vertices":[27],"and":[28,51,144],"k":[29,33,145,154],"pairwise":[30],"crossings,":[31,106],"where":[32],"is":[34,155],"smaller":[35],"than":[36],"by":[38,159],"an":[39,128,160],"iterated":[40,161],"logarithmic":[41,162],"factor.":[42,163],"Specific":[43],"problems":[44],"that":[45,101],"study":[47],"include":[48],"Voronoi":[49],"diagrams":[50],"single-source":[52],"shortest":[53],"paths.":[54],"Our":[55],"all":[57],"run":[58],"linear":[60,148],"the":[63,74,151],"standard":[64],"comparison-based":[65],"computational":[66,130],"model;":[67],"hence,":[68],"make":[70],"no":[71],"assumptions":[72],"about":[73],"distribution":[75],"or":[76],"bit":[77],"complexities":[78],"of":[79,133],"weights,":[81],"nor":[82],"do":[83],"utilize":[85],"unusual":[86],"bit-level":[87],"operations":[88],"memory":[90],"words.":[91],"Instead,":[92],"our":[93,123],"are":[95],"based":[96],"a":[98,137],"planarization":[99,124],"method":[100],"\u201czeros":[102],"in\u201d":[103],"together":[107],"methods":[109],"applying":[111],"planar":[112],"separator":[113],"decompositions":[114],"to":[115],"Incidentally,":[122],"algorithm":[125],"also":[126],"solves":[127],"open":[129],"geometry":[131],"problem":[132],"Chazelle":[134],"triangulating":[136],"self-intersecting":[138],"polygonal":[139],"chain":[140],"segments":[143],"crossings":[146],"time,":[149],"case":[152],"when":[153],"sublinear":[156]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}