Abstract
The most of the authors who proposed algorithms dealing with curved objects used a set of oracles allowing to perform basic geometric operations on curves (as computing the intersection of two curves). If the handled curves are algebraic, the oracles involve algebraic equations resolution, and in a geometric computing framework no method of solving algebraic equations is considered available. In this paper, we address the problem of the incidence graph of an arrangement of curves and we propose a method that completely avoids algebraic equations, all the computations to be done concerning linear objects. This will be done via suitable polygonal approximations of the given curves; we start by presenting a “polygonal” method in a case where the required polygonal approximations exist by definition, the case of composite Bézier curves, and then we show how we can construct these polygonal approximations in the general case of Jordan arcs.
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
Boissonnat, J.-D., Yvinec, M.: Géométrie algorithmique. Edisciences international, Paris (1995)
Dobkin, D.P., Souvaine, D.L.: Computational Geometry in a Curved World. Algorithmica 5, 421–457 (1990)
Edelsbrunner, H., Guibas, L., Pach, J., Seidel, R., Sharir, M.: Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. Theoretical Computer Science 92, 319–336 (1992)
Farin, G.: Curves and Surfaces for Computer Aided Geometric Design: a Practical Guide, 4th edn. Academic Press, London (1997)
Grünbaum, B.: Arrangements and spreads. In: Conference board of the mathematical sciences, AMS, Providence, RI, vol. 10 (1972)
Kirkpatrick, D., Snoeyink, J.: Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundamenta Informaticae 22, 353–370 (1995)
Milenkovič, V.: Calculating approximate curve arrangements using rounded arrith-metic. In: ACM Symposium on Computational Geometry, pp. 197–207 (1989)
Neagu, M.: Courbes de Bézier en Géométrie Algorithmique: approximation et cohérence topologique, PhD thesis, Université Joseph Fourier, Grenoble (1998)
Snoeyink, J., Hershberger, J.: Sweeping arrangements of curves. In: ACM Symposium on Computational Geometry, pp. 354–363 (1989)
Vo Phi, K., Contributions à l’étude des arrangements : équivalences combinatoires et perturbations, PhD thesis, Université Joseph Fourier, Grenoble, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neagu, M. (2000). Polygonal Approximations for Curved Problems: An Application to Arrangements. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-46515-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67181-7
Online ISBN: 978-3-540-46515-7
eBook Packages: Springer Book Archive