Team Geometrica

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
J.-D. Boissonnat, M. Teillaud (editors)
Effective Computational Geometry for Curves and Surfaces, Springer-Verlag, 2006
http://www-sop.inria.fr/geometrica/events/book/ECG.html.
[2]
J.-D. Boissonnat, M. Yvinec.
Algorithmic geometry, traduit de la version française (Ediscience international) par Hervé Brönnimann, Cambridge University Press , UK, 1998
http://www-sop.inria.fr/prisme/personnel/yvinec/livre.html.
[3]
H. Brönnimann, C. Burnikel, S. Pion.
Interval arithmetic yields efficient dynamic filters for computational geometry, in: Discrete Applied Mathematics, 2001, vol. 109, p. 25–47
http://hal.inria.fr/inria-00344281/.
[4]
L. Castelli Aleardi.
Représentations compactes de structures de données géométriques, Thèse de doctorat en sciences, École Polytechnique, France, 2006
http://tel.archives-ouvertes.fr/tel-00336188/.
[5]
F. Chazal, D. Cohen-Steiner, A. Lieutier.
A Sampling Theory for Compacts in Euclidean Space, in: Proc. 22th Annual ACM Symposium on Computational Geometry, 2006, p. 319–326.
[6]
D. Cohen-Steiner, P. Alliez, M. Desbrun.
Variational Shape Approximation, in: ACM Transactions on Graphics. Special issue for SIGGRAPH conference, 2004, p. 905–914.
[7]
D. Cohen-Steiner.
Quelques problèmes liés à la discrétisation des surfaces, Thèse de doctorat en sciences, École Polytechnique, France, 2004
http://www.inria.fr/rrrt/tu-1137.html.
[8]
O. Devillers.
The Delaunay hierarchy, in: Internat. J. Found. Comput. Sci., 2002, vol. 13, p. 163–180
http://hal.inria.fr/inria-00166711.
[9]
S. Oudot.
Sampling and Meshing Surfaces with Guarantees, Thèse de doctorat en sciences, Ecole Polytechnique, France, 2005
http://tel.archives-ouvertes.fr/tel-00338378.
[10]
M. Teillaud.
– Géométrie algorithmique – De la théorie à la pratique, Des objets linéaires aux objets courbes. / – Computational geometry – From theory to practice, From linear objects to curved objects., Habilitation à diriger des recherches, Université de Nice Sophia Antipolis, 2007
http://tel.archives-ouvertes.fr/tel-00175997/.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
A. Mebarki.
Implantation de structures de données compactes pour les triangulations, Thèse de doctorat en sciences, Université de Nice-Sophia Antipolis, France, 2008
http://tel.archives-ouvertes.fr/tel-00336178/.
[12]
C. Wormser.
Diagrammes de Voronoï généraux et applications, Thèse de doctorat en sciences, université Nice Sophia-Antipolis, Nice, France, 2008.

Articles in International Peer-Reviewed Journal

[13]
J.-D. Boissonnat, D. Cohen-Steiner, G. Vegter.
Isotopic implicit surface meshing, in: Discrete and Computational Geometry, 2008, vol. 39, p. 138–157.
[14]
J.-D. Boissonnat, C. Wormser, M. Yvinec.
Anisotropic diagrams: the Labelle Shewchuk approach revisited, in: Theoretical Computer Science, 2008, vol. 408
http://hal.inria.fr/inria-00336798/.
[15]
L. Castelli Aleardi, O. Devillers, G. Schaeffer.
Succinct representations of planar maps, in: Theoretical Computer Science, 2008, vol. 408, p. 174-187
http://hal.inria.fr/inria-00337821/.
[16]
F. Chazal, A. Lieutier.
Smooth Manifold Reconstruction from Noisy and Non Uniform Approximation with Guarantees, in: Comp. Geom: Theory and Applications, 2008, vol. 40, p. 156–170.
[17]
D. Cohen-Steiner, H. Edelsbrunner, J. Harer.
Extending Persistence Using Poincaré and Lefschetz Duality, in: Foundations of Computational Mathematics, 2008, vol. on-line
http://www.springerlink.com/content/mm663322257281m1/.
[18]
T. K. Dey, K. Li, J. Sun, D. Cohen-Steiner.
Computing geometry-aware handle and tunnel loops in 3D models, in: ACM Transactions on Graphics, SIGGRAPH '2008 Conference Proceedings, 2008, vol. 27, p. 1–9
http://doi.acm.org/10.1145/1399504.1360644.
[19]
L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, C. Yap.
Classroom Examples of Robustness Problems in Geometric Computations, in: Computational Geometry: Theory and Applications, may 2008, vol. 40, no 1, p. 61-78
http://dx.doi.org/10.1016/j.comgeo.2007.06.003.
[20]
P. Memari, J.-D. Boissonnat.
Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections, in: Computer Graphics Forum, Proceedings of SGP 2008, 2008, vol. 27, p. 1403-1410.
[21]
P. Mullen, Y. Tong, P. Alliez, M. Desbrun.
Spectral Conformal Parameterization, in: Computer Graphics Forum, special issue for EUROGRAPHICS Symposium on Geometry Processing, 2008, vol. 27, p. 1487–1494.

