{"id":"https://openalex.org/W2104511843","doi":"https://doi.org/10.1142/s0218195901000523","title":"RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS","display_name":"RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS","publication_year":2001,"publication_date":"2001-06-01","ids":{"openalex":"https://openalex.org/W2104511843","doi":"https://doi.org/10.1142/s0218195901000523","mag":"2104511843"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195901000523","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195901000523","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5025746286","display_name":"Andreas Crauser","orcid":null},"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":"A. CRAUSER","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046786328","display_name":"Paolo Ferragina","orcid":"https://orcid.org/0000-0003-1353-360X"},"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":"P. FERRAGINA","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028129209","display_name":"Kurt Mehlhorn","orcid":null},"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":"K. MEHLHORN","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103183708","display_name":"Ulrich Meyer","orcid":"https://orcid.org/0000-0002-1197-3153"},"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":"U. MEYER","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056075734","display_name":"Edgar A. Ramos","orcid":"https://orcid.org/0000-0001-6852-7472"},"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":"E. A. RAMOS","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8263,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87294813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"03","first_page":"305","last_page":"337"},"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.9958999752998352,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6785048246383667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.66701340675354},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.665336012840271},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6101243495941162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.54152512550354},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.49916601181030273},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.4883212745189667},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4822829067707062},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.4439358711242676},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4318050742149353},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4309979975223541},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4307173788547516},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.42736777663230896},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.42111191153526306},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4124400317668915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3943854570388794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2759772837162018},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.1870708465576172},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1276511549949646}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6785048246383667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.66701340675354},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.665336012840271},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6101243495941162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.54152512550354},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.49916601181030273},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4883212745189667},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4822829067707062},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.4439358711242676},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4318050742149353},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4309979975223541},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4307173788547516},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.42736777663230896},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.42111191153526306},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4124400317668915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3943854570388794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2759772837162018},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.1870708465576172},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1276511549949646},{"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/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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":2,"locations":[{"id":"doi:10.1142/s0218195901000523","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195901000523","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:arpi.unipi.it:11568/187321","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0218195901000523","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1595208863","https://openalex.org/W1983851263","https://openalex.org/W2005411543","https://openalex.org/W2015326607","https://openalex.org/W2015696135","https://openalex.org/W2018687717","https://openalex.org/W2038142281","https://openalex.org/W2050459520","https://openalex.org/W2054459484","https://openalex.org/W2060124163","https://openalex.org/W2071676345","https://openalex.org/W2085363460","https://openalex.org/W2087721273","https://openalex.org/W2147017508","https://openalex.org/W2150861432","https://openalex.org/W2156153879","https://openalex.org/W4238964467","https://openalex.org/W4254041727","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W2371953206","https://openalex.org/W180294324","https://openalex.org/W2140901212","https://openalex.org/W2029469528","https://openalex.org/W4256014305","https://openalex.org/W1575958304","https://openalex.org/W2140952994","https://openalex.org/W2160807740","https://openalex.org/W2034331916","https://openalex.org/W2104511843"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,60],"the":[3,28,38,42,54,71,74,81,84,130],"well-known":[4],"random":[5],"incremental":[6],"construction":[7],"of":[8,40,49,73,83,123],"Clarkson":[9],"and":[10,78,103,111,126],"Shor":[11],"18":[12],"can":[13],"be":[14],"adapted":[15],"to":[16,92,137],"provide":[17],"efficient":[18],"external-memory":[19,139],"algorithms":[20,94,117],"for":[21,37,95],"some":[22],"geometric":[23,97],"problems.":[24],"In":[25],"particular,":[26],"as":[27],"main":[29],"result,":[30],"we":[31],"obtain":[32],"an":[33,119,138],"optimal":[34,120],"randomized":[35],"algorithm":[36],"problem":[39],"computing":[41],"trapezoidal":[43],"decomposition":[44],"determined":[45],"by":[46],"a":[47],"set":[48],"N":[50],"line":[51],"segments":[52],"in":[53],"plane":[55],"with":[56,141],"K":[57],"pairwise":[58],"intersections,":[59,101],"requires":[61],"[Formula:":[62],"see":[63],"text]":[64],"expected":[65,121],"disk":[66,124],"accesses,":[67],"where":[68],"M":[69],"is":[70,80,89],"size":[72,82],"available":[75],"internal":[76],"memory":[77],"B":[79],"block":[85],"transfer.":[86],"The":[87,134],"approach":[88],"sufficiently":[90],"general":[91],"derive":[93],"other":[96],"problems:":[98],"3-d":[99,104],"half-space":[100],"2-d":[102,107],"convex":[105],"hulls,":[106],"abstract":[108],"Voronoi":[109],"diagrams":[110],"batched":[112],"planar":[113],"point":[114],"location;":[115],"these":[116],"require":[118],"number":[122],"accesses":[125],"are":[127],"simpler":[128],"than":[129],"ones":[131],"previously":[132],"known.":[133],"results":[135],"extend":[136],"model":[140],"multiple":[142],"disks.":[143]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}