Results 11 to 20 of about 223,659 (257)
Bregman Voronoi Diagrams [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-Daniel Boissonnat +2 more
core +10 more sources
Rounding Voronoi diagram [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Devillers, Olivier +1 more
openaire +5 more sources
GBGVD: Growth-based geodesic Voronoi diagrams
Given a set of generators, the geodesic Voronoi diagram (GVD) defines how the base surface is decomposed into separate regions such that each generator dominates a region in terms of geodesic distance to the generators.
Yunjia Qi +8 more
doaj +1 more source
Voronoi diagrams and arrangements [PDF]
The authors propose a natural general framework for defining and dealing with diagrams of Voronoi type. An important concept is the notion of an \(f_ E\)-arrangement over a domain D, i.e. the partition of \(D\times {\mathbb{R}}\) induced by a collection \(f_ E\) (indexed by the finite set E) of real valued functions on D. E.g.
Edelsbrunner, H., Seidel, Raimund
openaire +4 more sources
An efficient algorithm for approximate Voronoi diagram construction on triangulated surfaces
Voronoi diagrams on triangulated surfaces based on the geodesic metric play a key role in many applications of computer graphics. Previous methods of constructing such Voronoi diagrams generally depended on having an exact geodesic metric. However, exact
Wenlong Meng +5 more
doaj +1 more source
Voronoi diagrams on the sphere
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hyeon-Suk Na +2 more
openaire +6 more sources
VORONOI DIAGRAMS WITHOUT BOUNDING BOXES [PDF]
We present a technique for presenting geographic data in Voronoi diagrams without having to specify a bounding box. The method restricts Voronoi cells to points within a user-defined distance of the data points.
E. T. K. Sang
doaj +1 more source
Simplified Voronoi diagrams [PDF]
The move of a polytope in the 3-space among obstacle polytopes can be described as a path in the configuration space \(R^ 3\times SO(3)\). The problem of finding a possible path between two points of the configuration space arises from robot path planning and is known among piano movers as well.
Canny, John, Donald, Bruce Randall
openaire +4 more sources
The precise characterization of the lobular architecture of the liver has been subject of investigation since the earliest historical publications, but an accurate model to describe the hepatic lobular microanatomy is yet to be proposed.
C. Lau +6 more
doaj +1 more source
A Voronoi Grid and a Particle Tracking Algorithm for DSMC [PDF]
The DSMC method simulates a gas by three uncoupled steps: moving representative particles through a physical domain, performing probabilistic collisions and estimating the macroscopic state by ensemble averaging.
Stollmeier, Frank +3 more
core +1 more source

