{"id":"https://openalex.org/W6945220697","doi":"https://doi.org/10.2312/spbg/spbg06/075-084","title":"A Fast k-Neighborhood Algorithm for Large Point-Clouds","display_name":"A Fast k-Neighborhood Algorithm for Large Point-Clouds","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W6945220697","doi":"https://doi.org/10.2312/spbg/spbg06/075-084"},"language":"en","primary_location":{"id":"doi:10.2312/spbg/spbg06/075-084","is_oa":true,"landing_page_url":"https://doi.org/10.2312/spbg/spbg06/075-084","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/spbg/spbg06/075-084","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sankaranarayanan, Jagan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sankaranarayanan, Jagan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Samet, Hanan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samet, Hanan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Varshney, Amitabh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Varshney, Amitabh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5769000053405762},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5559999942779541},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5525000095367432},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.49639999866485596},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.37290000915527344},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3513000011444092},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.3314000070095062}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6502000093460083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6171000003814697},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5769000053405762},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5559999942779541},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5525000095367432},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.49639999866485596},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.37290000915527344},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C126691448","wikidata":"https://www.wikidata.org/wiki/Q2028919","display_name":"Magnitude (astronomy)","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C2781170535","wikidata":"https://www.wikidata.org/wiki/Q30587856","display_name":"Noisy data","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2599000036716461}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/spbg/spbg06/075-084","is_oa":true,"landing_page_url":"https://doi.org/10.2312/spbg/spbg06/075-084","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.2312/spbg/spbg06/075-084","is_oa":true,"landing_page_url":"https://doi.org/10.2312/spbg/spbg06/075-084","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7039769887924194,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Algorithms":[0],"that":[1,70,117],"use":[2,7,119],"point-cloud":[3,68],"models":[4,69],"make":[5],"heavy":[6],"of":[8,11,31,40,46,80,89,95,99,102,120,123,164,169,182],"the":[9,12,20,36,42,77,91,121,135,140,144,158,173,177],"neighborhoods":[10,15],"points.":[13],"These":[14,49],"are":[16,51,71,104,130],"used":[17],"to":[18,54,74,132,138,152,175],"compute":[19,139],"surface":[21],"normals":[22],"for":[23,85,143],"each":[24,47],"point,":[25],"mollification,":[26],"and":[27,179],"noise":[28],"removal.":[29],"All":[30],"these":[32],"primitive":[33,145],"operations":[34],"require":[35],"seemingly":[37],"repetitive":[38],"process":[39],"finding":[41],"k":[43,92,111,127],"nearest":[44,93,112,128],"neighbors":[45,94,129],"point.":[48],"algorithms":[50],"primarily":[52],"designed":[53],"run":[55],"in":[56,62,76,106,154,172,185],"main":[57,78],"memory.":[58],"However,":[59],"rapid":[60],"advances":[61],"scanning":[63],"technologies":[64],"have":[65],"made":[66],"available":[67],"too":[72],"large":[73,97],"fit":[75],"memory":[79],"a":[81,96],"computer.":[82],"This":[83],"calls":[84],"more":[86],"efficient":[87],"methods":[88],"computing":[90],"collection":[98],"points":[100,125],"many":[101],"which":[103],"already":[105],"close":[107],"proximity.":[108],"A":[109],"fast":[110],"neighbor":[113],"algorithm":[114,178],"is":[115,160],"presented":[116],"makes":[118],"locality":[122],"successive":[124],"whose":[126],"sought":[131],"significantly":[133],"reduce":[134],"time":[136,174],"needed":[137,142],"neighborhood":[141],"operation":[146],"as":[147,149],"well":[148],"enable":[150],"it":[151],"operate":[153],"an":[155,167],"environment":[156],"where":[157],"data":[159],"on":[161],"disk.":[162],"Results":[163],"experiments":[165],"demonstrate":[166],"order":[168],"magnitude":[170,183],"improvement":[171,184],"perform":[176],"several":[180,191],"orders":[181],"work":[186],"efficiency":[187],"when":[188],"compared":[189],"with":[190],"prominent":[192],"existing":[193],"method.":[194]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}