Abstract
The common way to construct Voronoi tessellations is to compare the distances between given reference points using a given distance function. To generalize this distance-function concept we expand an existing approach which defines distance functions by their ``unit circles''. Our new approach allows modeling the ``unit circles'' by a closed Spline curve. Changing the control polygon directly affects the tessellation's appearance. Typically generalized Voronoi diagrams are represented by Voronoi vertices and curves separating the individual tiles. To obtain interactive modeling we extended an existing hardware accelerated rendering approach computing a bitmap-representation using different colors for individual tiles. With our extension, we are able to use our Spline distance representations as input for a growing process. This growing process easily takes into account weighting approaches like multiplicative, additive, and even free functional weighting.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Handbook of computational geometry (Sack, J. R. and Urrutia, J., eds.). Elsevier 1999.
Aurenhammer, F.: The one-dimensional weighted Voronoi diagram. Information Processing Lett. 22(3), 119–123 (3 March 1986).
F. Aurenhammer (1991) ArticleTitleVoronoi diagrams-a survey of a fundamental geometric data structure ACM Comput. Surv. 23 IssueID3 345–405 Occurrence Handle10.1145/116873.116880
Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted voronoi diagram in the plane. Technical report, University of Graz, 1983.
Chew, A., Drysdale, S.: Voronoi diagrams based on convex distance functions. In: COMPGEOM: Annual ACM Symposium on Computational Geometry, 1985.
de Boor, C.: On calculating with B-spline. J. Approx. Theor. pp. 50–62, 1972.
C. Boor Particlede (1978) A practical guide to splines Springer Berlin Occurrence Handle0406.41003
Delaunay, B. N.: Sur la sphere vide. Bull. Acad. Sci. USSR VII: Class. Sci. Math. pp. 793–800 (1934).
G. L. Dirichlet (1850) ArticleTitleÜber die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen J. Reine Angew. Math. 40 209–227
Farin, G.: Curves and surfaces for computer aided geometric design: A practical guide. Academic Press 1988.
Hagen, H., Ruby, M., Scheler, I., Schneider, M.: Topology-preserving distance functions for tessellations. In: Proc. 5th IASTED International Conference on Visualization, Imaging, and Image Processing (VIIP 2005) (J.J. Villanueva, eds.), pp. 674–679, Anaheim, Calgary, Zürich, 2005. ACTA Press.
Hoff III, K. E., Culver, T., Keyser, J., Lin, M., Manocha, D.: Fast computation of generalized Voronoi diagrams using graphics hardware. In: Proc. Conf. Computer Graphics (Siggraph99) (Alyn Rockwood, ed.), pp. 277–286. N.Y., August 8–13 1999. ACM Press.
Klein, R.: Concrete and abstract Voronoi diagrams. Lecture Notes in Computer Science, Vol. 400. Springer 1989.
Klein, R.: Algorithmische Geometrie. Addison-Wesley 1997.
A. Okabe B. Boots K. Sugihara (1992) Spatial tesselations – concepts and applications of Voronoi diagrams Wiley Chichester
Piegl, L.: On NURBS: A survey. IEEE Computer Graphics and Applications 11(1), 55–71, January 1991.
G. Voronoi (1907) ArticleTitleNouvelles applications des paramètres continus à la théorie des formes quadratiques – premier mémoire: Sur quelques propriétés des formes quadtratiques positives parfaites J. Reine Angew. Math. 133 97–178
G. Voronoi (1908) ArticleTitleNouvelles applications des parametres continus a la theorie des formes quadratiques J. Reine Angew. Math. 134 198–287
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hagen, H., Schneider, M., Schlemmer, M. et al. Fast Voronoi modeling. Computing 79, 185–196 (2007). https://doi.org/10.1007/s00607-006-0197-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-006-0197-8