{"id":"https://openalex.org/W1965370706","doi":"https://doi.org/10.1007/bf01933171","title":"Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection","display_name":"Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W1965370706","doi":"https://doi.org/10.1007/bf01933171","mag":"1965370706"},"language":"en","primary_location":{"id":"doi:10.1007/bf01933171","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01933171","pdf_url":null,"source":{"id":"https://openalex.org/S125499977","display_name":"BIT Numerical Mathematics","issn_l":"0006-3835","issn":["0006-3835","1572-9125"],"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":"BIT","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/A5003154043","display_name":"Frank Bartling","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"]},{"id":"https://openalex.org/I2800742272","display_name":"Folkwang University of the Arts","ror":"https://ror.org/03gf02c22","country_code":"DE","type":"education","lineage":["https://openalex.org/I2800742272"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Bartling","raw_affiliation_strings":["FB 12, Informatik, Universit\u00e4t-GH-Siegen, Postfach 10 1240, D-5900, Siegen, Germany","FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, Einsteinstrasse 62, D-4400, M\u00fcnster, Germany","FB 12, Informatik, Universit\u00e4t-GH-Siegen, Siegen, Germany","FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, M\u00fcnster, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB 12, Informatik, Universit\u00e4t-GH-Siegen, Postfach 10 1240, D-5900, Siegen, Germany","institution_ids":["https://openalex.org/I2800742272"]},{"raw_affiliation_string":"FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, Einsteinstrasse 62, D-4400, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]},{"raw_affiliation_string":"FB 12, Informatik, Universit\u00e4t-GH-Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I2800742272"]},{"raw_affiliation_string":"FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"last","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"]},{"id":"https://openalex.org/I2800742272","display_name":"Folkwang University of the Arts","ror":"https://ror.org/03gf02c22","country_code":"DE","type":"education","lineage":["https://openalex.org/I2800742272"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Hinrichs","raw_affiliation_strings":["FB 12, Informatik, Universit\u00e4t-GH-Siegen, Postfach 10 1240, D-5900, Siegen, Germany","FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, Einsteinstrasse 62, D-4400, M\u00fcnster, Germany","FB 12, Informatik, Universit\u00e4t-GH-Siegen, Siegen, Germany","FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, M\u00fcnster, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB 12, Informatik, Universit\u00e4t-GH-Siegen, Postfach 10 1240, D-5900, Siegen, Germany","institution_ids":["https://openalex.org/I2800742272"]},{"raw_affiliation_string":"FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, Einsteinstrasse 62, D-4400, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]},{"raw_affiliation_string":"FB 12, Informatik, Universit\u00e4t-GH-Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I2800742272"]},{"raw_affiliation_string":"FB 15, Informatik, Westf\u00e4hlische Wilhelms-Universit\u00e4t, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.09740933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"4","first_page":"558","last_page":"565"},"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.9961000084877014,"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.9961000084877014,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7270967364311218},{"id":"https://openalex.org/keywords/unit-cube","display_name":"Unit cube","score":0.7023486495018005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.656570553779602},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.6297100782394409},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5536139011383057},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5451993942260742},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5409859418869019},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5361831784248352},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.5150980353355408},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4852895438671112},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4807719588279724},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4788132309913635},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.45717743039131165},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.4262756407260895},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.422961950302124},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4181898236274719},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41028040647506714},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2472343146800995},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.20554450154304504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1743311882019043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1672898530960083},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09908056259155273},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.08173024654388428},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07765331864356995}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7270967364311218},{"id":"https://openalex.org/C60432849","wikidata":"https://www.wikidata.org/wiki/Q2072112","display_name":"Unit cube","level":2,"score":0.7023486495018005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.656570553779602},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6297100782394409},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5536139011383057},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5451993942260742},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5409859418869019},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5361831784248352},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.5150980353355408},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4852895438671112},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4807719588279724},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4788132309913635},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.45717743039131165},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.4262756407260895},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.422961950302124},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4181898236274719},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41028040647506714},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2472343146800995},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.20554450154304504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1743311882019043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1672898530960083},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09908056259155273},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.08173024654388428},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07765331864356995},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01933171","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01933171","pdf_url":null,"source":{"id":"https://openalex.org/S125499977","display_name":"BIT Numerical Mathematics","issn_l":"0006-3835","issn":["0006-3835","1572-9125"],"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":"BIT","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":5,"referenced_works":["https://openalex.org/W124167277","https://openalex.org/W1930039120","https://openalex.org/W1983645263","https://openalex.org/W1991131012","https://openalex.org/W2084300309"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W4246757943","https://openalex.org/W2071866949","https://openalex.org/W2097149198","https://openalex.org/W325985789","https://openalex.org/W2921311902","https://openalex.org/W2245581955","https://openalex.org/W2382385087","https://openalex.org/W2131082717","https://openalex.org/W2167756706"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}