{"id":"https://openalex.org/W2024409132","doi":"https://doi.org/10.1007/pl00009390","title":"Approximate Nearest Neighbor Queries Revisited","display_name":"Approximate Nearest Neighbor Queries Revisited","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2024409132","doi":"https://doi.org/10.1007/pl00009390","mag":"2024409132"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009390","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009390","pdf_url":"https://link.springer.com/content/pdf/10.1007%2FPL00009390.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 &amp; 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%2FPL00009390.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102958684","display_name":"T M Chan","orcid":"https://orcid.org/0000-0002-5350-0290"},"institutions":[{"id":"https://openalex.org/I145608581","display_name":"University of Miami","ror":"https://ror.org/02dgjyy92","country_code":"US","type":"education","lineage":["https://openalex.org/I145608581"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. M. Chan","raw_affiliation_strings":["Department of Mathematics and Computer Science,  University of Miami,   Coral Gables, FL 33124-4250, USA   tchan@cs.miami.edu, , , , , , US","Department of Mathematics and Computer Science, University of Miami, Coral Gables, FL 33124-4250, USA tchan@cs.miami.edu , , US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science,  University of Miami,   Coral Gables, FL 33124-4250, USA   tchan@cs.miami.edu, , , , , , US","institution_ids":["https://openalex.org/I145608581"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Miami, Coral Gables, FL 33124-4250, USA tchan@cs.miami.edu , , US","institution_ids":["https://openalex.org/I145608581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102958684"],"corresponding_institution_ids":["https://openalex.org/I145608581"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.6001,"has_fulltext":true,"cited_by_count":78,"citation_normalized_percentile":{"value":0.89132554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"20","issue":"3","first_page":"359","last_page":"373"},"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.9994999766349792,"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.9994999766349792,"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.9980000257492065,"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/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"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/combinatorics","display_name":"Combinatorics","score":0.7734049558639526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7180019617080688},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.608339786529541},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.524158239364624},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5219652056694031},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4639003276824951},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4601162075996399},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.44052448868751526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3553636372089386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11115455627441406},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08133983612060547}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7734049558639526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7180019617080688},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.608339786529541},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.524158239364624},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5219652056694031},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4639003276824951},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4601162075996399},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.44052448868751526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3553636372089386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11115455627441406},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08133983612060547},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009390","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009390","pdf_url":"https://link.springer.com/content/pdf/10.1007%2FPL00009390.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 &amp; Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/pl00009390","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009390","pdf_url":"https://link.springer.com/content/pdf/10.1007%2FPL00009390.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 &amp; Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2024409132.pdf","grobid_xml":"https://content.openalex.org/works/W2024409132.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1580686703","https://openalex.org/W1671942308","https://openalex.org/W1970319631","https://openalex.org/W1971238646","https://openalex.org/W1984182033","https://openalex.org/W1996064221","https://openalex.org/W1998512964","https://openalex.org/W2000335705","https://openalex.org/W2005314985","https://openalex.org/W2013382394","https://openalex.org/W2013729760","https://openalex.org/W2016400774","https://openalex.org/W2028430839","https://openalex.org/W2031671531","https://openalex.org/W2049565975","https://openalex.org/W2050749090","https://openalex.org/W2055488252","https://openalex.org/W2058127000","https://openalex.org/W2066072447","https://openalex.org/W2071866949","https://openalex.org/W2093241092","https://openalex.org/W2093521781","https://openalex.org/W2103429114","https://openalex.org/W2115135558","https://openalex.org/W2138149539","https://openalex.org/W2146517658","https://openalex.org/W2147717514","https://openalex.org/W2162487598","https://openalex.org/W2169351022","https://openalex.org/W2609517418","https://openalex.org/W6634675470"],"related_works":["https://openalex.org/W4294294347","https://openalex.org/W2279239548","https://openalex.org/W115379796","https://openalex.org/W63976795","https://openalex.org/W2404658402","https://openalex.org/W2610298398","https://openalex.org/W4281992692","https://openalex.org/W2105228010","https://openalex.org/W164473625","https://openalex.org/W122023996"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}
