Exact and efficient computations on circles in CGAL and applications to VLSI design - Inria - Institut national de recherche en sciences et technologies du numérique
Rapport (Rapport De Recherche) Année : 2007

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

Monique Teillaud
Pedro M. M. de Castro
  • Fonction : Auteur
  • PersonId : 837455
Sylvain Pion

Résumé

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.
Fichier principal
Vignette du fichier
RR.pdf (452.13 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00123259 , version 1 (09-01-2007)
inria-00123259 , version 2 (11-01-2007)

Identifiants

  • HAL Id : inria-00123259 , version 1

Citer

Monique Teillaud, Pedro M. M. de Castro, Sylvain Pion. Exact and efficient computations on circles in CGAL and applications to VLSI design. [Research Report] 2007. ⟨inria-00123259v1⟩
157 Consultations
202 Téléchargements

Partager

More