linear-size approximate voronoi diagrams
Given a set S of n points in IR d , a ( t, ?)- approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t representative points of S, such that for any point in c, one of the associated representatives approximates the nearest neighbor to within a factor of (1 + ?). The goal is to minimize the number and complexity of the cells in the AVD. We show that it is possible to construct an AVD consisting of O ( n /? d ) cells for t = 1, and O ( n ) cells for t = O (1/? ( d -1)/2 ). In general, for a real parameter 2 ? ? ? 1/?, we show that it is possible to construct a ( t, ?)-AVD consisting of O ( n ? d ) cells for t = O (1/(??) ( d -1)/2 ). The cells in these AVDs are cubes or differences of two cubes. All these structures can be used to efficiently answer approximate nearest neighbor queries. Our algorithms are based on the well-separated pair decomposition and are very simple.
approximation voronoi diagrams diagrams point partition space complexity association nearest neighbor factor general queries algorithm decomposition size