Invited Conferences

[22]
M. Yvinec.
Current trends in Delaunay refinement meshing, in: 17th International Meshing Roundtable Course, Pittsburgh, 2008.

International Peer-Reviewed Conference/Proceedings

[23]
J.-D. Boissonnat, W. Camille, M. Yvinec.
Locally uniform anisotropic meshing, in: Proceedings of the 24th Annual ACM Symposium Computational Geometry, 2008, p. 270–277
http://hal.inria.fr/inria-00275430.
[24]
M. Botsch, M. Pauly, L. Kobbelt, P. Alliez, B. Levy, S. Bischoff, C. Rössl.
Geometric Modeling Based on Polygonal Meshes, in: EUROGRAPHICS Course Notes, 2008.
[25]
M. Caroli, N. Kruithof, M. Teillaud.
Decoupling the CGAL 3D Triangulations from the Underlying Space, in: Workshop on Algorithm Engineering and Experiments, 2008, p. 101–108
http://www.siam.org/proceedings/alenex/2008/alx08_010carolim.pdf.
[26]
M. Caroli, M. Teillaud.
Video: On the Computation of 3D Periodic Triangulations, in: Proceedings of the 24th Annual ACM Symposium on Computational Geometry, 2008, p. 222–223
http://www.computational-geometry.org/SoCG-videos/socg08video/.
[27]
F. Cazals, A. Parameswaran, S. Pion.
Robust Construction of the Three-Dimensional Flow Complex, in: Proceedings of the 24th Annual ACM Symposium Computational Geometry, 2008, p. 182–191.
[28]
F. Chazal, S. Oudot.
Towards Persistence Based Reconstruction in Euclidean Spaces, in: Proc. 24th Annual ACM Symposium on Computational Geometry, 2008, p. 232-241.
[29]
J. Demouth, O. Devillers, M. Glisse, X. Goaoc.
Helly-type theorems for approximate covering, in: Proceedings of the 24th Annual ACM Symposium Computational Geometry, 2008, p. 120–128
http://hal.inria.fr/inria-00331435.
[30]
O. Devillers, J. Erickson, X. Goaoc.
Empty-ellipse graphs, in: Proc. 19th ACM-SIAM Sympos. Discrete Algorithms, 2008, p. 1249–1256
http://hal.inria.fr/inria-00176204.
[31]
O. Devillers, M. Glisse, S. Lazard.
Predicates for Line Transversals to Lines and Line Segments in Three-dimensional Space, in: Proceedings of the 24th Annual ACM Symposium Computational Geometry, 2008, p. 174–181
http://hal.inria.fr/inria-00336256/.
[32]
A. Fabri, E. Fogel, P. Alliez.
CGAL - The Computational Geometry Algorithms Library, in: SIGGRAPH Course Notes, Los Angeles, California, ACM, 2008
http://cel.archives-ouvertes.fr/cel-00340448/.
[33]
J. Gao, L. J. Guibas, S. Oudot, Y. Wang.
Geodesic Delaunay Triangulation and Witness Complex in the Plane, in: Proc. 18th ACM-SIAM Sympos. on Discrete Algorithms, 2008, p. 571–580.
[34]
A. Meyer, S. Pion.
FPG: A code generator for fast and safe geometric predicates, in: Proc. 8th Conference on Real Numbers and Computers, Santiago de Compostela, Spain, 2008, p. 47–60.

