63 pages

English

Tutorial CGAL

Chion

Le téléchargement nécessite un accès à la bibliothèque YouScribe
Tout savoir sur nos offres

63 pages

English

Le téléchargement nécessite un accès à la bibliothèque YouScribe
Tout savoir sur nos offres

A propos
Informations
Extrait

Description

Getting StartedwithRelease 2.1, December 1999Preface++CGAL is the Computational Geometry Algorithms Library, written in C . It is developped by a consor-tium of seven sites: Utrecht University (The Netherlands), ETH Zurich¨ (Switzerland), Free University ofBerlin (Germany), INRIA Sophia Antipolis (France), Martin Luther-Universit at¨ Halle Wittenberg (Germany),¨Max Planck Institute for Computer Science, Saarbrucken (Germany), RISC Linz (Austria) and Tel AvivUniversity (Israel). More information about the project can be found on the CGAL home page at URLhttp://www.cs.uu.nl/CGAL/.This document is acompanied with a number of example source ﬁles. The example ﬁles mentioned in the textrefer to these source ﬁles. They can be found in the CGAL distribution in the directory examples/Getting started.AuthorsGeert Jan Giezeman, Remco Veltkamp, Wieger WesselinkDepartment of Computer ScienceUtrecht University, The NetherlandsAcknowledgementThis work is supported by the Esprit IV Project No. 21957 (CGAL) and by the Esprit IV Project No. 28155(GALIA).iiiContents1 Introduction 11.1 Overview of CGAL ......................................... 11.2 Robustnes ............................................. 21.3 Generality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21.4 Efﬁciency.............................................. 21.5 Easeofuse ............................................. 21.6 Otherdesigngoals ........... ...

Informations

Publié par	Chion
Nombre de lectures	40
Langue	English

Extrait

Getting

Release

Started

with

2.1,

December

1999

Preface

CGALis the Computational Geometry Algorithms Library, written in C++. It is developped by a consor-tium of seven sites: Utrecht University (The Netherlands), ETH Zu¨ rich (Switzerland), Free University of Berlin (Germany), INRIASophia-Antipolis (France), Martin-Luther-Universita¨t Halle-Wittenberg (Germany), Max-PlanckInstituteforComputerScience,Saarbr¨ucken(Germany),RISCLinz (Austria) and Tel-Aviv University (Israel). More information about the project can be found on the CGALhome page at URL http://www.cs.uu.nl/CGAL/. This document is acompanied with a number of example source les. The example les mentioned in the text refer to these source les. They can be found in the CGALdistribution in the directoryexamples/Getting started.

Authors Geert-Jan Giezeman, Remco Veltkamp, Wieger Wesselink Department of Computer Science Utrecht University, The Netherlands

Acknowledgement This work is supported by the Esprit IV Project No. 21957 (CGAL) and by the Esprit IV Project No. 28155 (GALIA).

Contents 1 Introduction 1 1.1 Overview of CGAL 1. . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Robustness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Generality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.4 Efciency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.5 Ease of use . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.6 Other design goals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Elementaries 5 2.1 Points and Vectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.1 The difference between points and vectors . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Predicates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.1 Orientation of points . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.2 Inside circle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Example: centre of mass . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.4 Naming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3 Arithmetics 11 3.1 Number types and exact arithmetic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 Coordinate representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.3 Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.4 Trade-offs between number types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4 Stepping through 15 4.1 Iterators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.1.1 Example: centre of mass revisited . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.2 Circulators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4.2.1 Example: centre of mass revisited again . . . . . . . . . . . . . . . . . . . . . . . . . . 18 5 Intersections and Boolean operations 21 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 5.2 Bounding boxes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 5.3 Intersection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5.4 Boolean operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 5.5 Example: matching polygons . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 iii

6 Triangulations 29 6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 6.2 Construction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 6.3 Access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 6.4 Putting it all together . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 6.5 Delaunay triangulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 6.6 Using your own point type . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35

7 Convex Hulls 37 7.1 An example program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 7.1.1 Output in a static array . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38

8 Traits classes inCGAL41 8.1 Our problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 8.2 Our own traits class . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 8.3 Implementation of the traits class . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 8.4 The complete program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43

