{"id":"https://openalex.org/W1975549052","doi":"https://doi.org/10.1007/bf01178779","title":"An all-round sweep algorithm for 2-dimensional nearest-neighbor problems","display_name":"An all-round sweep algorithm for 2-dimensional nearest-neighbor problems","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W1975549052","doi":"https://doi.org/10.1007/bf01178779","mag":"1975549052"},"language":"en","primary_location":{"id":"doi:10.1007/bf01178779","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01178779","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"Acta Informatica","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/A5047713855","display_name":"Klaus Hinrichs","orcid":null},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Hinrichs","raw_affiliation_strings":["FB 15-Informatik, Westf\u00e4lische Wilhelms-Universit\u00e4t, Einsteinstrasse 62, D-4400, M\u00fcnster, Germany","Westfa\u00a8lische Wilhelms-Univ., Mu\u00a8nster, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB 15-Informatik, Westf\u00e4lische Wilhelms-Universit\u00e4t, Einsteinstrasse 62, D-4400, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]},{"raw_affiliation_string":"Westfa\u00a8lische Wilhelms-Univ., Mu\u00a8nster, Germany#TAB#","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113435124","display_name":"J\u00fcrg Nievergelt","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Jurg Nievergelt","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, ETH, CH-8092, Z\u00fcrich, Switzerland","ETH, Zu\u00a8rich, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, ETH, CH-8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH, Zu\u00a8rich, Switzerland#TAB#","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016212896","display_name":"Peter Schorn","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Peter Schorn","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, ETH, CH-8092, Z\u00fcrich, Switzerland","ETH, Zu\u00a8rich, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, ETH, CH-8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH, Zu\u00a8rich, Switzerland#TAB#","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.8062,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.69449378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"4","first_page":"383","last_page":"394"},"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/theory-of-computation","display_name":"Theory of computation","score":0.7490893602371216},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.70174640417099},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6374698877334595},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5755472183227539},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5616783499717712},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5477019548416138},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5430869460105896},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5040237307548523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49377331137657166},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.475950688123703},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4332488477230072},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4250623285770416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4060378670692444},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3941417634487152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38926762342453003},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.09282398223876953},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09060084819793701},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07568538188934326},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06335428357124329}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7490893602371216},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.70174640417099},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6374698877334595},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5755472183227539},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5616783499717712},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5477019548416138},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5430869460105896},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5040237307548523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49377331137657166},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.475950688123703},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4332488477230072},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4250623285770416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4060378670692444},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3941417634487152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38926762342453003},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.09282398223876953},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09060084819793701},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07568538188934326},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06335428357124329},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01178779","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01178779","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"Acta Informatica","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":6,"referenced_works":["https://openalex.org/W1608681432","https://openalex.org/W1993216012","https://openalex.org/W2007610503","https://openalex.org/W2020263890","https://openalex.org/W2070164574","https://openalex.org/W2100543739"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W2011582495","https://openalex.org/W2148008870","https://openalex.org/W2245581955","https://openalex.org/W2169618946","https://openalex.org/W2381195555","https://openalex.org/W1558159560","https://openalex.org/W2519241726","https://openalex.org/W4297819076"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}