{"id":"https://openalex.org/W2072596762","doi":"https://doi.org/10.1007/pl00009293","title":"On Nearest-Neighbor Graphs","display_name":"On Nearest-Neighbor Graphs","publication_year":1997,"publication_date":"1997-04-01","ids":{"openalex":"https://openalex.org/W2072596762","doi":"https://doi.org/10.1007/pl00009293","mag":"2072596762"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009293","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009293","pdf_url":"https://link.springer.com/content/pdf/10.1007/PL00009293.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/PL00009293.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108527295","display_name":"David Eppstein","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Eppstein","raw_affiliation_strings":["Department of Information and Computer Science, University of California, 92697, Irvine, CA, USA","Department of Information and Computer Science, University of California, Irvine, USA 92697#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, University of California, 92697, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Information and Computer Science, University of California, Irvine, USA 92697#TAB#","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063801356","display_name":"Mike Paterson","orcid":"https://orcid.org/0000-0003-0426-3468"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. S. Paterson","raw_affiliation_strings":["Department of Computer Science, University of Warwick, CV4 7AL, Coventry, England","Department of Computer Science, University of Warwick, Coventry, England CV4 7AL#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, CV4 7AL, Coventry, England","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, England CV4 7AL#TAB#","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050775798","display_name":"Fei Yao","orcid":"https://orcid.org/0000-0003-4108-8937"},"institutions":[{"id":"https://openalex.org/I173498003","display_name":"Palo Alto Research Center","ror":"https://ror.org/0529fxt39","country_code":"US","type":"facility","lineage":["https://openalex.org/I173498003","https://openalex.org/I4210132870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. F. Yao","raw_affiliation_strings":["Xerox Palo Alto Research Center, 3333 Coyote Hill Road, 94304, Palo Alto, CA, USA","Xerox Palo Alto Research Center, Palo Alto, USA 94304#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xerox Palo Alto Research Center, 3333 Coyote Hill Road, 94304, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I173498003"]},{"raw_affiliation_string":"Xerox Palo Alto Research Center, Palo Alto, USA 94304#TAB#","institution_ids":["https://openalex.org/I173498003"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050775798","https://openalex.org/A5063801356","https://openalex.org/A5108527295"],"corresponding_institution_ids":["https://openalex.org/I173498003","https://openalex.org/I204250578","https://openalex.org/I39555362"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":1.3599,"has_fulltext":true,"cited_by_count":238,"citation_normalized_percentile":{"value":0.79027778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"17","issue":"3","first_page":"263","last_page":"282"},"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.9998999834060669,"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.9998999834060669,"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.9948999881744385,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.792245626449585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7311648726463318},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6615490913391113},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6504249572753906},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6168283224105835},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5361425876617432},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5088961124420166},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4911784827709198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4591808021068573},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.45655858516693115},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.4534696042537689},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.4447616636753082},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.41415080428123474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4103517234325409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14804717898368835},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.12530481815338135},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1228402853012085},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.11268314719200134}],"concepts":[{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.792245626449585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7311648726463318},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6615490913391113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6504249572753906},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6168283224105835},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5361425876617432},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5088961124420166},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4911784827709198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4591808021068573},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.45655858516693115},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.4534696042537689},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4447616636753082},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.41415080428123474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4103517234325409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14804717898368835},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.12530481815338135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1228402853012085},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.11268314719200134},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":2,"locations":[{"id":"doi:10.1007/pl00009293","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009293","pdf_url":"https://link.springer.com/content/pdf/10.1007/PL00009293.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:CiteSeerX.psu:10.1.1.40.3206","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.3206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~eppstein/pubs/EppPatYao-DCG-97.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/pl00009293","is_oa":true,"landing_page_url":"https://doi.org/10.1007/pl00009293","pdf_url":"https://link.springer.com/content/pdf/10.1007/PL00009293.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/G7006051974","display_name":"NSF Young Investigator:  Algorithms for Molecular Biology,  Optimal Triangulation, Minimum Spanning Trees, and          Geometric Optimization","funder_award_id":"9258355","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2072596762.pdf","grobid_xml":"https://content.openalex.org/works/W2072596762.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1545795230","https://openalex.org/W1982159068","https://openalex.org/W1993216012","https://openalex.org/W1995990042","https://openalex.org/W1997790894","https://openalex.org/W2022266599","https://openalex.org/W2022853835","https://openalex.org/W2051522939","https://openalex.org/W2059799954","https://openalex.org/W2068871408","https://openalex.org/W2071362090","https://openalex.org/W2092569613","https://openalex.org/W2106136378","https://openalex.org/W2156393948","https://openalex.org/W2161008043","https://openalex.org/W2165274952","https://openalex.org/W3137349107","https://openalex.org/W4293259454","https://openalex.org/W4300640952","https://openalex.org/W6723629830"],"related_works":["https://openalex.org/W2795392346","https://openalex.org/W2969538544","https://openalex.org/W2182477562","https://openalex.org/W2351157934","https://openalex.org/W2148008870","https://openalex.org/W2519241726","https://openalex.org/W4246757943","https://openalex.org/W2375128115","https://openalex.org/W1595303882","https://openalex.org/W2169618946"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":30},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":7}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}