Skip to Main content Skip to Navigation
Conference papers

Exact and efficient computations on circles in CGAL

Pedro de Castro 1 Sylvain Pion 1 Monique Teillaud 2
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
2 GEOMETRICA - Geometric computing
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 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download


https://hal.inria.fr/hal-02196933
Contributor : Monique Teillaud <>
Submitted on : Monday, July 29, 2019 - 5:25:31 PM
Last modification on : Tuesday, December 3, 2019 - 4:26:49 PM

Identifiers

  • HAL Id : hal-02196933, version 1

Collections

Citation

Pedro 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⟩

Share

Metrics

Record views

24

Files downloads

385