Sylvain Petitjean

According to our database1, Sylvain Petitjean authored at least 33 papers between 1991 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics.
J. Symb. Comput., 2011

Pinning a Line by Balls or Ovaloids in ℝ<sup>3</sup>.
Discret. Comput. Geom., 2011

2008
Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections.
J. Symb. Comput., 2008

Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils.
J. Symb. Comput., 2008

Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm.
J. Symb. Comput., 2008

Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.
Discret. Comput. Geom., 2008

Line Transversals to Disjoint Balls.
Discret. Comput. Geom., 2008

2007
Approximation by Conic Splines.
Math. Comput. Sci., 2007

On the Expected Size of the 2D Visibility Complex.
Int. J. Comput. Geom. Appl., 2007

Hadwiger and Helly-type theorems for disjoint unit spheres
CoRR, 2007

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics.
Proceedings of the Algorithms, 2007

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

2006
Common Tangents to Spheres in R<sup>3</sup>.
Discret. Comput. Geom., 2006

Intersecting quadrics: an efficient and exact implementation.
Comput. Geom., 2006

2005
An Experimental Assessment of the 2D Visibility Complex.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003
The Expected Number of 3D Visibility Events Is Linear.
SIAM J. Comput., 2003

Near-optimal parameterization of the intersection of quadrics.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Least squares conformal maps for automatic texture atlas generation.
ACM Trans. Graph., 2002

A survey of methods for recovering quadrics in triangle meshes.
ACM Comput. Surv., 2002

2001
The virtual mesh: a geometric abstraction for efficiently computing radiosity.
ACM Trans. Graph., 2001

Regular and non-regular point sets: Properties and reconstruction.
Comput. Geom., 2001

2000
Curve and Surface Reconstruction from Regular and Non-Regular Point Sets.
Proceedings of the 2000 Conference on Computer Vision and Pattern Recognition (CVPR 2000), 2000

1999
Mixing synthetic and video images of an outdoor urban environment.
Mach. Vis. Appl., 1999

Algebraic Geometry and Computer Vision: Polynomial Systems, Real and Complex Roots.
J. Math. Imaging Vis., 1999

1998
A Computational Geometric Approach to Visual Hulls.
Int. J. Comput. Geom. Appl., 1998

1996
The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs.
Int. J. Comput. Vis., 1996

Mixing synthesis and video images of outdoor environments: application to the bridges of Paris.
Proceedings of the 13th International Conference on Pattern Recognition, 1996

1995
The Number of Views of Piecewise-Smooth Algebraic Objects.
Proceedings of the STACS 95, 1995

1994
Algebraic Geometry and Object Representation in Computer Vision.
Proceedings of the Object Representation in Computer Vision, 1994

Automating the Construction of Stationary Multiple-Point Classes.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

On the Enumerative Geometry of Aspect Graphs.
Proceedings of the Computer Vision, 1994

1992
Computing exact aspect graphs of curved objects: Algebraic surfaces.
Int. J. Comput. Vis., 1992

1991
Three Pragmatic Tools for the Validation of Knowledge-Based Systems.
Proceedings of the European Workshop on the Verification and Validation of Knowledge-Based Systems, 1991


  Loading...