Deferred data structure for the nearest neighbor problem

DOI10.1016/0020-0190(91)90164-DMaRDI QIDQ1183453zbMATH OpenDBLPWikidataFDO

Authors Alok Aggarwal, Prabhakar Raghavan

Publication date 28 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

nearest neighborsconvex hullsVoronoi diagramson-line algorithmsfarthest neighbors

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dynamic data structures for \(k\)-nearest neighbor queries
• Space efficient data structures for nearest larger neighbor
• Space efficient data structures for nearest larger neighbor
• Publication:3140435
• Decomposable algorithms for nearest neighbor computing
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Publication:3140433
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• Publication:3140429

Cites work

• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Deferred Data Structuring
• Optimal Search in Planar Subdivisions

Cited in

(2)

• Dynamic deferred data structuring
• Deferred Data Structuring

This page was built for publication: Deferred data structure for the nearest neighbor problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183453)