{"id":"https://openalex.org/W1976676339","doi":"https://doi.org/10.1137/0215033","title":"Efficient Algorithms for Geometric Graph Search Problems","display_name":"Efficient Algorithms for Geometric Graph Search Problems","publication_year":1986,"publication_date":"1986-05-01","ids":{"openalex":"https://openalex.org/W1976676339","doi":"https://doi.org/10.1137/0215033","mag":"1976676339"},"language":"en","primary_location":{"id":"doi:10.1137/0215033","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215033","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071671067","display_name":"Hiroshi Imai","orcid":"https://orcid.org/0000-0002-0880-0091"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hiroshi Imai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102080075","display_name":"Takao Asano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takao Asano","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071671067"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1186,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.85733696,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"2","first_page":"478","last_page":"494"},"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.9998999834060669,"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.9998999834060669,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9923999905586243,"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/combinatorics","display_name":"Combinatorics","score":0.6013391017913818},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.546293318271637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4987325668334961},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49218907952308655},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48168715834617615},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4628308117389679},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4480559825897217},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44708895683288574},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4457305073738098},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42487475275993347},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.415945440530777},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38079020380973816},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11959326267242432}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6013391017913818},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.546293318271637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4987325668334961},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49218907952308655},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48168715834617615},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4628308117389679},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4480559825897217},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44708895683288574},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4457305073738098},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42487475275993347},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.415945440530777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38079020380973816},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11959326267242432},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215033","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215033","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1513353427","https://openalex.org/W1655990431","https://openalex.org/W1874694348","https://openalex.org/W1985480430","https://openalex.org/W2008292658","https://openalex.org/W2027399883","https://openalex.org/W2035435951","https://openalex.org/W2077950479","https://openalex.org/W2086551550","https://openalex.org/W2118382442","https://openalex.org/W2142753649","https://openalex.org/W2157529519"],"related_works":["https://openalex.org/W1976803949","https://openalex.org/W4230281099","https://openalex.org/W2985498454","https://openalex.org/W2607764376","https://openalex.org/W2288580478","https://openalex.org/W1527745059","https://openalex.org/W2354057059","https://openalex.org/W4233982495","https://openalex.org/W2023670982","https://openalex.org/W2185219893"],"abstract_inverted_index":{"In":[0],"this":[1,89],"paper,":[2],"we":[3,44,107],"show":[4],"that":[5],"many":[6],"graph":[7,19,51,73,94],"search":[8,35,39,74,79,125,129],"problems":[9,75,207],"can":[10,58,130,144,163,186,201],"be":[11,59,131,145,164,187,202],"solved":[12],"quite":[13],"efficiently":[14],"for":[15,32,48,91],"a":[16,41,159,214,218,238,242],"geometric":[17],"intersection":[18,50,93],"of":[20,54,95,104,212,217,226,233,251],"horizontal":[21,97,177],"and":[22,36,80,98,126,137,151,158,171,196,230],"vertical":[23,99],"line":[24],"segments.":[25],"We":[26],"first":[27,34,38,78,82,124,128],"extract":[28],"several":[29],"basic":[30],"operations":[31,57],"depth":[33,77],"breadth":[37,81,127],"on":[40,241],"graph.":[42],"Then":[43],"present":[45],"data":[46,66],"structures":[47,67],"the":[49,85,111,210,224,231,248],"in":[52,61,88,133,147,166,189,223,247],"terms":[53],"which":[55,221,245],"those":[56],"implemented":[60],"an":[62,92],"efficient":[63],"manner.":[64],"The":[65,141,182],"enable":[68],"us":[69],"to":[70,204],"solve":[71],"various":[72,205],"besides":[76],"search.":[83],"Specifying":[84],"results":[86],"obtained":[87],"paper":[90],"n":[96,168],"segments":[100,179],"with":[101,110],"m":[102],"pairs":[103],"intersecting":[105],"segments,":[106],"obtain":[108],"algorithms":[109,200],"following":[112],"complexity,":[113],"where":[114],"$N":[115],"=":[116],"\\min":[117],"\\{":[118],"m,n\\log":[119],"n\\}":[120],"$.":[121],"(i)":[122],"Depth":[123],"executed":[132],"$O(n\\log":[134,148],"n)$":[135,149],"time":[136,150,170,195],"$O(N)$":[138,152,172,197],"space.":[139,153,198],"(ii)":[140],"biconnected":[142],"components":[143],"found":[146,165,188],"(iii)":[154],"A":[155],"maximum":[156,160],"matching":[157],"independent":[161],"set":[162],"$O(\\sqrt":[167],"N)$":[169,194],"space":[173],"when":[174],"no":[175],"two":[176],"(vertical)":[178],"intersect.":[180],"(iv)":[181],"connectivity":[183],"$k_G":[184],"$":[185],"$O(k_G":[190],"n^{{3":[191],"/":[192],"2}}":[193],"Our":[199],"applied":[203],"practical":[206],"such":[208],"as":[209],"problem":[211,232],"finding":[213],"minimum":[215],"dissection":[216],"rectilinear":[219],"region,":[220],"arises":[222,246],"manipulation":[225],"VLSI":[227],"artwork":[228],"data,":[229],"determining":[234],"whether":[235],"there":[236],"is":[237],"Manhattan":[239],"wiring":[240],"single":[243],"layer,":[244],"design":[249],"automation":[250],"digital":[252],"systems.":[253]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-28T08:17:26.163206","created_date":"2025-10-10T00:00:00"}