A A Short Introduction to C++47 A.1 The Use of C++ 47. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Classes . A.1.1 Example of a class . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 A.2 Various aspects of C++ 49. . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . A.2.1 Overloading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 A.2.2 Reference parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 A.2.3 New and delete . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 A.2.4 Namespaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 A.2.5 C++style IO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 A.2.6 Templates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 A.3 Lists and Vectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 A.3.1 STL vectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 A.3.2 STL lists . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 A.3.3 Vectors and iterators revisited . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56

Chapter 1

Introduction

The CGALlibrary is a C++library that contains primitives, data structures, and algorithms for computational geometry. The goal of this document is to teach you how to use the CGALlibrary. It contains information about how to use primitives, datastructures, and algorithms, and contains also example programs. This document should be used together with the CGAL downloading and installing C ForReference Manual.GAL, see the CGALInstallation Guide. This chapter gives a short overview of the CGALlibrary. Besides mentioning the purpose and the intended users, this chapter will give you some background information about the project behind CGAL. Chapters 2 to 8 introduce several aspects of the CGALlibrary. This document was written with the assumption that you are familiar with the C++ assist the C-language. To programmer, we have tried to explain some typical C++features in Appendix A. Some C++notions are explained whenever they are encountered. This is done to such an extent that it should be possible to use the library without relying on a C++ really learn the Ctextbook. To++language we recommend an elementary book, for example [Lippman 98].

1.1 Overview ofCGAL Geometric algorithms are used in many application domains. People in areas like computer graphics, robotics, geographic information systems and computer vision are more and more realizing that concepts and algorithms from computational geometry can be of importance for their work. However, implementing these algorithms isn't easy. As a result, many useful geometric algorithms haven't found their way into practice yet. The most common problems are the dissimilarity between fast oating-point arithmetic normally used in practice and exact arithmetic over the real numbers assumed in theoretical papers, the lack of explicit handling of degenerate cases in these papers, and the inherent complexity of many efcient solutions. Therefore, the computational geometry community itself has started to develop a well-designed library: CGAL, the Computational Geometry Algorithms Library. This library is developed by seven institutions: Utrecht University (The Netherlands), ETH Zurich (Switzerland), Free University Berlin (Germany), INRIA Sophia-Antipolis (France), Max Planck Institute Saarbrucken (Germany), RISC Linz (Austria), and Tel Aviv University (Israel). The CGALof different parts. The elementary part of the library (the kernel) consistslibrary contains a number of primitive, constant-size geometric objects (points, lines, spheres, etc.) and predicates on them (orientation test for points, intersection tests, etc.). The next part of the library contains a number of standard geometric algorithms and data structures such as convex hull, smallest enclosing circle, and triangulation. The last part of the library consists of a support library for example for I/O, visualization, and random generators. Currently, the library contains mainly 2 and 3-dimensional objects, but in the future there will also be support for objects of arbitrary dimension. CGALis developed for different groups of users. There are the researchers working in computational geometry itself who want to use the library to more easily implement and test their own algorithms. There are researchers 1

with knowledge of computational geometry who want to use geometric algorithms in application research areas. There are developers working in other research areas and companies who want to use CGALin, possibly com-mercial, applications. All these groups of users have rather different demands. To please all of them, the CGAL library has to fulll a number of design goals. The most important of these are robustness, generality, efciency and ease of use. Of course it isn't easy to combine these in one library. Below we will describe briey what has been done to achieve these goals.

1.2 Robustness Especially in the eld of computational geometry, robustness of a software library is of vital importance. In geometric algorithms many decisions are based on geometric predicates. If these predicates are not computed exactly (for example due to round-off errors), the algorithm may easily give incorrect results. For some al-gorithms, strategies exist to deal with inexact predicates. However, in general this is very difcult to achieve. Therefore, in CGALwe use the following rule: a correct result of an algorithm can only be guaranteed if ge-ometric predicates are evaluated exactly. The most natural way of obtaining exact predicates is to choose an appropriate number type for doing computations. As a consequence of this, in CGALthere is a strong emphasis on the specication of algorithms. It should always be clear for which inputs and for which number types a correct result is guaranteed. Of course the user is always free to use fast but imprecise number types like oats or doubles. This should not cause the algorithm to break down, although it could occasionally lead to incorrect results. The above discussion should be seen separate from dealing with degenerate cases.

