Project Team Geometrica

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
PDF e-pub XML


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]
P. Alliez, D. Cohen-Steiner, M. Yvinec, M. Desbrun.
Variational tetrahedral meshing, in: ACM Transactions on Graphics, 2005, vol. 24, p. 617–625, SIGGRAPH '2005 Conference Proceedings.
http://hal.inria.fr/inria-00226418
[3]
N. Amenta, D. Attali, O. Devillers.
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra, in: Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 2007, p. 1106–1113.
http://hal.inria.fr/inria-00182835/
[4]
J.-D. Boissonnat, S. Oudot.
Provably good sampling and meshing of surfaces, in: Graphical Models, 2005, vol. 67, p. 405–451.
http://hal.archives-ouvertes.fr/hal-00488829/en/
[5]
J.-D. Boissonnat, C. Wormser, M. Yvinec.
Anisotropic diagrams: the Labelle Shewchuk approach revisited, in: Theoretical Computer Science, 2008, vol. 408, p. 163–173.
http://hal.inria.fr/inria-00336798/
[6]
M. Botsch, L. Kobbelt, M. Pauly, P. Alliez, B. Lévy.
Polygon Mesh Processing, AK Peters, 2010.
http://hal.inria.fr/inria-00538098
[7]
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/
[8]
F. Chazal, D. Cohen-Steiner, M. Glisse, L. J. Guibas, S. Oudot.
Proximity of Persistence Modules and Their Diagrams, in: Proc. 25th Annual Symposium on Computational Geometry, 2009, p. 237–246. [ DOI : 10.1145/1542362.1542407 ]
http://hal.inria.fr/inria-00292566/
[9]
F. Chazal, D. Cohen-Steiner, A. Lieutier.
A Sampling Theory for Compact Sets in Euclidean Space, in: Discrete Comput. Geom., 2009, vol. 41, no 3, p. 461–479.
http://dx.doi.org/10.1007/s00454-009-9144-8
[10]
Q. Mérigot.
Détection de structures géométriques dans les nuages de points, Université Nice Sophia Antipolis, Nice, France, 2009.
http://tel.archives-ouvertes.fr/tel-00443038/fr/
[11]
Y. Tong, P. Alliez, D. Cohen-Steiner, M. Desbrun.
Designing Quadrangulations with Discrete Harmonic Forms, in: Proc. 3rd Annu. Sympos. Geometry Processing, 2006, p. 201–210.
ftp://ftp-sop.inria.fr/geometrica/alliez/tacd06.pdf
Publications of the year

Articles in International Peer-Reviewed Journal

