{"id":"https://openalex.org/W1492371197","doi":"https://doi.org/10.1090/dimacs/050/08","title":"On showing lower bounds for external-memory computational geometry problems","display_name":"On showing lower bounds for external-memory computational geometry problems","publication_year":1999,"publication_date":"1999-11-30","ids":{"openalex":"https://openalex.org/W1492371197","doi":"https://doi.org/10.1090/dimacs/050/08","mag":"1492371197"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/050/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/050/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lars Arge","raw_affiliation_strings":["AT&T Labs-Research, Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs-Research, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098248257","display_name":"Peter Miltersen","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Miltersen","raw_affiliation_strings":["Duke University, Durham, NC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3187,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95785441,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"159"},"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.9984999895095825,"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.9984999895095825,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9886999726295471,"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/geometry","display_name":"Geometry","score":0.5537628531455994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4944276809692383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3161865472793579}],"concepts":[{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.5537628531455994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4944276809692383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3161865472793579}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1090/dimacs/050/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/050/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.6313","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.6313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/Projects/ALCOMIT/ArgeMiltersen98.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.883","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~large/Papers/indivis.ps","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/60c57d20-b028-11df-8c1a-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/60c57d20-b028-11df-8c1a-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L A & Miltersen, P B 1999, 'On showing lower bounds for external-memory computational geometry problems', D I M A C S Series in Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 139-160.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644"],"abstract_inverted_index":{".":[0],"In":[1],"this":[2,62,133],"paper":[3],"we":[4,38,47,68,81,96],"consider":[5],"lower":[6,49,66,87],"bounds":[7,50,67],"for":[8,51,89],"external-memory":[9,100],"computational":[10],"geometry":[11],"problems.":[12,30],"We":[13],"find":[14],"that":[15,73],"it":[16],"is":[17,123,135],"not":[18],"quite":[19],"clear":[20],"which":[21],"model":[22],"of":[23,34,54,102,132],"computation":[24,105,139,145],"to":[25,84],"use":[26],"when":[27],"considering":[28],"such":[29],"As":[31,92],"an":[32,93,99],"attempt":[33],"providing":[35],"a":[36,52],"model,":[37,45,95],"define":[39],"the":[40,57,70,78,86,103,124],"external":[41,121],"memory":[42,118],"Turing":[43],"machine":[44],"and":[46,119,142],"derive":[48],"number":[53],"problems,":[55],"including":[56],"element":[58,90],"distinctness":[59],"problem,":[60],"in":[61,126],"model.":[63],"For":[64],"these":[65],"make":[69],"standard":[71],"assumption":[72,80],"records":[74],"are":[75],"indivisible.":[76],"Waiving":[77],"indivisibility":[79],"show":[82],"how":[83],"beat":[85],"bound":[88],"distinctness.":[91],"alternative":[94],"briefly":[97],"discuss":[98],"version":[101],"algebraic":[104],"tree.":[106],"1.":[107],"Introduction":[108],"The":[109,130],"Input/Output":[110],"(or":[111],"just":[112],"I/O)":[113],"communication":[114],"between":[115],"fast":[116],"internal":[117,138],"slower":[120],"storage":[122],"bottleneck":[125,134],"many":[127],"large-scale":[128],"computations.":[129],"significance":[131],"increasing":[136],"as":[137,143],"gets":[140],"faster,":[141],"parallel":[144],"gains":[146],"popularity.":[147],"Currently,...":[148]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}