, Construction du diagramme de Delaunay dans le plan en utilisant les mélanges de tris, 1996.
, Voronoi diagrams---a survey of a fundamental geometric data structure, ACM Computing Surveys, vol.23, issue.3, pp.345-405, 1991.
DOI : 10.1145/116873.116880
, A polyhedron representation for Computer Vision, National Computer Conference, pp.589-596, 1975.
, Multidimensional binary search trees used for associated searching, Communications of the ACM, vol.18, pp.509-517, 1975.
, Time bounds for selection, Journal of Computer and System Sciences, vol.7, issue.4, pp.448-461, 1973.
DOI : 10.1016/S0022-0000(73)80033-9
, IntroductionàIntroduction`Introductionà l’algorithmique . Traduction de X, 1994.
, Un code pour les graphes planaires et ses applications, Astérisque, p.27, 1975.
, A faster divide-and-conquer algorithm for constructing delaunay triangulations, Algorithmica, vol.21, issue.1-4, pp.137-151, 1987.
DOI : 10.1007/BF01840356
, Higher-Dimensional Voronoi Diagrams in Linear Expected Time, Discrete Comput. Geom, vol.6, pp.343-367, 1991.
, Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams, ACM Transactions on Graphics, vol.4, pp.74-123, 1985.
, Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching. The Visual Computer, pp.236-249, 1987.
, Constructing Delaunay triangulations by merging buckets in quadtree order, Annales Societatis mathematicae Polonae, Series IV, Fundamenta Informaticae, vol.11, pp.275-288, 1988.
, Two algorithms for constructing a Delaunay triangulation, International Journal of Computer and Information Sciences, vol.9, pp.219-242, 1980.
, Delaunay triangulation and the convex hull of n points in expected linear time, BIT, vol.24, pp.151-163, 1984.
, Construction des diagrammes de Delaunay dans le plan et dans l'espace. Th ese de l, 1996.
, Construction du diagramme de Delaunay dans le plan en utilisant les m elanges de tris, Quatri emes Journ ees de l'AFIG, p.2155223, 1996.
, Construction du diagramme de Delaunay dans le plan en utilisant les m elanges de tris. propos e a Revue internationale de CFAO et d'informatique graphique, Herm es, 1997.
, An information organization algorithm, Doklady Akad. Nauk SSSR, p.2633266, 1962.
, The probabilistic method, 1993.
, Evaluation of a new method to compute signs of determinants, Proceedings of the eleventh annual symposium on Computational geometry , SCG '95, 1995.
DOI : 10.1145/220279.220329
URL : https://hal.archives-ouvertes.fr/hal-01179456
, The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software, vol.22, issue.4, 1993.
DOI : 10.1145/235815.235821
, A marching method for parametric surface/surface intersection, BIBLIOGRAPHIE 111 B.G. Baumgart. A polyhedron representation for Computer Vision. In National Computer Conference, pp.2577280-5899596, 1975.
DOI : 10.1016/0167-8396(90)90035-P
, Dynamic Point Location in General Subdivisions, Journal of Algorithms, vol.17, issue.3, p.3422380, 1994.
DOI : 10.1006/jagm.1994.1040
, El ements d'algorithmique, p.463, 1992.
, A lazy solution to imprecision in Computational Geometry, Proc. 5th Canad. Conf, p.73378, 1993.
, A lazy arithmetic library, Proc. of the IEEE 11th Symposium on Computer Arithmetic, 1993.
, Multidimensional binary search trees used for associative searching, Communications of the ACM, vol.18, issue.9, pp.509-517, 1975.
DOI : 10.1145/361002.361007
, Multidimensional Binary Search Trees in Database Applications, IEEE Transactions on Software Engineering, p.3333340, 1979.
DOI : 10.1109/TSE.1979.234200
, Kd-trees for Semidynamic Point Sets, Proc. 6th Annu. ACM Sympos, p.1877197, 1990.
, Algorithms for Reporting and Counting Geometric Intersections, IEEE Transactions on Computers, C-289, p.6433647, 1979.
DOI : 10.1109/TC.1979.1675432
, On Levels of Detail in Terrains, 1995.
, Computational Geometry , Algorithms and Applications, 1997.
, G eom etrie 1. Action de groupes, espaces aanes et projectifs, Fernand Nathan, 1977.
, Espaces euclidiens, triangles, cercles et sph eres, p.214, 1977.
, Convexes et polytopes, poly edres r eguliers, aires et volumes, p.176, 1978.
, Formes quadratiques, quadriques et coniques, Fernand Nathan, p.218, 1978.
, La sph ere pour elle-m^ eme, g eom etrie hyperbolique, l'espace des sph eres, p.189, 1977.
, The expected extremes in a Delaunay triangulation, In International Journal of Computational Geometry and Applications, vol.11, p.79991, 1991.
, Time bounds for selection, Journal of Computer and System Sciences, vol.7, issue.4, p.4488461, 1973.
DOI : 10.1016/S0022-0000(73)80033-9
, Geometrics Concepts for Geometric Design, p.393, 1994.
, Applications of random sampling to on-line algorithms in computational geometry, Discrete & Computational Geometry, vol.20, issue.1, p.51171, 1992.
DOI : 10.1007/BF02293035
URL : https://hal.archives-ouvertes.fr/inria-00075274
, The hierarchical representation of objects: the Delaunay tree, Proceedings of the second annual symposium on Computational geometry , SCG '86, p.2600268, 1986.
DOI : 10.1145/10515.10543
, On the randomized construction of the Delaunay tree, Theoretical Computer Science, vol.112, issue.2, p.3399354, 1993.
DOI : 10.1016/0304-3975(93)90024-N
URL : https://hal.archives-ouvertes.fr/inria-00075419
, G eom etrie Algorithmique, p.540, 1995.
, Intersections with random geometric objets, p.28, 1995.
, Triangulation de Delaunay et maillage, Herm es, 1997.
, Computing Dirichlet tesselations, The Computer Journal, p.1622166, 1981.
, EEcient exact evaluation of signs of determinants, Proc. 13th Annu. ACM Sympos, 1997.
, A divide-and-conquer algorithm for computing 4-dimensional convex hulls, Lecture Notes in Computer Science, 333 International Workshop on Computational Geometry, pp.113-135, 1988.
DOI : 10.1007/3-540-50335-8_29
, Navigation d'un robot mobile a l'aide de la st er eovision et de la triangulation de Delaunay, Th ese de Doct, pp.4652-331, 1993.
, A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals, SODA' 97, 1997.
DOI : 10.1007/s004530010005
, The LEDA Class Real Number Technical Report MPI-I96-1-001, Max-Plank-Institut f ur Informatik, Saarbr ucken, 52 pages, janvier 1996 cf
, Mod eles Num eriques de Terrain. Rapport MASI 92, p.33, 1992.
, Range Search and Nearest Neighbor Search in Kd-Trees
, Triangulating a simple polygon in linear time, Discrete Comput Geom, p.4855524, 1991.
, Application Challenges to Computational Geometry, 1996.
, Fractional cascading: I. A data structuring technique, Algorithmica, 1, p.1333162, 1986.
DOI : 10.1007/BF01840440
, OPTIMAL OPERATIONS ON RED-BLACK TREES, International Journal of Foundations of Computer Science, vol.07, issue.03, p.2277239, 1996.
DOI : 10.1142/S0129054196000178
, New results on dynamic planar point location, In SIAM J. Comput, vol.21, p.9722999, 1992.
, Constrained Delaunay triangulations, Proceedings of the third annual symposium on Computational geometry , SCG '87, p.977108, 1989.
DOI : 10.1145/41958.41981
, Sorting helps for voronoi diagrams, Algorithmica, vol.20, issue.4, p.13, 1993.
DOI : 10.1007/BF02526034
, Dynamic algorithms in computational geometry, Proceedings of the IEEE
DOI : 10.1109/5.163409
, G en eration et Modiication de Surfaces Triangul ees. Th ese de L'Institut National Polytechnique de Lorraine, 1991.
, DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed, Tech. Rep. 95-22, 1995.
DOI : 10.1016/S0010-4485(97)00082-1
, Applications of random sampling in computational geometry, Discrete and Computational Geometry, p.3877421, 1989.
, Introduction a l'algorithmique traduit par X. Cazin, p.1019, 1994.
, Introduction a l'algorithmique et a la programmation, pp.1986-87
, TERRAIN AND SURFACE MODELLING SYSTEMS: THEORY AND PRACTICE, The Photogrammetric Record, vol.13, issue.3, p.7477779, 1988.
DOI : 10.1111/j.1477-9730.1988.tb00627.x
, Th ese de l, 1996.
, Improved incremental randomized Delaunay triangulation Rapport de Recherche INRIA N 0 3298, 21 pages, novembre 1997. http:::www.inria.frrprismeepublissdmt-fddtl-92.ps.gz 622 O Fully dynamic Delaunay triangulation in logarithmic expected time per operation Dynamic location in an arrangement of line segments in the plane, Devillers. Further step for incremental randomized Delaunay triangulation Proceedings des Journ ees Franco-Espagnoles de G eom etrie Algorithmique, pp.22229-55580, 1991.
, Lecture Notes on Bucket Algorithms, Birkhh auser, 1986.
DOI : 10.1007/978-1-4899-3531-1
, A Note on Point Location in Delaunay Triangulations of Random Points, Algorithmica, vol.22, issue.4, 1995.
DOI : 10.1007/PL00009234
, On the Variance of the Height of Random Binary Search Trees, SIAM Journal on Computing, vol.24, issue.6, p.115771162, 1995.
DOI : 10.1137/S0097539792237541
, Great problems of elementary mathematics, 1965.
, Multidimensional Searching Problems, SIAM Journal on Computing, vol.5, issue.2, p.1811186, 1976.
DOI : 10.1137/0205015
, Making data structures persistent, J. Comput. Syst. Sci, vol.38, p.866124, 1989.
DOI : 10.1145/12130.12142
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.6781
, A faster divide-and-conquer algorithm for constructing delaunay triangulations, Algorithmica, p.1377151, 1987.
DOI : 10.1007/BF01840356
, Higher-Dimensional Voronoi Diagrams in Linear Expected Time, Discrete Comput Geom, p.3433367, 1991.
, The Space EEciency of Quadtrees, Computer Graphics and Image Processing, p.3355348, 1982.
, A new point location algorithm and its practical eeciency, comparison with existing algorithms, In ACM Transactions on Graphics, vol.32, p.866109, 1984.
, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, vol.10, 1987.
, Optimal point location in a monotone subdivision, In SIAM J. Comput, vol.152, p.3177340, 1986.
, Simulation of Simplicity : a Technique to Cope with Degenerate Cases in Geometric Algorithms, In ACM Trans. Graph, vol.9, p.666104, 1990.
, Les diagrammes de Voronoi et de Delaunay dans le plan et dans l'espace. Th ese de l, 1992.
, Delaunay triangulation using a uniform grid, IEEE Computer Graphics and Applications, vol.13, issue.3, p.36648, 1993.
DOI : 10.1109/38.210490
, Algorithm for constrained delaunay triangulation, The Visual Computer, p.2555265, 1994.
DOI : 10.1007/BF01901582
, Quad trees a data structure for retrieval on composite keys, Acta Informatica, p.119, 1974.
DOI : 10.1007/BF00288933
, Data structures for encoding triangulated irregular networks, Adv. Eng. Software, 93, p.1222128, 1987.
DOI : 10.1016/0141-1195(87)90001-5
, Surface representations based on triangular grids, The Visual Computer, p.27750, 1987.
DOI : 10.1007/BF02153649
, On sorting triangles in a delaunay tessellation, Algorithmica, 6, p.5222532, 1991.
DOI : 10.1007/BF01759057
, Structured graph representation of a hierarchical triangulation, Computer Vision, Graphics and Image Processing, p.2155226, 1989.
, A Survey of Constrained Delaunay Triangulation Algorithms for Surface Representation, Issues on Machine Vision, p.955104, 1989.
DOI : 10.1007/978-3-7091-2830-5_7
, Expected time bounds for selection, Communications of the ACM, vol.18, issue.3, p.1655172, 1975.
DOI : 10.1145/360680.360691
, A Sweepline Algorithm for Voronoi Diagrams, Proc. of the 2nd ACM Symposium on Computational Geometry, p.3133322, 1986.
, A Sweepline Algorithm for Voronoi Diagrams, Algorithmica, p.1533174, 1987.
, An algorithm for nding best matches in logarithmic expected time, In ACM Transactions on Mathematical Software, vol.3, p.2099226, 1977.
, Triangulating a simple polygon, Information Processing Letters, p.1755179, 1978.
DOI : 10.1016/0020-0190(78)90062-5
, Graphes et algorithmes, Eyrolles, troisi eme edition, p.588, 1995.
, Handbook of Discrete and Computational Geometry, p.991, 1997.
, Methods for achieving fast query times in point location data structures, Proc. 8th ACM-SIAM Sympos. on Discrete Algorithms SODA, 1997.
, Dynamic trees and dynamic point location, Proc. 23rd Annu. ACM Sympos. Theory Comput, p.5233533, 1991.
, The LaTeX Companion, p.530, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00172405
, Concrete Mathematics: A Foundation for Computer Science, Computers in Physics, vol.3, issue.5, p.657, 1995.
DOI : 10.1063/1.4822863
, Computing Dirichlet Tessellations in the Plane, The Computer Journal, pp.168-173, 1978.
DOI : 10.1093/comjnl/21.2.168
, Finite-resolution computational geometry, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.143-152, 1986.
DOI : 10.1109/SFCS.1986.19
, A dichromatic framework for balanced trees, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), p.8821, 1978.
DOI : 10.1109/SFCS.1978.3
, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, p.744123, 1985.
DOI : 10.1145/800061.808751
, Ruler, Compass and Computer, 1989.
DOI : 10.1007/978-3-642-83539-1_4
, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, p.3811413, 1992.
, Epsilon Geometry: Building Robust Algorithms for Imprecise Computations, Proceedings of the First ACM Symposium on Computational Geometry, p.2088217, 1989.
, The edge--ipping distance of triangulations. Rapport technique 76, Institut f ur Informatik, European Workshop on Computational Geometry, M unster, 1996.
, Point in Polygon Strategies, Graphics Gems IV, edit e par Paul Heckbert, p.24446, 1994.
DOI : 10.1016/B978-0-12-336156-1.50013-6
, Triangulation avec boxsort Rapport interne, 1993.
, Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching, The Visual Computer, p.2366249, 1987.
DOI : 10.1007/BF01952830
, Mod elisation et Manipulation des Surfaces Triangul ees, Th ese de L'Institut National Polytechnique de Lorraine, 1990.
, The Graph of Triangulations of a Convex Polygon Rapport technique MA2-IR-94-13, juin 1995 abstract In Proc. of the 12th ACM Symp. on Comp. Geom., Philadelphie, pp.7-8, 1996.
, Flipping edges in triangulations, Proc. of the 12th ACM Symp. on Comp. Geom., Philadelphie, p.2144223, 1996.
, Parallel edge ipping : combinatorial bounds, Proceedings des Journ ees Franco-Espagnoles de G eom etrie Algorithmique, p.49952, 1997.
, Proposition d'une arithm etique rationnelle paresseuse et d'un outil d'aide a la saisie d'objets en synth ese d'images. Th ese de l, 1993.
, Duality of constrained Voronoi diagrams and Delaunay triangulations, Algorithmica, p.1422155, 1993.
DOI : 10.1007/BF01188709
, On the Representation and Manipulation of Rigid Solids, 1988.
, EEcient Delaunay Triangulation using Rational Arithmetic, ACM Trans. Graph, vol.10, p.71191, 1991.
DOI : 10.1145/99902.99905
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.2747
, Sur l'algorithme de Fortune, Revue Internationale de CFAO et d'informatique graphique, p.3211336, 1995.
, Constructing Delaunay triangulations by merging buckets in quadtree order, Annales Societatis mathematicae Polonae, Series IV, Fundamenta Informaticae 11, p.2755288, 1988.
, EEcient computation of continuous skeletons, Proceedings of the 20th Annual Symposium on Foundations of Computer Science, p.18827, 1979.
, Optimal Search in Planar Subdivisions, SIAM Journal on Computing, vol.12, issue.1, p.28835, 1983.
DOI : 10.1137/0212002
, The Art of Computer Programming Seminumerical Algorithms, 1969.
, The Art of Computer Programming Fundamental Algorithms, 1973.
, Surface intersection by switching from recursive subdivision to iterative reenement, The Visual Computer, p.47763, 1991.
, A Guide to LaTeX2, 1995.
, Divided kd-trees, In Algorithmica, vol.6, p.8400858, 1991.
, Empty-Shape Triangulation Algorithms, 1994.
, LaTeX A Document Preparation System, p.272, 1994.
, Generation of a Triangular Grid with Application to Contour Plotting, 1972.
, Software for C1 Surface Interpolation, Mathematical Software III, p.1611164, 1977.
DOI : 10.1016/B978-0-12-587260-7.50011-X
, Improving Worst-Case Optimal Delaunay Triangulation Algorithms, Proceedings of the 4th Canadian Conference on Computational Geometry
, Location of a point in a planar subdivision and its applications, In SIAM J. Comput, vol.63, p.5944606, 1977.
, Two algorithms for constructing a Delaunay triangulation, International Journal of Computer & Information Sciences, vol.134, issue.3, p.2199242, 1980.
DOI : 10.1007/BF00977785
, Fac etisation, hi erarchisation et localisation dans une repr esentation par segments d'un graphe planaire, 1993.
, Triangulation de Delaunay euclidienne dans le plan : optimisation du Divide and Conquer a l'aide d'un tri selon deux directions, pp.11-15, 1996.
, Am elioration de la complexit e en moyenne de l'algorithme de Lee et Schachter par division et fusion bi-directionnelles, p.3177336, 1996.
, Analysis of a class of k-dimensional procedures, with an application to 2D Delaunay Triangulation in expected linear time after twodirectional sorting, Proceedings of the 9th Canadian Conference on Computational Geometry, 1997.
, Average-case analysis of a class of divide-and-conquer algorithms, Proceedings des Journ ees Franco-Espagnoles de G eom etrie Algorithmique, p.70077, 1997.
, Applications of a planar separator theorem, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, p.1622170, 1977.
, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, p.1777189, 1979.
DOI : 10.1137/0136016
, Two-dimensional interpolation from random data, The Computer Journal, p.1788191, 1976.
, Derandomization in computational geometry In the web site http:::www.ms.mm.cuni.czzacaddkammatousekk, a para^ tre dans 1700, 1997.
, Delaunay triangulation and the convex hull ofn points in expected linear time, BIT 24, p.1511163, 1984.
DOI : 10.1007/BF01937482
, Data Structures and EEcient Algorithms 3 : Multi-dimensional Searching and Computational Geometry, p.284, 1984.
, Les repr esentations par les fronti eres : quelques constructionss diicult es rencontr ees, Th ese de l'Ecole Nationale des Mines de Saint-Etienne, 1987.
, Lazy arithmetic, IEEE Transactions on Computers, vol.46, issue.9, 1997.
DOI : 10.1109/12.620478
, Veriiable Implementation of Geometric Algorithms Using Finite Precision Arithmetic, 1988.
, Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic, 30th Annual Symposium on Foundations of Computer Science, p.5000505, 1989.
DOI : 10.1109/SFCS.1989.63525
, Robust Geometric Computations for Vision and Robotics, DARPA, 1989.
, Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic, ACM-SIAM Symposium on Discrete Algorithms, 1989.
, Approximation Algorithms for Geometric Optimization Problems, Proceedings of the 9th Canadian Conference on Computational Geometry, 1997.
, Hi erarchisation et fac etisation de la repr esentation par segments d'un graphe planaire dans le cadre d'une arithm etique mixte, Th ese de l'Ecole Nationale des Mines de Saint-Etienne, 1990.
, Constrained Delaunay triangulation revisited, Proceedings of the Fifth Canadian Conference of Computational Geometry, p.3400345, 1993.
, Hierarchical Delaunay triangulation, Proceedings of the Sixth Canadian Conference of Computational Geometry, pp.1655-170, 1994.
, Fast Randomized Point Location Without Preprocessing in Two-and Three-dimensional Delaunay Triangulations, Proceedings of the 12th ACM Symposium on Computational Geometry, p.20, 1996.
, Randomized multidimensional search trees: Dynamic sampling, Proceedings of the 7th Annual ACM Symposium on Computational Geometry, p.1211131, 1991.
DOI : 10.1109/sfcs.1991.185371
, Computational Geometry : An Introduction through Randomized Algorithms, 1984.
, Algorithmes g eom etriques adaptatifs, 1996.
, Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms, Journal of the Operations Research Society of Japan, p.3066337, 1984.
, Spatial Tessellations : Concepts and Applications of Voronoi Diagrams, p.532, 1992.
, Numerical stability of geometric algorithms, Proceedings of the third annual symposium on Computational geometry , SCG '87, p.1199125, 1987.
DOI : 10.1145/41958.41970
, A New Approach to Planar Point Location, SIAM Journal on Computing, vol.10, issue.3, p.4733483, 1981.
DOI : 10.1137/0210035
, PLANAR POINT LOCATION REVISITED, International Journal of Foundations of Computer Science, vol.01, issue.01, p.71186, 1990.
DOI : 10.1142/S0129054190000072
, Computational Geometry -an introduction, 1985.
, Dynamic planar point location with optimal query time, Theoret. Comput. Sci, vol.74, p.955114, 1990.
, EEcient point location in a convex spatial cell complex, Ed. SIAM Journal of Computing, vol.21, p.2677280, 1992.
, Lecture on Geometric Divide-and-Conquer Algorithms based on Geometric Sampling, Cours dispens e au LORIA-CRIN de Nancy par le Max-Plank- Institut f ur Informatik, Saarbr ucken, 1997.
, M ethodes d'approximation et de g eom etrie algorithmique pour la reconstruction de courbes et de surfaces Th ese de l, p.195, 1994.
, Handbook on Computational Geometry, 1997.
, The Design and Analysis of Spatial Data Structures, p.493, 1990.
, Planar point location using persistent search trees, In Communications ACM, vol.29, p.6699679, 1986.
, Sur les diagrammes de Voronoi et de Delaunay d'ordre k dans le plan et dans l'espace. Th ese de l, 1995.
, Triangulating a star-shaped polygon, 1980.
, Constrained Hierarchical Delaunay Triangulation and Voronoi Diagrams with obstacles, p.1788191, 1988.
, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry, vol.1, issue.1, p.51164, 1991.
DOI : 10.1016/0925-7721(91)90012-4
, Planar point location and randomization, Cours dispens e au LORIA- CRIN de Nancy par le Max-Plank-Institut f ur Informatik, Saarbr ucken, pp.13-1997
, Algorithmes en langage C traduit par, p.685, 1991.
, Consistent calculations for solids modeling, Proceedings of the first annual symposium on Computational geometry , SCG '85, p.29938, 1985.
DOI : 10.1145/323233.323238
, Computational Geometry, Dept.of Comput. Sci, 1978.
, Closest-point problems, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975), p.1511162, 1975.
DOI : 10.1109/SFCS.1975.8
, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, First Workshop on Applied Computational Geometry, p.1244133, 1996.
DOI : 10.1007/BFb0014497
, Robust adaptive floating-point geometric predicates, Proceedings of the twelfth annual symposium on Computational geometry , SCG '96, p.1411150, 1996.
DOI : 10.1145/237218.237337
, Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates, p.53, 1996.
, Triangulation de Delaunay. Communication Personnelle, SETRAACITSSATA, 1996.
, A comparison of sequential Delaunay triangulation algorithms, Proc. 11th Annu. ACM Sympos, pp.61-70, 1995.
, A comparison of sequential Delaunay triangulation algorithms, Computational Geometry, pp.361-385, 1997.
, Two design principles of geometric algorithms in finite-precision arithmetic, Applied Mathematics Letters, vol.2, issue.2, pp.203-206, 1989.
DOI : 10.1016/0893-9659(89)90022-0
, Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic, Proceedings of the First Canadian Conference on Computational Geometry, 1989.
DOI : 10.1109/5.163412
, A solid modelling system free from topological inconsistency
, Vers des algorithmes randomis es dynamiques en g eom etrie algorithmique Th ese de doctorat en sciences http:::www.inria.frrprismeepublissthese-teillaud.ps.gz Version anglaise : Towards dynamic randomized algorithms in computational geometry Version livre : Towards dynamic algorithms in computational geometry, Lecture Notes in Computer Science, 1991.
, Triangulation de Delaunay contrainte : etude et implantation d'algorithmes, 1992.
, An optimal algorithm for greedy triangulation of a set of points, Proceedings of the Sixth Canadian Conference of Computational Geometry, p.3322338, 1994.
, Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes, The Computer Journal, p.1677172, 1981.
, A Geometric Consistency Theorem for a Symbolic Perturbation Scheme, J. Comput. Syst. Sci, vol.40, p.2218, 1990.
, Symbolic Treatment of Geometric Degeneracies, J. Symbolic. Comput, vol.10, p.3499370, 1990.