Results 161 to 170 of about 18,277 (211)
Some of the next articles are maybe not open access.
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
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.
Aichholzer, Oswin +4 more
openaire +2 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.
Aichholzer, Oswin +4 more
openaire +2 more sources
Approximating Voronoi Diagrams with Voronoi Diagrams
2003The 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
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.
Gowda, Ihor G. +3 more
openaire +2 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.
Gowda, Ihor G. +3 more
openaire +2 more sources
Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jooyandeh, Mohammadreza +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jooyandeh, Mohammadreza +2 more
openaire +1 more source
Approximation of Generalized Voronoi Diagrams by Ordinary Voronoi Diagrams
Graphical Models and Image Processing, 1993Abstract A numerically robust algorithm for the ordinary Voronoi diagrams is applied to the approximation of various types of generalized Voronoi diagrams. The generalized Voronoi diagrams treated here include Voronoi diagrams for figures, additively weighted Voronoi diagrams, Voronoi diagrams in a river, Voronoi diagrams in a Riemannian plane, and ...
openaire +1 more source
2007
Voronoi refinement is a powerful tool for efficiently generating meshes for finite element simulation. The classic definition of quality in a mesh can be achieved by bounding the aspect ratio of the Voronoi cells measured as the ratio of the circumscribing and inscribing radii as measured from the site.
Miller, Gary L. +2 more
openaire +1 more source
Voronoi refinement is a powerful tool for efficiently generating meshes for finite element simulation. The classic definition of quality in a mesh can be achieved by bounding the aspect ratio of the Voronoi cells measured as the ratio of the circumscribing and inscribing radii as measured from the site.
Miller, Gary L. +2 more
openaire +1 more source
2008
In this paper, with first introduce a new extension of Voronoi diagram. We assume Voronoi sites to be fuzzy sets and then define Voronoi diagram for this kind of sites, and provide an algorithm for computing this diagram for fuzzy sites. In the next part of the paper we change sites from set of points to set of fuzzy circles.
Mohammadreza Jooyandeh +1 more
openaire +1 more source
In this paper, with first introduce a new extension of Voronoi diagram. We assume Voronoi sites to be fuzzy sets and then define Voronoi diagram for this kind of sites, and provide an algorithm for computing this diagram for fuzzy sites. In the next part of the paper we change sites from set of points to set of fuzzy circles.
Mohammadreza Jooyandeh +1 more
openaire +1 more source
2006
Voronoi diagrams are among the most extensively studied objects in computational geometry with useful applications in different areas of science. To understand impacts of non-Euclidean geometry on computational geometry, this paper investigates the Voronoi diagram in hyperbolic space specially the one in the Poincare hyperbolic disk, which is a 2 ...
Zahra Nilforoushan, Ali Mohades
openaire +1 more source
Voronoi diagrams are among the most extensively studied objects in computational geometry with useful applications in different areas of science. To understand impacts of non-Euclidean geometry on computational geometry, this paper investigates the Voronoi diagram in hyperbolic space specially the one in the Poincare hyperbolic disk, which is a 2 ...
Zahra Nilforoushan, Ali Mohades
openaire +1 more source