[12]
G. Biau, F. Chazal, D. Cohen-Steiner, L. Devroye, C. Rodriguez.
A Weighted k-Nearest Neighbor Density Estimate for Geometric Inference, in: Electronic Journal of Statistics, 2011, vol. 5, p. 204–237.
http://dx.doi.org/10.1214/11-EJS606
[13]
J.-D. Boissonnat, A. Ghosh.
Triangulating Smooth Submanifolds with Light Scaffolding, in: Mathematics in Computer Science, 2011, vol. 4, no 4, p. 431–462.
http://hal.inria.fr/inria-00604058/en/
[14]
C. Caillerie, F. Chazal, J. Dedecker, B. Michel.
Deconvolution for the Wasserstein metric and geometric inference, in: Electronic Journal of Statistics, 2011, vol. 5, p. 1394–1423.
http://dx.doi.org/10.1214/11-EJS646
[15]
L. Castelli Aleardi, O. Devillers, A. Mebarki.
Catalog Based Representation of 2D triangulations, in: Internat. J. Comput. Geom. Appl., 2011, vol. 21, p. 393–402. [ DOI : 10.1142/S021819591100372X ]
http://hal.inria.fr/inria-00560400
[16]
F. Cazals, D. Cohen-Steiner.
Reconstructing 3D compact sets, in: Computational Geometry Theory and Applications, 2011, vol. 45, no 1-2, p. 1–13.
http://dx.doi.org/10.1016/j.comgeo.2011.07.005
[17]
F. Chazal, D. Cohen-Steiner, Q. Mérigot.
Geometric Inference for Probability Measures, in: Journal on Foundations of Computational Mathematics, 2011, vol. 11, no 6, p. 733–751.
http://dx.doi.org/10.1007/s10208-011-9098-0
[18]
F. Chazal, L. J. Guibas, S. Oudot, P. Skraba.
Scalar Field Analysis over Point Cloud Data, in: Discrete and Computational Geometry, 2011, vol. 46, no 4, p. 743–775.
http://dx.doi.org/10.1007/s00454-011-9360-x
[19]
O. Cheong, H. Everett, M. Glisse, J. Gudmundsson, S. Hornus, S. Lazard, M. Lee, H.-S. Na.
Farthest-Polygon Voronoi Diagrams, in: Computational Geometry, Theory and Applications, May 2011, vol. 44, no 4, p. 234–247. [ DOI : 10.1016/j.comgeo.2010.11.004 ]
http://hal.inria.fr/inria-00442816/
[20]
O. Devillers.
Delaunay Triangulation of Imprecise Points: Preprocess and Actually Get a Fast Query Time, in: Journal of Computational Geometry, 2011, vol. 2, p. 30–45.
http://jocg.org/index.php/jocg/article/view/41
[21]
O. Devillers.
Vertex Removal in Two Dimensional Delaunay Triangulation: Speed-up by Low Degrees Optimization, in: Computational Geometry: Theory and Applications, 2011, vol. 44, p. 169–177. [ DOI : 10.1016/j.comgeo.2010.10.001 ]
http://hal.inria.fr/inria-00560379/
[22]
O. Devillers, M. Teillaud.
Perturbations for Delaunay and weighted Delaunay 3D Triangulations, in: Computational Geometry: Theory and Applications, 2011, vol. 44, p. 160–168. [ DOI : 10.1016/j.comgeo.2010.09.010 ]
http://hal.archives-ouvertes.fr/inria-00560388/
[23]
S. Pion, A. Fabri.
A Generic Lazy Evaluation Scheme for Exact Geometric Computations, in: Science of Computer Programming, April 2011, vol. 76, no 4, p. 307–323, Special Issue on Library-Centric Software Design (LCSD 2006). [ DOI : 10.1016/j.scico.2010.09.003 ]
http://hal.inria.fr/inria-00562300/
[24]
P. M. M. de Castro, O. Devillers.
On the Size of Some Trees Embedded in d , in: Operations Research Letters, 2011.
http://hal.archives-ouvertes.fr/inria-00448335/
[25]
F. de Goes, D. Cohen-Steiner, P. Alliez, M. Desbrun.
An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes, in: Computer Graphics Forum, 2011, vol. 30, no 5, p. 1593–1602, Special issue for EUROGRAPHICS Symposium on Geometry Processing.
http://dx.doi.org/10.1111/j.1467-8659.2011.02033.x

International Conferences with Proceedings

[26]
M. Aanjaneya, F. Chazal, D. Chen, M. Glisse, L. J. Guibas, D. Morozov.
Metric Graph Reconstruction from Noisy Data, in: Proc. 27th Annual Symposium on Computational Geometry, 2011, p. 37–46. [ DOI : 10.1145/1998196.1998203 ]
http://hal.inria.fr/inria-00630774/
[27]
M. Caroli, M. Teillaud.
Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds, in: Proc. 27th Annual Symposium on Computational Geometry, 2011, p. 274–282.
http://doi.acm.org/10.1145/1998196.1998236
[28]
F. Chazal, D. Chen, L. J. Guibas, X. Jiang, C. Sommer.
Data-Driven Trajectory Smoothing, in: Proceedings of the 19th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS '11, 2011.
http://hal.inria.fr/inria-00636144
[29]
F. Chazal, L. J. Guibas, S. Oudot, P. Skraba.
Persistence-Based Clustering in Riemannian Manifolds, in: Proc. 27th Annual Symposium on Computational Geometry, 2011, p. 97–106.
http://doi.acm.org/10.1145/1998196.1998212
[30]
N. Milosavljevic, D. Morozov, P. Skraba.
Zigzag Persistent Homology in Matrix Multiplication Time, in: Proc. 27th Annual Symposium on Computational Geometry, 2011, p. 216–225.
http://doi.acm.org/10.1145/1998196.1998229
[31]
B. Pellenard, P. Alliez, J.-M. Morvan.
Isotropic 2D Quadrangle Meshing with Size and Orientation Control, in: Proceedings of the International Meshing Roundtable, 2011, p. 81–98.
[32]
P. M. M. de Castro, O. Devillers.
A Pedagogic JavaScript Program for Point Location Strategies, in: Video of 27th Annual Symposium on Computational Geometry, 2011, p. 295–296.
http://www.computational-geometry.org/SoCG-videos/socg11video/
[33]
P. M. M. de Castro, O. Devillers.
Simple and Efficient Distribution-Sensitive Point Location, in Triangulations, in: Workshop on Algorithm Engineering and Experiments, 2011, p. 127–138.
http://www.siam.org/proceedings/alenex/2011/alenex11.php

Conferences without Proceedings

