The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs

Sylvain Petitiean
International Journal of Computer Vision 19 ( 3) 261 -287

15
1996
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX

HAZEL EVERETT , SYLVAIN LAZARD , SYLVAIN PETITJEAN , LINQIAO ZHANG
International Journal of Computational Geometry and Applications 17 ( 04) 361 -381

3
2007
Computing exact aspect graphs of curved objects bounded by smooth algebraic surfaces

Sylvain PetitJean
University of Illinois at Urbana-Champaign

9
1992
Characterizing the intersection pattern of two conics: a {B}ezoutian-based approach

Sylvain Petitjean
Joint international conferences : 9th Asian Symposium on Computer Mathematics (ASCM 2009) and 3rd International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2009)

2009
Near-Optimal Parameterization of the Intersection of Quadrics: Theory and Implementation

Sylvain Lazard , Sylvain Petitjean , Laurent Dupont , Daniel Lazard
International Conference on Polynomial System Solving - ICPSS 2004

1
2004
An Experimental Assessment of the 2D Visibility Complex

Linqiao Zhang , Sylvain Lazard , Sylvain Petitjean , Hazel Everett
canadian conference on computational geometry 298 -301

1
2005
Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections

Laurent Dupont , Daniel Lazard , Sylvain Lazard , Sylvain Petitjean
Journal of Symbolic Computation 43 ( 3) 216 -232

24
2008
Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils

Laurent Dupont , Daniel Lazard , Sylvain Lazard , Sylvain Petitjean
Journal of Symbolic Computation 43 ( 3) 192 -215

27
2008
Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm

Laurent Dupont , Daniel Lazard , Sylvain Lazard , Sylvain Petitjean
Journal of Symbolic Computation 43 ( 3) 168 -191

44
2008
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics

Michael Hemmer , Laurent Dupont , Sylvain Petitjean , Elmar Schömer
Journal of Symbolic Computation 46 ( 4) 467 -494

8
2011
The number of views of piecewise-smooth algebraic objects

Sylvain Petitjean
symposium on theoretical aspects of computer science 571 -582

2
1995
Towards the Robust Intersection of Implicit Quadrics

Laurent Dupont , Sylvain Lazard , Sylvain Petitjean , Daniel Lazard
Workshop on Uncertainty in Geometric Computations 704 59 -68

15
2002
Invariant-Based Characterization of the Relative Position of Two Projective Conics

Sylvain Petitjean
Nonlinear Computational Geometry 189 -220

4
2009
Automating the construction of stationary multiple-point classes

Sylvain Petitjean
international symposium on symbolic and algebraic computation 9 -14

3
1994
The Expected Number of 3D Visibility Events Is Linear

Olivier Devillers , Vida Dujmovic , Hazel Everett , Xavier Goaoc
SIAM Journal on Computing 32 ( 6) 1586 -1620

21
2003
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

Laurent Dupont , Michael Hemmer , Sylvain Petitjean , Elmar Schömer
Algorithms – ESA 2007 4698 633 -644

9
2007
Regular and non-regular point sets: Properties and reconstruction

Sylvain Petitjean , Edmond Boyer
Computational Geometry: Theory and Applications 19 ( 2) 101 -126

41
2001
Near-optimal parameterization of the intersection of quadrics

Laurent Dupont , Daniel Lazard , Sylvain Lazard , Sylvain Petitjean
symposium on computational geometry 246 -255

33
2003
A survey of methods for recovering quadrics in triangle meshes

Sylvain Petitjean
ACM Computing Surveys 34 ( 2) 211 -262

361
2002