Workshops without Proceedings

[35]
A. Bru, M. Teillaud.
Generic Implementation of a Data Structure for 3D Regular Complexes, in: Abstracts 24th European Workshop on Computational Geometry, 2008, p. 95–98.
[36]
M. Caroli, N. Kruithof, M. Teillaud.
Triangulating the 3D periodic space, in: Abstracts 24th European Workshop on Computational Geometry, 2008, p. 229–232
ftp://ftp-sop.inria.fr/geometrica/teillaud/periodic_EuroCG08.pdf.

Books or Proceedings Editing

[37]
P. Alliez, S. Rusinkiewicz (editors)
Proceedings of the 6th Symposium on Geometry Processing, Eurographics and ACM/SIGGRAPH, July 2-4 2008.
[38]
M. Teillaud (editor)
Proceedings of the 24th Annual Symposium on Computational Geometry, ACM, June 9-11 2008
http://portal.acm.org/toc.cfm?id=1377676.

Internal Reports

[39]
O. Aichholzer, F. Aurenhammer, O. Devillers, T. Hackl, M. Teillaud, B. Vogtenhuber.
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem, Research Report, INRIA, 2008, no 6748
http://hal.inria.fr/inria-00343651.
[40]
N. Amenta, D. Attali, O. Devillers.
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron, Research Report, INRIA, 2008, no 6522
http://hal.inria.fr/inria-00277899.
[41]
V. H. F. Batista, D. L. Millman, S. Pion, J. Singler.
Parallel Geometric Algorithms for Multi-Core Computers, Research Report, INRIA, 2008, no 6749
http://hal.inria.fr/inria-00343804/.
[42]
F. Chazal, D. Cohen-Steiner, L. J. Guibas, S. Oudot.
The Stability of Persistence Diagrams Revisited, Research Report, INRIA, 2008, no 6568
http://hal.inria.fr/inria-00292566.
[43]
F. Chazal, L. J. Guibas, S. Oudot, P. Skraba.
Analysis of Scalar Fields over Point Cloud Data, Research Report, INRIA, 2008, no 6576
http://hal.inria.fr/inria-00294591.
[44]
F. Chazal, S. Oudot.
Towards Persistence-Based Reconstruction in Euclidean Spaces, Research Report, INRIA, 2008, no 6391
http://hal.inria.fr/inria-00197543/.
[45]
P. M. M. de Castro, O. Devillers.
Delaunay Triangulations for Moving Points, Research Report, INRIA, 2008, no 6750
http://hal.inria.fr/inria-00344053/.
[46]
P. M. M. de Castro, M. Teillaud.
CGAL 3D Spherical Kernel, Technical Report, INRIA, 2008, no ACS-TR-363605-02.
[47]
O. Devillers.
Géométrie algorithmique et réseaux, Research Report, INRIA, 2008, no 6514
http://hal.inria.fr/inria-00275272.
[48]
O. Devillers, P. M. M. de Castro.
State of the Art: Updating Delaunay Triangulations for Moving Points, Research Report, INRIA, 2008, no 6665
http://hal.inria.fr/inria-00325816.
[49]
A. Gupta, P. Alliez, S. Pion.
Principal Component Analysis in CGAL, Research Report, INRIA, 2008, no 6642
http://hal.inria.fr/inria-00327027.
[50]
S. Hornus, J.-D. Boissonnat.
Efficient construction of the Delaunay triangulation in medium dimension, Research Report, INRIA, 2008, no 6743
http://hal.inria.fr/inria-00343188.
[51]
G. Melquiond, S. Pion.
Directed Rounding Arithmetic Operations in C++, Research Report, INRIA, 2008, no 6757
http://hal.inria.fr/inria-00345094/.

previous
next