[34]
M. Bogdanov, O. Devillers, M. Teillaud.
Hyperbolic Delaunay triangulations and Voronoi diagrams made practical, in: Abstracts XIV Spanish Meeting on Computational Geometry, 2011, p. 113–116.
http://www2.uah.es/egc2011/files/ActasEGC2011.pdf
[35]
L. Castelli Aleardi, O. Devillers.
Explicit array-based compact data structures for planar and surface meshes, in: Abstracts XIV Spanish Meeting on Computational Geometry, 2011, p. 237–240.
http://www2.uah.es/egc2011/files/ActasEGC2011.pdf
[36]
O. Devillers.
Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time, in: Abstracts XIV Spanish Meeting on Computational Geometry, 2011, p. 105–108.
http://www2.uah.es/egc2011/files/ActasEGC2011.pdf
[37]
A. Fabri, M. Teillaud.
CGAL, The Computational Geometry Algorithms Library, in: 10ème Colloque National en Calcul des Structures, 2011.

Scientific Books (or Scientific Book chapters)

[38]
P. Alliez, L. Rineau, S. Tayeb, J. Tournois, M. Yvinec.
3D Mesh Generation, in: CGAL User and Reference Manual, CGAL Editorial Board, 2011.
http://www.cgal.org/Manual/3.8/doc_html/cgal_manual/packages.html#Pkg:Mesh_3
[39]
C. Delage, O. Devillers.
Spatial Sorting, in: CGAL User and Reference Manual, CGAL Editorial Board, 2011.
http://www.cgal.org/Manual/3.9/doc_html/cgal_manual/packages.html#Pkg:SpatialSorting
[40]
O. Devillers, S. Hert, M. Hoffmann, L. Kettner, S. Schönherr.
Geometric Object Generators, in: CGAL User and Reference Manual, CGAL Editorial Board, 2011.
http://www.cgal.org/Manual/3.9/doc_html/cgal_manual/packages.html#Pkg:Generators
[41]
R. van de Weygaert, G. Vegter, H. Edelsbrunner, B. J. Jones, P. Pranav, C. Park, W. A. Hellwing, B. Eldering, N. Kruithof, E. P. Bos, J. Hidding, J. Feldbrugge, E. ten Have, M. van Engelen, M. Caroli, M. Teillaud.
Alpha, Betti and the Megaparsec Universe: on the Homology and Topology of the Cosmic Web, in: Transactions on Computational Science XIV, Lecture Notes in Computer Science, Springer-Verlag, 2011, vol. 6970, p. 60–101.
http://www.springerlink.com/content/334357373166n902/

Books or Proceedings Editing

[42]
P. K. Agarwal, K. Mehlhorn, M. Teillaud (editors)
Computational Geometry (Dagstuhl Seminar), Dagstuhl Reports, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2011, no 11111. [ DOI : 10.4230/DagRep.1.3.19 ]
http://drops.dagstuhl.de/opus/volltexte/2011/3199

Internal Reports

[43]
J.-D. Boissonnat, R. Dyer, A. Ghosh, S. Oudot.
Equating the witness and restricted Delaunay complexes, European Commission, 2011, no CGL-TR-24.
http://cgl.uni-jena.de/Publications/WebHome
[44]
J.-D. Boissonnat, A. Ghosh.
Manifold reconstruction using Tangential Delaunay Complexes, INRIA, 2011, no 7142, version 2.
http://hal.archives-ouvertes.fr/inria-00440337/
[45]
J.-D. Boissonnat, A. Ghosh.
Triangulating Smooth Submanifolds with Light Scaffolding, INRIA, 2011, no 7660, version 2.
http://hal.inria.fr/inria-00604058/en/
[46]
J.-D. Boissonnat, C. Wormser, M. Yvinec.
Anisotropic Delaunay Mesh Generation, INRIA, August 2011, no 7712.
http://hal.inria.fr/inria-00615486/en/
[47]
L. Castelli Aleardi, O. Devillers.
Explicit array-based compact data structures for triangulations, INRIA, 2011, no 7736.
http://hal.archives-ouvertes.fr/inria-00623762/
[48]
R. van de Weygaert, P. Pranav, B. J. Jones, E. P. Bos, G. Vegter, H. Edelsbrunner, M. Teillaud, W. A. Hellwing, C. Park, J. Hidding, M. Wintraecken.
Probing Dark Energy with Alpha Shapes and Betti Numbers, arXiv, 2011.
http://arxiv.org/abs/1110.5528
References in notes
[49]
M. Caroli, M. Teillaud.
Computing 3D Periodic Triangulations, in: European Symposium on Algorithms, Lecture Notes in Computer Science, 2009, vol. 5757, p. 37–48.
http://www.springerlink.com/content/55415144316j214g/fulltext.pdf
[50]
M. Caroli, M. Teillaud.
3D Periodic Triangulations, in: CGAL User and Reference Manual, CGAL Editorial Board (editor), 2009-2011.
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/packages.html#Pkg:Periodic3Triangulation3