Skip to Main content Skip to Navigation

Exact and efficient computations on circles in CGAL and applications to VLSI design

Pedro de Castro 1 Sylvain Pion 1 Monique Teillaud 1
1 GEOMETRICA - Geometric computing
INRIA Futurs, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : CGAL (Computational Geometry Algorithms Library) is a large collection of geometric objects, data structures and algorithms. CGAL currently offers mostly functionalities for linear objects (points, segments, lines, triangles...). The first version of a kernel for circles and circular arcs in 2D was recently released in CGAL 3.2. We show in this paper a variety of techniques that we tested to improve the efficiency of the 2D circular kernel. These improvements are motivated by applications to VLSI design, and real VLSI industrial data are used to measure the impact of the techniques used to enhance this kernel. The improvements will be integrated in CGAL 3.3.
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Thursday, January 11, 2007 - 1:04:03 PM
Last modification on : Friday, February 4, 2022 - 3:15:14 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 11:31:13 AM


Files produced by the author(s)


  • HAL Id : inria-00123259, version 2



Pedro de Castro, Sylvain Pion, Monique Teillaud. Exact and efficient computations on circles in CGAL and applications to VLSI design. [Research Report] RR-6091, INRIA. 2007, pp.14. ⟨inria-00123259v2⟩



Record views


Files downloads