Three Pragmatic Tools for the Validation of Knowledge-Based Systems. - Sylvain Petitjean; L. Brunessaux; Jean-Philippe Vaudet (EUROVAV, 1991)

Computing exact aspect graphs of curved objects: Algebraic surfaces. - Sylvain Petitjean; Jean Ponce; David J. Kriegman (Int. J. Comput. Vis., 1992)

On the Enumerative Geometry of Aspect Graphs. - Sylvain Petitjean (ECCV (1), 1994)

Automating the Construction of Stationary Multiple-Point Classes. - Sylvain Petitjean (ISSAC, 1994)

Algebraic Geometry and Object Representation in Computer Vision. - Sylvain Petitjean (Object Representation in Computer Vision, 1994)

The Number of Views of Piecewise-Smooth Algebraic Objects. - Sylvain Petitjean (STACS, 1995)

Mixing synthesis and video images of outdoor environments: application to the bridges of Paris. - Marie-Odile Berger; Gilles Simon; Sylvain Petitjean; Brigitte Wrobel-Dautcourt (ICPR, 1996)

The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs. - Sylvain Petitjean (Int. J. Comput. Vis., 1996)

A Computational Geometric Approach to Visual Hulls. - Sylvain Petitjean (Int. J. Comput. Geom. Appl., 1998)

Algebraic Geometry and Computer Vision: Polynomial Systems, Real and Complex Roots. - Sylvain Petitjean (J. Math. Imaging Vis., 1999)

Mixing synthetic and video images of an outdoor urban environment. - Marie-Odile Berger; Brigitte Wrobel-Dautcourt; Sylvain Petitjean; Gilles Simon (Mach. Vis. Appl., 1999)

Curve and Surface Reconstruction from Regular and Non-Regular Point Sets. - Edmond Boyer; Sylvain Petitjean (CVPR, 2000)

Regular and non-regular point sets: Properties and reconstruction. - Sylvain Petitjean; Edmond Boyer (Comput. Geom., 2001)

The virtual mesh: a geometric abstraction for efficiently computing radiosity. - Laurent Alonso; François Cuny; Sylvain Petitjean; Jean-Claude Paul; Sylvain Lazard; Eric Wies (ACM Trans. Graph., 2001)

A survey of methods for recovering quadrics in triangle meshes. - Sylvain Petitjean (ACM Comput. Surv., 2002)

Least squares conformal maps for automatic texture atlas generation. - Bruno Lévy 001; Sylvain Petitjean; Nicolas Ray; Jérôme Maillot (ACM Trans. Graph., 2002)

Near-optimal parameterization of the intersection of quadrics. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (SCG, 2003)

The Expected Number of 3D Visibility Events Is Linear. - Olivier Devillers; Vida Dujmovic; Hazel Everett; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sylvain Petitjean (SIAM J. Comput., 2003)

An Experimental Assessment of the 2D Visibility Complex. - Hazel Everett; Sylvain Lazard; Sylvain Petitjean; Linqiao Zhang (CCCG, 2005)

Intersecting quadrics: an efficient and exact implementation. - Sylvain Lazard; Luis Mariano Peñaranda; Sylvain Petitjean (Comput. Geom., 2006)

Common Tangents to Spheres in R3. - Ciprian Borcea; Xavier Goaoc; Sylvain Lazard; Sylvain Petitjean (Discret. Comput. Geom., 2006)

Contributions au calcul géométrique effectif avec des objets courbes de faible degré. (Contributions to effective geometric computing with low-degree curved objects). - Sylvain Petitjean (2007)

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics. - Laurent Dupont 004; Michael Hemmer; Sylvain Petitjean; Elmar Schömer (ESA, 2007)

Hadwiger and Helly-type theorems for disjoint unit spheres - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen; Sylvain Petitjean (CoRR, 2007)

On the Expected Size of the 2D Visibility Complex. - Hazel Everett; Sylvain Lazard; Sylvain Petitjean; Linqiao Zhang (Int. J. Comput. Geom. Appl., 2007)

Approximation by Conic Splines. - Sunayana Ghosh; Sylvain Petitjean; Gert Vegter (Math. Comput. Sci., 2007)

Line Transversals to Disjoint Balls. - Ciprian Borcea; Xavier Goaoc; Sylvain Petitjean (Discret. Comput. Geom., 2008)

Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. - Otfried Cheong; Xavier Goaoc; Andreas F. Holmsen; Sylvain Petitjean (Discret. Comput. Geom., 2008)

Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (J. Symb. Comput., 2008)

Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (J. Symb. Comput., 2008)

Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (J. Symb. Comput., 2008)

Pinning a Line by Balls or Ovaloids in ℝ3. - Xavier Goaoc; Stefan König 003; Sylvain Petitjean (Discret. Comput. Geom., 2011)

A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics. - Michael Hemmer; Laurent Dupont 004; Sylvain Petitjean; Elmar Schömer (J. Symb. Comput., 2011)