The predicates for the Voronoi diagram of ellipses

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 227-237

  Emiris, Ioannis Z ^a   Tsigaridas, Elias P ^a   Tzoumas, George M ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

Bisector; Ellipse; Euclidean distance; Exact computation; Parametric representation; Predicate; Voronoi diagram

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; OPTIMIZATION; PROBLEM SOLVING; QUERY LANGUAGES;

BISECTOR; ELLIPSE; EUCLIDEAN DISTANCE; EXACT COMPUTATION; PARAMETRIC REPRESENTATION; PREDICATE; VORONOI DIAGRAM;

COMPUTATIONAL GEOMETRY;

EID: 33748058478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137891     Document Type: Conference Paper

References (28)

1. H. Alt, O. Cheong, and A. Vigneron. The Voronoi Diagram of Curved Objects, Discrete and Computational Geometry, 34(3):439-453, Sep 2005.
2. P. Angelier and M. Pocchiola. A sum of squares theorem for visibility. In Procs of 17th SoCG, pages 302-311. ACM Press, 2001.
3. F. Anton. Voronoi diagrams of semi-algebraic sets. PhD thesis, The University of British Columbia, January 2004.
4. F. Anton, J.-D. Boissonnat, D. Mioc, and M. Yvinec. An exact predicate for the optimal construction of the additively weighted Voronoi diagram. In Europ. Workshop Comput. Geom., 2002.
5. D. Attali and J.-D. Boissonnat. Complexity of the delaunay triangulation of points on polyhedral surfaces. Discr. & Comp. Geometry, 30(3):437-452, 2003.
6. I. Boada, N. Coll, and J.A. Sellarès. Multiresolution approximations of generalized Voronol diagrams. In Proc. Intern. Conf. Comp. Science, pages 98-106, 2004.
7. J.-D. Boissonnat and C. Delage. Convex hull and Voronoi diagram of additively weighted points. In Proc. 13th Annu. European Sympos. Algorithms, volume 3669 of Lecture Notes Comput. Sci., pages 367-378. Springer-Verlag, 2005.
8. J.-D. Boissonnat and M. Karavelas. On the combinatorial complexity of Euclidean Voronoi cells and convex hulls of d-dimensional spheres. In Proc. SODA, pages 305-312, 2003.
9. R. Brent. Algorithms for Minimization without Derivatives. Prentice-Hall, Englewood Cliffs, N.J., 1973.
10. C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S, Schmitt. A Separation Bound for Real Algebraic Expressions. In ESA, volume 2161 of LNCS, pages 254-265. Springer, 2001.
11. D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry, Number 185 in GTM. Springer, New York, 2nd edition, 2005.
12. I.Z. Emiris and M.I. Karavelas. The predicates of the Apollonius diagram: algorithmic analysis and implementation. Comp. Geom.: Theory & Appl., Spec. Issue on Robust Geometric Algorithms and their Implementations, 33(1-2):18-57, 2006.
13. I.Z. Emiris and E.P. Tsigaridas. Computing with real algebraic numbers of small degree. In Proc. ESA, LNCS, pages 652-663. Springer, 2004.
14. I.Z. Emiris and E.P. Tsigaridas. Real solving of bivariate polynomial systems. In V.G. Ganzha, E.W. Mayr, and E.V. Vorozhtsov, editors, Proc. Computer Algebra in Scientific Computing (CASC), LNCS, pages 150-161. Springer Verlag, 2005.
15. I.Z. Emiris and G.M. Tzoumas. Algebraic study of the Apollonius circle of three ellipses. In Proc, Europ. Works. Comp. Geom., pages 147-150, Holland, 2005.
16. Also: Poster session, CASC'05, Greece. To appear in SIGSAM Bulletin.
17. F. Etayo, L. Gonzalez-Vega, and N. del Rio. A new approach to characterizing the relative position of two ellipses depending on one parameter. Comp.-Aided Geom. Design, 2005. Submitted.
18. L. Habert. Computing bitangents for ellipses. In Proc. 17th Canad. Conf. Comp. Geom., pages 294-297, 2005.
19. I. Hanniel, R. Muthuganapathy, G. Elber, and M.-S. Kim. Precise Voronoi cell extraction of free-form rational planar closed curves. In Proc, 2005 ACM Symp. Solid and phys, modeling, pages 51-59, Cambridge, Massachusetts, 2005.
20. P. Harrington, C.O. Dúnlaing, and C. Yap. Optimal Voronoi diagram construction with n convex sites in three dimensions. Tech. Rep. TCDMATH 04-21, School of Mathematics, Dublin, 2004.
21. M.I. Karavelas and M. Yvinec. Voronoi diagram of convex objects in the plane. In Proc. ESA, pages 337-348, 2003.
22. D.-S. Kim, D. Kim, and K. Sugihara. Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry. CAGD, 18:563-585, 2001.
23. R. Klein, K. Mehlhorn, and S. Meiser. Randomised incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory & Appl, 3(3):157-184, 1993.
24. M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom., 15:73-105, 1996.
25. B. Mourrain, J. P. Pavone, P. Trébuchet, and E. Tsigaridas. SYNAPS, a library for symbolic-numeric computation. In 8th Int. Symposium on Effective Methods in Algebraic Geometry, MEGA, Sardinia, Italy, May 2005. to appear.
26. W. Wang, J. Wang, and M. Kim. An algebraic condition for the separation of two ellipsoids. Comp, Aided Geom. Design, 18:531-539, 2001.
27. C. Yap. On guaranteed accuracy computation. In F. Chen and D. Wang, editors. Geometric Computation, volume 11 of Lect. Notes Series Comp. World Scientific, 2004.
28. C.K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, 2000.