Monique Teillaud
Monique Teillaud
INRIA Nancy - Grand Est, LORIA
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Triangulations in CGAL
JD Boissonnat, O Devillers, M Teillaud, M Yvinec
16th Annual Symposium on Computational geometry, 11-18, 2000
Walking in a triangulation
O Devillers, S Pion, M Teillaud
17th Annual Symposium on Computational geometry, 106-114, 2001
On the randomized construction of the Delaunay tree
JD Boissonnat, M Teillaud
Theoretical Computer Science 112 (2), 339-354, 1993
Applications of Random Sampling to On-line Algorithms in Computational Geometry
JD Boissonnat, O Devillers, R Schott, M Teillaud, M Yvinec
Discrete & Computational Geometry, 1992
Effective computational geometry for curves and surfaces
JD Boissonnat, M Teillaud
Springer Verlag (Mathematics & visualization), 2007
A hierarchical representation of objects: the Delaunay tree
JD Boissonnat, M Teillaud
2nd Annual Symposium on Computational geometry, 260-268, 1986
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
O Devillers, S Meiser, M Teillaud
Computational Geometry 2 (2), 55-80, 1992
Alpha, Betti and the megaparsec universe: on the topology of the cosmic web
R Van De Weygaert, G Vegter, H Edelsbrunner, BJT Jones, P Pranav, ...
Transactions on Computational Science XIV, 60-101, 2011
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
JD Boissonnat, O Devillers, M Teillaud
Algorithmica 9, 329-356, 1993
Towards an open curved kernel
IZ Emiris, A Kakargias, S Pion, M Teillaud, EP Tsigaridas
20th Annual Aymposium on Computational geometry, 438-446, 2004
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
O Devillers, A Fronville, B Mourrain, M Teillaud
16th Annual Symposium on Computational geometry, 139-147, 2000
Perturbations and vertex removal in a 3D Delaunay triangulation
O Devillers, M Teillaud
14th Annual ACM-SIAM Symposium on Discrete algorithms, 313-319, 2003
3D triangulations
S Pion, M Teillaud
CGAL Editorial Board, editor, CGAL User and Reference Manual, 2001
On the computation of an arrangement of quadrics in 3d
B Mourrain, JP Técourt, M Teillaud
Computational Geometry 30 (2), 145-164, 2005
On the absolute quadratic complex and its application to autocalibration
J Ponce, K McHenry, T Papadopoulo, M Teillaud, B Triggs
2005 IEEE Computer Society Conference on Computer Vision and Pattern …, 2005
Computing the maximum overlap of two convex polygons under translations
M De Berg, O Cheong, O Devillers, M Van Kreveld, M Teillaud
Theory of computing systems 31 (5), 613-628, 1998
3D triangulations
C Jamin, S Pion, M Teillaud
CGAL user and reference manual 4 (1), 2018
Splitting a Delaunay triangulation in linear time
Chazelle, Devillers, Hurtado, Mora, Sacristan, Teillaud
Algorithmica 34, 39-46, 2002
Robust and efficient Delaunay triangulations of points on or close to a sphere
M Caroli, PMM de Castro, S Loriot, O Rouiller, M Teillaud, C Wormser
9th International Symposium on Experimental Algorithms, 462-473, 2010
Perturbations for Delaunay and weighted Delaunay 3D triangulations
O Devillers, M Teillaud
Computational Geometry 44 (3), 160-168, 2011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20