Direction des Relations Européennes et Internationales (DREI)

Programme INRIA "Equipes Associées"

 

I. DEFINITION

EQUIPE ASSOCIEE

GENEPI

sélectionnée en

2004

Projet INRIA : GEOMETRICA

Organisme étranger partenaire 1 : Polytechnic University Brooklyn

Organisme étranger partenaire 2 : New York University

Unité de recherche INRIA : Sophia Antipolis
Thème INRIA : Sym B

Pays : États-Unis

Pays : États-Unis

 

 

Coordinateur français

Coordinateur étranger 1

Coordinateur étranger 2

Nom, prénom

Pion, Sylvain

Brönnimann, Hervé

Yap, Chee

Grade/statut

Chargé de recherche

Assistant professor

Professor

Organisme d'appartenance

INRIA Sophia Antipolis, Projet GEOMETRICA

Polytechnic University Brooklyn, Computer and Information Science Department

Courant Institute of Mathematical Sciences, New York University

Adresse postale

2004 Route des Lucioles - BP 93 FR-06902 Sophia Antipolis

6 MetroTech Center Brooklyn, NY 11201, New York, USA

251 Mercer Street, New York, NY 10012, New York, USA

URL

http://www-sop.inria.fr/geometrica/collaborations/genepi/

http://geometry.poly.edu/genepi/

http://www.cs.nyu.edu/cs/faculty/yap/

Téléphone

+33 4 92 38 50 25

+01 (718) 260 3538

+01 (212) 998 3115

Télécopie

+33 4 92 38 76 43

+01 (718) 260 3609

+01 (212) 995 4121

Courriel

Sylvain.Pion@sophia.inria.fr

hbr@poly.edu

yap@cs.nyu.edu


La proposition en bref

Mots-clés : Generic geometric algorithms, generic interfaces to graph data structures, geometric kernels, curved objects, non-robustness issues, CGAL

Thématique de la collaboration : Our work is centered on various problems that arise during the implementation of computational geometric algorithms : the genericity aspects of algorithms, and the robustness aspects. These research themes are heavily connected to the work on CGAL.

Generic programming of geometric algorithms : interfaces to the geometry and to the data structures. (collaboration mostly with H. Brönnimann) The first kind of problems is linked to the definition of interfaces (APIs) between the combinatorial and central parts of algorithms and the geometric objects that they manipulate. In order to have generic and re-usable implementations of such algorithms, we parameterize them by kernels which provide the geometry part. The problems that we work on are the definitions of the mathematical concepts corresponding to the different categories of geometry that each algorithm can handle. The goals here are to try to maximize the usability of generic algorithms, and to introduce concepts that facilitate their documentation.
The other aspect of genericity is the interface between the concrete memory storage of the data structures (such as polyhedral surfaces, triangulations...), and the algorithms that manipulate them (point location, meshers...). The idea here is to be able to apply generic algorithms on different concrete data structures providing a common interface. We plan to extend the work done by H. Brönnimann on the Halfedge Data Structure and in the Boost Graph Library to the structures of interest to CGAL, namely the 2D-3D triangulations and simplicial complexes.

Robust handling of curved objects. (collaboration mostly with C. Yap) The second aspect of the work concerns the non-robustness issues that are well-known to cause problems to computational geometry algorithms. In the past, we have developed several methods to handle these issues, and we plan to extend them to curved objects, beginning with low degree algebraic objects. More specifically, we plan to investigate the use of algebraic techniques introduced in the CORE library, and interface it with the CGAL curved kernel currently under development. A somewhat new direction in our collaboration is to address the numerical/parametric view of algebraic curves and surfaces. Until now, researchers in computational geometry have emphasized the purely algebraic view of curves and surfaces. But in practice, the numerical/parametric view is dominant. However the robustness issues here are mostly open. A new paper by one of the participants (Yap) has started to open up this line of investigation.

 

Présentation de l'Équipe Associée

1. Présentation du coordinateur étranger

Hervé Brönnimann is Assistant Professor at the Polytechnic University Brooklyn, New York, USA. He has published several papers on all aspects of geometric computing in international journals, including on theoretical topics such as derandomization of geometric algorithms (the topic of his Ph.D. thesis) and practical topics as arithmetic filters for geometric computing. He graduated from École Normale Supérieure of Paris before completing his Ph.D. in Computer Science at Princeton University in 1995. He held a permanent research position in the PRISME project at INRIA from 1995 to 1998. His research interests include analysis and design of algorithms, with a focus on geometric algorithms. At INRIA, he was a collaborator in CGAL, where he was involved with maintaining a large portion of the geometry kernel. At Poly, he spearheaded the effort that led to the Boost Interval Arithmetic Library. More recently, he became interested in applying results in deterministic sampling and data stream techniques to data mining and network forensics. Again, he is interested there in theoretically efficient yet highly practical algorithms, and their implementation.

Chee Keng Yap is Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University. He has published over 130 papers in major conferences and journals, in the area of algorithms and complexity. His research interests include computational geometry, visualization problems, computer algebra, and algorithmic robotics. Since 1993, he has been interested in numerical non-robustness, especially issues at the interface between numerical, algebraic and topological computation. A current project called the Core Library aims to bring robust computation out of the research realm and make it widely accessible to all programmers. Yap was born in Singapore and educated in the Boys' Wing, Royal Military College in Malaysia. He received a double S.B. degree (Math and Comp.Sci.) from MIT in 1975 and a Ph.D. (Comp.Sci.) from Yale in 1980. He served on the editorial boards of SIAM J. of Computing (1985-2002), J. of Symbolic Computation (1988--2003), J. of Computer and System Sciences (1986--), Computational Geometry: Theory and Applications (1990--), Int'l J. of Comp. Geometry and Applications (1990--), and Algorithmica (1992--). His two books are the edited volume Advances in Robotics: Algorithmic and Geometric Issues (Lawrence Erlbaum Associates, Inc, 1987) (co-edited with Jack Schwartz) and Fundamental Problems in Algorithmic Algebra (Oxford University Press, 2000).

