Edwards, JohnDaniel, EricPascucci, ValerioBajaj, ChandrajitOlga Sorkine-Hornung and Michael Wimmer2015-04-162015-04-162015https://doi.org/10.1111/cgf.12561We present an algorithm to compute an approximation of the generalized Voronoi diagram (GVD) on arbitrary collections of 2D or 3D geometric objects. In particular, we focus on datasets with closely spaced objects; GVD approximation is expensive and sometimes intractable on these datasets using previous algorithms. With our approach, the GVD can be computed using commodity hardware even on datasets with many, extremely tightly packed objects. Our approach is to subdivide the space with an octree that is represented with an adjacency structure. We then use a novel adaptive distance transform to compute the distance function on octree vertices. The computed distance field is sampled more densely in areas of close object spacing, enabling robust and parallelizable GVD surface generation. We demonstrate our method on a variety of data and show example applications of the GVD in 2D and 3D.Computer Graphics [I.3.5]Computational Geometry and Object ModelingBoundary representations Computer Graphics [I.3.6]Methodology and TechniquesGraphics data structures and data types10.1111/cgf.12561299-309