VD,voronoi diagram,Voronoi diagrams,Voronoy diagram

voronoi diagram - VD
Publications: 2,677| Citation Count: 35,194
Stemming Variations: Voronoi diagrams, Voronoy diagram
Cumulative Annual
    • The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients...

    Moonbae Songet al. Location-Based Caching Scheme for Mobile Clients

    • The Voronoi diagram (VD) is a fundamental geometric structure in many applications. There are fast and simple algorithms to construct the VD of static point sets. For complex sites (i.e., other than points) the algorithms are more sophisticated, and a few efficient solutions exist. However, updating the VD of dynamic sites is still challenging, and efficient solutions exist only for points...

    Francisco de Moura Pintoet al. Dynamic Voronoi diagram of complex sites

    • The Voronoi diagram is a fundamental structure in computationalgeometryand arises naturally in many different fields. This chapter surveys properties of theVoronoi diagram and its geometric dual, the Delaunay triangulation. The emphasisis on practical algorithms for the construction of Voronoi diagrams.1 IntroductionLet S be a set of n points in d-dimensional euclidean space Ed...

    Steven Fortune. Voronoi diagrams and Delaunay triangulations

    • The Voronoi diagram is a fundamental geometric object for encoding proximity information. An efficient C implementation of Fortune's plane-sweep algorithm for constructing the Voronoi diagram and the Delaunay triangulation of a set of points in the plane is presented...

    Kenny Wong. An Efficient Implementation of Fortune's Plane-Sweep Algorithm for Vor...

    • The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases...

    Reynold Chenget al. UV-diagram: A Voronoi diagram for uncertain data

Sort by: