Results 151 to 160 of about 346,915 (178)
Generalization of Voronoi Diagrams in the Plane
SIAM Journal on Computing, 1981 In this paper we study the Voronoi diagram for a set of N line segments and circles in the Euclidean plane.
D. T. Lee, Robert L. (Scot) Drysdale III
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
International Journal of Computational Geometry & Applications, 1999
On a tilted plane T in three-space, skew distances are defined as the Euclidean distance plus a multiple of the signed difference in height. Skew distances may model realistic environments more closely than the Euclidean distance. Voronoi diagrams and related problems under this kind of distances are investigated.
Oswin Aichholzer +4 more
openaire +3 more sources
On a tilted plane T in three-space, skew distances are defined as the Euclidean distance plus a multiple of the signed difference in height. Skew distances may model realistic environments more closely than the Euclidean distance. Voronoi diagrams and related problems under this kind of distances are investigated.
Oswin Aichholzer +4 more
openaire +3 more sources
IEEE Transactions on Information Theory, 1983
A new dynamizing technique is introduced whereby n point Voronoi diagrams (both closest and farthest point) can be updated in O(n) time per insertion or deletion, in the worst case. General properties of these dynamic Voronoi diagrams are explored including a storage/ deletion-time trade-off.
I. G. Gowda +3 more
openaire +3 more sources
A new dynamizing technique is introduced whereby n point Voronoi diagrams (both closest and farthest point) can be updated in O(n) time per insertion or deletion, in the worst case. General properties of these dynamic Voronoi diagrams are explored including a storage/ deletion-time trade-off.
I. G. Gowda +3 more
openaire +3 more sources
Environment and Planning B: Planning and Design, 2003
This paper introduces procedures involving the recursive construction of Voronoi diagrams and Delaunay tessellations. In such constructions, Voronoi and Delaunay concepts are used to tessellate an object space with respect to a given set of generators and then the construction is repeated every time with a new generator set, which comprises members ...
Boots, B, Shiode, N
openaire +3 more sources
This paper introduces procedures involving the recursive construction of Voronoi diagrams and Delaunay tessellations. In such constructions, Voronoi and Delaunay concepts are used to tessellate an object space with respect to a given set of generators and then the construction is repeated every time with a new generator set, which comprises members ...
Boots, B, Shiode, N
openaire +3 more sources
Approximating Voronoi Diagrams with Voronoi Diagrams
2018The tremendous usefulness of Voronoi diagrams is tempered by their worst-case O(n⌈d/2⌉) size blowup. This makes them an obvious target for approximation, and indeed, several methods have been proposed that produce linear size approximations to the Voronoi diagram supporting logarithmic-time approximate nearest neighbor queries.
Miller, Gary L. +2 more
openaire +1 more source
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011
The sweep line technique has been recently adapted to the sphere in order to build Voronoi diagrams of points on its surface. The resulting algorithm has proved to be simple and efficient, outperforming the freely available alternatives, which compute convex hulls of point sets in 3D.
João Dinis, Margarida Mamede
openaire +2 more sources
The sweep line technique has been recently adapted to the sphere in order to build Voronoi diagrams of points on its surface. The resulting algorithm has proved to be simple and efficient, outperforming the freely available alternatives, which compute convex hulls of point sets in 3D.
João Dinis, Margarida Mamede
openaire +2 more sources
On the Peeper's Voronoi diagram
ACM SIGACT News, 1991In the peeper's Voronoi diagram for n sites, any point in the plane belongs to the region of the closest site visible from it. Visibility is constrained to a segment on a line avoiding the convex hull of the sites. We show that the peeper's Voronoi diagram attains a size of Θ( n 2
Franz Aurenhammer, Gerd Stöckl
openaire +2 more sources
Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammadreza Jooyandeh +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammadreza Jooyandeh +2 more
openaire +1 more source
International Journal of Computational Geometry & Applications, 1992
A new generalized Voronoi diagram is defined on the surface of a river with uniform flow; a point belongs to the territory of a site if and only if a boat starting from the site can reach the point faster than a boat starting from any other site. If the river runs slower than the boat, the Voronoi diagram has the same topological structure as the ...
openaire +3 more sources
A new generalized Voronoi diagram is defined on the surface of a river with uniform flow; a point belongs to the territory of a site if and only if a boat starting from the site can reach the point faster than a boat starting from any other site. If the river runs slower than the boat, the Voronoi diagram has the same topological structure as the ...
openaire +3 more sources