1.3 Generality The applications of the CGALwill be very heterogeneous, with very different requirements. Tolibrary make the library as general as possible, C++templates (parameterized data types and functions) are heavily used. This enables the user to choose an appropriate number type for doing computations. For example, if speed is important, computations can be done with oats or doubles. On the other hand, if reliability is more important, computations can be done with arbitrary precision rational numbers. Furthermore, the user can choose the representation type of points (i.e. Cartesian or homogeneous coordinates). And to some extent it is even possible to replace a CGALdata type with a user dened one (see Chapter 8).

1.4 Efciency A computational geometry library must be efcient to be really useful. Whenever possible the most efcient version of an algorithm is used. Clearly, a library algorithm cannot be the best solution for every application. Therefore, sometimes multiple versions of an algorithm are supplied. For example, this will be the case if dealing with degenerate cases is expensive, or when for a specic number type a more efcient algorithm exists (in which case it will be implemented as a C++template specialization). Another (C++level) decision that has been made in favor of efciency is that geometric objects do not share a common base class with virtual methods. However, this can be simulated through the use ofCGAL Object. _

1.5 Ease of use Generality and ease of use are not always easy to combine. The abundant use of templates seems to make the library difcult to use for people who just want to do something simple with it. This problem can be mostly solved by using appropriate C++these typedefs, the use of templates can be effectivelytypedefs. Through hidden to the novice user. In the examples of this document we use a header le containing typedefs for the most commonly used number types and representation types. It is not possible to guarantee that the user will never see templates at all (for example the templates will sometimes become visible in error messages 2

of the compiler or during low level debugging), but the absence of templates on the source code level makes it denitely easier to start using CGAL computational geometry applications is in general very. Developing difcult because of problems with inaccuracies and degeneracies. In CGALthese problems are largely overcome by the strong support for computing with exact number types and the existence of algorithms that can deal with degeneracies. Furthermore, the algorithms in the library contain many pre and postcondition checks. These checks are performed by default, which can be a great help when debugging an application. By setting a compiler ag these checks can be turned off to gain execution speed. To facilitate using CGALwith existing code, CGALtypes and algorithms are placed in namespaceCGALAll macro names, which can not be put in. a namespace, are prexed withCGAL point where the library can make . Anotherthe user's life easier is the consistent use of the iterator concept of the C++Standard Template Library (see also Appendix A).

1.6 Other design goals

Apart from the above mentioned design goals, there are several others that apply to a library like CGALsuch as openness and modularity. More on this can be found in [Fabri & al. 96], [Overmars 96], [Schirra 96], and [Fabri & al. 98].

Chapter 2

Elementaries

2.1 Points and Vectors Example le: examples/Getting started/basic.C Points and vectors are about the most basic elements in geometry. The Hello, Geo program of this document shows some operations that can be done on them. 1#include "tutorial.h" 2#include <CGAL/Point 2.h> _ 3#include <CGAL/Vector 2.h> _ 4#include <iostream> 5 6main() 7{ 8Point p1(1.0, -1.0), p2(4.0, 3.0), p3; 9Vector v1(-1, 10); 10Vector v2(p2-p1); 11v1 = v1 + v2; 12p3 = p2 + v1*2; 13std::cout << "Vector v2 has coordinates: (" 14<< v2.x() <<", "<<v2.y() <<")\n"; 15std::cout << "Point p3 has coordinates: (" 16<< p3.x() <<", "<<p3.y() <<")\n"; 17} When we compile and run the program, the output is: Vector v2 has coordinates: (3, 4) Point p3 has coordinates: (8, 31) Before we have a look at the operations on points and vectors, we consider the structure of the program. First there are include les. The rst include le istutorial.h header le contains some denitions that. This make our example programs easier to read. In Section 3.2 we will show what it contains. Next we include some header les that dene the CGALvectors. As we want to do some output, we also include thepoints and standard C++IO. The order of inclusion sometimes is important in CGAL. We always includetutorial.has the rst le. When we explain the contents of this le, we'll explain why. In line 8, three two-dimensional points are declared. The rst two are initialised with x and y values. The third is not initialised. In the next two lines, two vectors are declared. The rst vector is initialised in the same way as the points. The second vector is initialised with the difference of two points. 5