1. Pascal Desnoguès. Triangulations et quadriques. Thèse de doctorat en sciences, Université de Nice Sophia Antipolis, France, 1996. [WWW]



2. Pierre Ferbach. Contribution à la planification de trajectoires. Thèse de doctorat en sciences, École Polytechnique, France, 1996.



3. Sylvain Lazard. Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes. Thèse de doctorat en sciences, Université Paris 6, France, 1996. [WWW]



4. Franck Nielsen. Algorithmes géométriques adaptatifs. Thèse de doctorat en sciences, Université de Nice Sophia Antipolis, France, 1996. [WWW]



5. Mariette Yvinec. Dix ans de geometrie algorithmique. Habilitation à diriger des recherches, Université de Nice Sophia Antipolis, France, 1996.

1. M. J. Atallah and A. Fabri. On the Multisearching Problem for Hypercubes. Computational Geometry: Theory and Applications, 5:293-302, 1996. [PDF]



2. J-D. Boissonnat, A. Cérézo, O. Devillers, J. Duquesne, and M. Yvinec. An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension $d$. Computational Geometry: Theory and Applications, 6:123-130, 1996. [WWW]



3. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the Delaunay triangulation of points lying in two planes. Internat. J. Comput. Geom. Appl., 6(1):1-14, 1996. [WWW] [doi:10.1142/S0218195996000022]



4. J-D. Boissonnat and K. Dobrindt. Randomized construction of the upper envelope of triangles in ${\rm I \! R}^3$. Computational Geometry: Theory and Applications, 5(6):293-342, 1996.



5. O. Devillers. An introduction to randomization in computational geometry. Theoret. Comput. Sci., 157:35-52, 1996. [WWW]



6. O. Devillers and A. Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. Internat. J. Comput. Geom. Appl., 6:487-506, 1996. [WWW] [doi:10.1142/S0218195996000307]



7. O. Devillers, M. Golin, K. Kedem, and S. Schirra. Queries on Voronoi Diagrams of Moving Points. Computational Geometry: Theory and Applications, 6:315-327, 1996. [WWW]



8. J-P. Merlet. Redundant parallel manipulators. Journal of Laboratory Robotic and Automation, 8:17-24, 1996.



9. F. Nielsen. Output-sensitive Peeling of Convex and Maximal Layers. Inform. Process. Lett., 59:255-259, 1996.



10. J-P. Merlet. Some algebraic problems arising in the field of mechanisms theory. In Progress in Mathematics, volume 143. Birkhprisme-äuser Verlag, 1996.

1. J-D. Boissonnat, J. Czyzowicz, O. Devillers, J. Urrutia, and M. Yvinec. Computing Largest Circles Separating Two Sets of Segments. In Proc. 8th Canad. Conf. Comput. Geom., pages 173-178, 1996.



2. Jean-Daniel Boissonnat and Sylvain Lazard. A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles. In Proc. 12th Annual Symposium on Computational Geometry, pages 242-251, 1996.



3. J-D. Boissonnat and S. Lazard. Convex hulls of bounded curvature. In Proc. 8th Canad. Conf. Comput. Geom., pages 14-19, 1996.



4. J.-D. Boissonnat and S. Nullans. Reconstruction of Geological Structures from Heterogeneous and Sparse Data. In Proc. 4th ACM Workshop Adv. Geogr. Inform. Syst., 1996.



5. O. Devillers. Computational geometry and discrete computations. In Proc. 6th Discrete Geometry for Computer Imagery conf., volume 1176 of Lecture Notes in Computer Science, pages 317-324, 1996. Springer-Verlag. Note: (invited paper). [WWW]



6. O. Devillers and M. Katz. Optimal Line Bipartitions of Point Sets. In Proc. 7th Annu. Internat. Sympos. Algorithms Comput. (ISAAC 96), volume 1178 of Lecture Notes in Computer Science, pages 45-54, 1996. Springer-Verlag.



7. Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr. The CGAL Kernel: A Basis for Geometric Computation. In M. C. Lin and D. Manocha, editors, Proc. 1st ACM Workshop on Appl. Comput. Geom., volume 1148 of Lecture Notes Comput. Sci., pages 191-202, 1996. Springer-Verlag. [POSTSCRIPT]



8. Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr. The CGAL Kernel: A Basis for Geometric Computation. In M. C. Lin and D. Manocha, editors, Applied Computational Geometry (Proc. WACG '96), volume 1148 of Lecture Notes Comput. Sci., pages 191-202, 1996. Springer-Verlag. [POSTSCRIPT]



9. C. Gosselin, S. Lemieux, and J-P. Merlet. A new architecture of planar three-degree-of-freedom parallel manipulator. In IEEE Internat. Conf. on Robotics and Automation, Minneapolis, pages 3738-3743, 1996.



10. Matthew Katz and Franck Nielsen. On Piercing Sets of Objects. In Proc. 12th Annual Symposium on Computational Geometry, pages 113-121, 1996.



11. J-P. Merlet. Designing a Parallel Manipulator for a Specific Workspace. In Internat. Symp. on Robotics and Manufacturing, Montpellier, 1996.



12. J-P. Merlet. Direct kinematics of planar parallel manipulators. In IEEE Internat. Conf. on Robotics and Automation, Minneapolis, pages 3744-3749, 1996.



13. J-P. Merlet. Kinematic analysis of suspension mechanisms. In 29th Internat. Symp. on Automotive Technology and Automation, Florence, 1996.



14. J-P. Merlet. Workspace-oriented methodology for designing a parallel manipulator. In IDMME, Nantes, 1996.



15. J-P. Merlet. Workspace-oriented methodology for designing a parallel manipulator. In IEEE Internat. Conf. on Robotics and Automation, Minneapolis, pages 3726-3731, 1996.



16. J-P. Merlet, C. Gosselin, and N Mouly. Workspaces of planar parallel manipulators. In 11th RoManSy, Udine, 1996.



17. F. Nielsen. Fast Stabbing of Boxes in High Dimensions. In Proc. 8th Canad. Conf. Comput. Geom., pages 87-92, 1996.



18. S. Zuyev, P. Desnoguès, and H. Rakotoarisoa. Simulations of large telecommunication networks based on probabilistic modeling. In 4th Internat. Conf. on Telecommunication Systems (Modeling and Analysis), pages 54-66, 1996.



19. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc van Kreveld, and Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. In Proc. 7th Annu. Internat. Sympos. Algorithms Comput. (ISAAC 96), volume 1178 of Lecture Notes in Computer Science, pages 126-135, 1996. Springer-Verlag.

1. J-D. Boissonnat and S. Lazard. A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. Research Report 2887, INRIA, 1996. [WWW]



2. J.-D. Boissonnat and S. Nullans. Reconstruction of Geological Structures from Heterogeneous and Sparse Data. Research Report 3069, INRIA, 1996. [WWW]



3. J-D. Boissonnat, E. de Lange, and M. Teillaud. Minkowski operations for satellite antenna layout. Research Report 3070, INRIA, 1996. [WWW]



4. H. Brönnimann and M. Yvinec. A complete analysis of Clarkson's algorithm for safe determinant evaluation. Research Report 3051, INRIA, 1996. [WWW]



5. P. Desnoguès and H. Rakotoarisoa. ARC: Simulateur d'architecture de réseaux de communications. Rapport technique 187, INRIA, 1996. [WWW]



6. O. Devillers and M. Katz. Optimal Line Bipartitions of Point Sets. Research Report 2871, INRIA, 1996. [WWW]



7. O. Devillers and F. P. Preparata. A probabilistic analysis of the power of arithmetic filters. Research Report 2971, INRIA, 1996. Note: Also report CS96-27 Brown University. [WWW]



8. Matthew Katz and Franck Nielsen. On Piercing Sets of Objects. Research Report 2874, INRIA, 1996. [WWW]



9. J-P. Merlet. Modélisation géométrique de mécanismes de suspension automobile. Research Report 2817, INRIA, 1996. [WWW]



10. F. Nielsen. Fast Stabbing of Boxes in High Dimensions. Research Report 2854, INRIA, 1996. [WWW] Keyword(s): Computational geometry, Output-sensitive algorithms.



11. L. Tancredi and M. Teillaud. Géométrie synthétique et robots parallèles. Research Report 2962, INRIA, 1996. [WWW]



12. L. Tancredi, M. Teillaud, and O. Devillers. Symbolic Elimination for parallel manipulators. Research Report 2809, INRIA, 1996. [WWW] Keyword(s): parallel manipulator, forward kinematics problem, algebraic geometry.



13. S. Zuyev, P. Desnoguès, and H. Rakotoarisoa. Simulations of large telecommunication networks based on probabilistic modeling. Research Report 2787, INRIA, 1996. [WWW]



14. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc van Kreveld, and Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. Research Report 2832, INRIA, 1996. [WWW]

1. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. The CGAL Kernel, User manual. 1996. Note: Release 0.5.

1. Sylvain Pion. Maillage de surfaces à partir de points digitalisés sans structure interne. Rapport de DEA, École Normale Supérieure, France, 1996. [PDF]



2. O. Devillers. GéDéoN, 1996. Note: 26 numéros de 1991 à 1996. [WWW]



3. L. Tancredi, M. Teillaud, and O. Devillers. Symbolic Elimination for parallel manipulators, 1996. Note: Communication at 4th Internat. Sympos. on Effective Methods in Algebraic Geometry (MEGA).

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html