Abstract
Most of the curves and surfaces encountered in geometric modelling are defined as the set of common zeroes of a set of polynomials (algebraic varieties) or subsets of algebraic varieties defined by one or more algebraic inequalities (semi-algebraic sets). Many problems from different fields involve proximity queries like finding the nearest neighbour, finding all the neighbours, or quantifying the neighbourliness of two objects. The Voronoi diagram of a set of sites is a decomposition of the space into proximal regions: each site’s Voronoi region is the set of points closer to that site than to any other site. The Delaunay graph of a set of sites is the dual graph of the Voronoi diagram of that set of sites, which stores the spatial adjacency relationships among sites induced by the Voronoi diagram. The Voronoi diagram has been used for solving the earlier mentioned proximity queries. The ordinary Voronoi diagram of point sites has been extended or generalised in several directions (underlying space, metrics, sites), and the resulting generalised Voronoi diagrams have found many practical applications. The Voronoi diagrams have not yet been generalised to algebraic curves or semi-algebraic sets. In this paper, we present a conflict locator for the certified incremental maintenance of the Delaunay graph of semi-algebraic sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anton, F.: Voronoi diagrams of semi-algebraic sets. PhD thesis, The University of British Columbia, Vancouver, British Columbia, Canada (January 2004)
Arrondo, E., Sendra, J., Sendra, J.R.: Genus formula for generalized offset curves. J. Pure Appl. Algebra 136(3), 199–209 (1999)
Bajaj, C.L.: Some applications of constructive real algebraic geometry. In: Algebraic geometry and its applications (West Lafayette, IN, 1990), pp. 393–405. Springer, New York (1994)
Bochnak, J., Coste, M., Roy, M.-F.: Real algebraic geometry. Springer, Berlin (1998); Translated from the 1987 French original, Revised by the authors
Benedetti, R., Risler, J.-J.: Real algebraic and semialgebraic sets. Hermann, Paris (1990)
Klein, R.: Concrete and abstract Voronoï diagrams. Springer, Berlin (1989)
Merlet, J.-P.: Some algebraic geometry problems arising in the field of mechanism theory. In: Algorithms in algebraic geometry and applications (Santander, 1994), pp. 271–283. Birkhäuser, Basel (1996)
Merlet, J.-P.: Alias: an interval analysis based library for solving and analyzing system of equations. In: SEA, Toulouse, France, pp. 14–16 (June 2000)
Okabe, A., Boots, B., Sugihara, K.: Spatial tessellations: concepts and applications of Voronoï diagrams. John Wiley & Sons Ltd., Chichester (1992), With a foreword by D.G. Kendall
Ó’Dúnlaing, C., Yap, C.-K.: A ”retraction” method for planning the motion of a disc. J. Algorithms 6(1), 104–111 (1985)
Ramamurthy, R., Farouki, R.T.: Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. I. Theoretical foundations. J. Comput. Appl. Math. 102(1), 119–141 (1999), Special issue: computational methods in computer graphics (1999)
Voronoï, G.F.: Nouvelles applications des paramètres continus à la théorie des formes quadratiques. deuxième mémoire. recherches sur les paralléloèdres primitifs. première partie. partition uniforme de l’espace analytique à n dimensions à l’aide des translations d’un même polyèdre convexe. Journal für die reine und angewandte Mathematik 134, 198–287 (1908)
Voronoï, G.F.: Nouvelles applications des paramètres continus à la théorie des formes quadratiques. deuxième mémoire. recherches sur les paralléloèdres primitifs. seconde partie. domaines de formes quadratiques correspondant aux différents types de paralléloèdres primitifs. Journal für die reine und angewandte Mathematik 136, 67–181 (1910)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anton, F. (2005). A Certified Delaunay Graph Conflict Locator for Semi-algebraic Sets. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_70
Download citation
DOI: https://doi.org/10.1007/11424758_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25860-5
Online ISBN: 978-3-540-32043-2
eBook Packages: Computer ScienceComputer Science (R0)