{"id":"https://openalex.org/W2051390146","doi":"https://doi.org/10.1007/bf01377181","title":"An optimal algorithm for the on-line closest-pair problem","display_name":"An optimal algorithm for the on-line closest-pair problem","publication_year":1994,"publication_date":"1994-07-01","ids":{"openalex":"https://openalex.org/W2051390146","doi":"https://doi.org/10.1007/bf01377181","mag":"2051390146"},"language":"en","primary_location":{"id":"doi:10.1007/bf01377181","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01377181","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5101759540","display_name":"Christian Schwarz","orcid":"https://orcid.org/0000-0003-2567-4637"},"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":true,"raw_author_name":"C. Schwarz","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, D-66123, Saarbr\u00fccken, Im Stadtwald, Germany","Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Im Stadtwald, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, D-66123, Saarbr\u00fccken, Im Stadtwald, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Im Stadtwald, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025759208","display_name":"Marcel Smid","orcid":"https://orcid.org/0000-0003-0605-1901"},"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":"M. Smid","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, D-66123, Saarbr\u00fccken, Im Stadtwald, Germany","Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Im Stadtwald, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, D-66123, Saarbr\u00fccken, Im Stadtwald, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Im Stadtwald, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074061303","display_name":"Jack Snoeyink","orcid":"https://orcid.org/0000-0002-3887-4008"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Snoeyink","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, V6T 1W5, Vancouver, BC, Canada","Department of Computer Science,  University of British Columbia,  Vancouver, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, V6T 1W5, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science,  University of British Columbia,  Vancouver, Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101759540"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.2111,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.76879026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"1","first_page":"18","last_page":"29"},"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.9994999766349792,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/theory-of-computation","display_name":"Theory of computation","score":0.643692672252655},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.6243672966957092},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6178715825080872},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6121280789375305},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5405485033988953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5200414657592773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47641265392303467},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46724963188171387},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.45157164335250854},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.44794654846191406},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4440919756889343},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.44036397337913513},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43609076738357544},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.42165809869766235},{"id":"https://openalex.org/keywords/centroid","display_name":"Centroid","score":0.42134231328964233},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.34296920895576477},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.25612854957580566}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.643692672252655},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.6243672966957092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6178715825080872},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6121280789375305},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5405485033988953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5200414657592773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47641265392303467},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46724963188171387},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.45157164335250854},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.44794654846191406},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4440919756889343},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.44036397337913513},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43609076738357544},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.42165809869766235},{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.42134231328964233},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.34296920895576477},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25612854957580566},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01377181","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01377181","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1526558083","https://openalex.org/W1547941494","https://openalex.org/W1555981919","https://openalex.org/W1577072106","https://openalex.org/W1964796553","https://openalex.org/W1981335015","https://openalex.org/W1993216012","https://openalex.org/W2005314985","https://openalex.org/W2006811735","https://openalex.org/W2007610503","https://openalex.org/W2009530930","https://openalex.org/W2084362141","https://openalex.org/W2129335013","https://openalex.org/W2132339863","https://openalex.org/W2150518053","https://openalex.org/W2911302472","https://openalex.org/W2999274412","https://openalex.org/W6605182955"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W3169685561","https://openalex.org/W2501849745","https://openalex.org/W2371680642","https://openalex.org/W2026697457","https://openalex.org/W2135212710","https://openalex.org/W1510719821","https://openalex.org/W2117536196","https://openalex.org/W2910653847","https://openalex.org/W3022865202"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}