{"id":"https://openalex.org/W2066072447","doi":"https://doi.org/10.1007/bf02716805","title":"Accounting for boundary effects in nearest-neighbor searching","display_name":"Accounting for boundary effects in nearest-neighbor searching","publication_year":1996,"publication_date":"1996-02-01","ids":{"openalex":"https://openalex.org/W2066072447","doi":"https://doi.org/10.1007/bf02716805","mag":"2066072447"},"language":"en","primary_location":{"id":"doi:10.1007/bf02716805","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02716805","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02716805.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/BF02716805.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022760571","display_name":"Sunil Arya","orcid":"https://orcid.org/0000-0003-0939-4192"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["DE","HK"],"is_corresponding":false,"raw_author_name":"S. Arya","raw_affiliation_strings":["Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016442699","display_name":"David M. Mount","orcid":"https://orcid.org/0000-0002-3290-8932"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"D. M. Mount","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA","Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083129277","display_name":"Onuttom Narayan","orcid":"https://orcid.org/0000-0001-8433-5569"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O. Narayan","raw_affiliation_strings":["Physics Department, University of California at Santa Cruz, 95064, Santa Cruz, CA, USA","Physics Department, University of California at Santa Cruz, Santa Cruz, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Physics Department, University of California at Santa Cruz, 95064, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Physics Department, University of California at Santa Cruz, Santa Cruz, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.5667,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.89948758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"2","first_page":"155","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9976000189781189,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.8563605546951294},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8108375668525696},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.8064172267913818},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.7672282457351685},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.6770408153533936},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.6618274450302124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5713602304458618},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5187637805938721},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.4965823292732239},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.46956920623779297},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4382869303226471},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.41170066595077515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40105560421943665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34951841831207275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2956506013870239},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.22806933522224426},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12396705150604248},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10799536108970642},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.08653324842453003},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0779004693031311}],"concepts":[{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.8563605546951294},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8108375668525696},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.8064172267913818},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.7672282457351685},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6770408153533936},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.6618274450302124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5713602304458618},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5187637805938721},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4965823292732239},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.46956920623779297},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4382869303226471},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.41170066595077515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40105560421943665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34951841831207275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2956506013870239},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.22806933522224426},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12396705150604248},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10799536108970642},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.08653324842453003},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0779004693031311},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf02716805","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02716805","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02716805.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-26744","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-26744","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/bf02716805","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02716805","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02716805.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5301183642","display_name":"Geometric Tools and Applications","funder_award_id":"9310705","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309622","display_name":"Harvard University","ror":"https://ror.org/03vek6s52"},{"id":"https://openalex.org/F4320332349","display_name":"Society of Fellows, Harvard University","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2066072447.pdf","grobid_xml":"https://content.openalex.org/works/W2066072447.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1637245","https://openalex.org/W97847609","https://openalex.org/W1634005169","https://openalex.org/W1970319631","https://openalex.org/W2009056248","https://openalex.org/W2024668293","https://openalex.org/W2024766881","https://openalex.org/W2049387919","https://openalex.org/W2071866949","https://openalex.org/W2084360845","https://openalex.org/W2090398718","https://openalex.org/W2147647517","https://openalex.org/W2165558283","https://openalex.org/W2169351022","https://openalex.org/W2427881153","https://openalex.org/W2751862591","https://openalex.org/W2995136929","https://openalex.org/W3216003845","https://openalex.org/W4238586245","https://openalex.org/W4301441647","https://openalex.org/W6636654802","https://openalex.org/W6652758386"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W325985789","https://openalex.org/W2795392346","https://openalex.org/W2245581955","https://openalex.org/W2526367648"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}