Exact and efficient computations on circles in CGAL - Archive ouverte HAL Access content directly
Conference Papers Year :

Exact and efficient computations on circles in CGAL

(1) , (1) , (2)
1
2
Pedro M. M. de Castro
  • Function : Author
  • PersonId : 855158
Sylvain Pion
Monique Teillaud

Abstract

CGAL (Computational Geometry Algorithms Library) is a large collection of geometric objects, data structures and algorithms. CGAL currently offers functionalities mostly 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
teillaud.pdf (380.08 Ko) Télécharger le fichier
Vignette du fichier
vignette.png (16.21 Ko) Télécharger le fichier
Vignette du fichier
vignette.pdf (111.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

hal-02196933 , version 1 (29-07-2019)

Identifiers

  • HAL Id : hal-02196933 , version 1

Cite

Pedro M. M. de Castro, Sylvain Pion, Monique Teillaud. Exact and efficient computations on circles in CGAL. 23rd European Workshop on Computational Geometry, 2007, Graz, Austria. ⟨hal-02196933⟩

Collections

INRIA INRIA2
19 View
78 Download

Share

Gmail Facebook Twitter LinkedIn More