A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
ORTHANT NEIGHBORHOOD GRAPHS - A Decentralized Approach for Proximity Queries in Dynamic Point Sets
Proceedings of the Second International Conference on Computer Graphics Theory and Applications
Figure 1 : A complex example of an ONG for a point set with ca. 750 points. Abstract: This work presents a novel approach for proximity queries in dynamic point sets, a common problem in computer graphics. We introduce the notion of Orthant Neighborhood Graphs, yielding a simple, decentralized spatial data structure based on weak spanners. We present efficient algorithms for dynamic insertions, deletions and movements of points, as well as range searching and other proximity queries. All ourdoi:10.5220/0002082800850093 fatcat:igzpfl2p2rcxjiskiifi6ihoee