2. Historique de la collaboration

3. Impact :




II. BILAN 2007

The assessment of this fourth year of the associated team is overall positive. We have not performed exactly all planned visits, but more longer term visits of our partner's students have been encouraged thanks to the REUSSI program. Moreover, our collaborator Chee Yap came and visit us instead of us going to NYU (using the opportunity of a workshop organized in Sophia).

Rapport scientifique pour l'année 2007

The work during the year has been organized around several visits : Jihun Yu (2nd year PhD student of C. Yap) and Dave Milmann (Master student of C. Yap, now starting a PhD at UNC Chapel Hill) visiting Sophia for 2-months internship stays. Jihun Yu worked on the C++ standardization of interval arithmetic, more precisely on providing an implementation of the current proposal, using Boost.Interval and CRLIBM/MPFR (collaboration with Guillaume Melquiond who visited us one week in Sophia). Dave worked on a new topic, namely the parallelization of some algorithms in CGAL. He started with the case of the 3D Delaunay triangulation generation, using OpenMP. The results of both students are excellent, although works remains to be done to complete them. Finally, C. Yap visited us a couple of days in Sophia, where he was part of the HDR jury of Monique Teillaud, and where he was invited to give a talk at the Workshop on Robust Shape Operations (WRSO).

H. Brönnimann continues to work at Bloomberg for another year, hence the collaboration will be slowed down during this period on this side. Together with G. Melquiond of ARENAIRE, we have further worked on our proposal for standardization of interval arithmetic in the C++ standard, and we have issued a second revision and are working on a third, as well as produced a separate proposal specifying the interface for multi-valued logic (named bool_set), which is critical for the use of interval comparisons.

Rapport financier 2007

1. Dépenses EA (effectuées sur les crédits de l'équipe associée)

 

Budget EA alloué

Montant dépensé

Accueil

1000

2500

Missions

3000

1500

Total

(a) 4000

(b) 4000

Taux d'utilisation des crédits EA alloués (b/a %)

100.00%

 

2. Dépenses externes (soutenues par des financements hors EA)

Total des financements externes

alloués : (c) 3000

dépensés : 3000

Total des financements EA et externes

alloués : (d) 7000

dépensés : 7000


Taux de co-financement (c /d %)

43.00%


Bilan des échanges effectués en 2007


1. Seniors

Nom

statut

provenance

destination

objet

durée (en semaines)

Coût (EA)

Coût (externe)

Yap

Professor

New York

INRIA Sophia

Visit

1

1000

1500

Melquiond

Post-Doc

INRIA Futurs

INRIA Sophia

Visit

1

500

0


Total des durées en semaines

2


2. Juniors

Nom

statut

provenance

destination

objet

durée (en mois)

Coût (EA)

Coût (externe)

Milmann

Master student

NYU

Sophia

visit

2

1250

1500

Yu

PhD student

NYU

Sophia

visit

2

1250

1500


Total des durées en mois

4





III. PREVISIONS 2008

Programme de travail

The long term view is that our work is centered on the various problems that arise during the implementation of computational geometric algorithms, especially from the non-robustness point of view, and in the generic programming setting, such as the one found in CGAL. We plan to make significant contributions to CGAL. The two main topics are described in the introduction of this associated team. We now focus more on some topics that arised in studying the robust implementation of geometric algorithms. The planned work for 2008 is mostly a continuation of what was already started. Note that this year corresponds to the third (and probably last) year of the REUSSI program between INRIA and NSF. It is therefore especially important to obtain the funding from the INRIA side to match the US contribution.

Standardization of Interval Arithmetic in C++. We will continue the work on this proposal, since there is strong interest on both sides. C. Yap is interested in having an implementation to be used as part of his CORE library project for exact computing. Note that the interval arithmetic proposal also includes non-algebraic functions, which is something new in the CORE library. This also makes use of the MPFR library developed at INRIA Nancy. We anticipate that a strong moment in 2008 will be connected to the ISO C++ standardization meeting that we are organizing at INRIA in June. We will probably try to dedicate a sub-meeting to this interval arithmetic work.

We will also choose other topics in time, depending on which students are planned to come in the summer. Continuing the work on parallelization of geometric algorithms is a serious candidate, the other one being the study of the impact of the coming concepts (a new language feature) in the next C++ standard on the CGAL kernel.


Budget prévisionnel 2008

1. Co-financement

This collaboration benefits from the REUSSI NSF-INRIA program which provides partial funding for stays of 3 US students at INRIA.

ESTIMATION PROSPECTIVE DES CO-FINANCEMENTS

Organisme

Montant

NSF-INRIA REUSSI

3000

Total

3000



2. Echanges

Planned visits from New York to Sophia Antipolis :

Planned visits from Sophia Antipolis to New York :


ESTIMATION DES DÉPENSES

Montant

 

Nombre

Accueil

Missions

Total

Chercheurs confirmés

2


4000

4000

Post-doctorants





Doctorants





Stagiaires

3

4000


4000

Autre (précisez) :





Total

5

4000

4000

8000

 

 

- total des co-financements

3000

 

 

Financement "Équipe Associée" demandé

5000

 

© INRIA - mise à jour le 19/10/2007