The following pages link to Sylvain Petitjean (Q209674):
Displaying 24 items.
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Pinning a line by balls or ovaloids in \(\mathbb R^{3}\) (Q629845) (← links)
- Common tangents to spheres in \(\mathbb R^{3}\) (Q818699) (← links)
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm (Q954969) (← links)
- Near-optimal parameterization of the intersection of quadrics. II. A classification of pencils (Q954970) (← links)
- Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections (Q954971) (← links)
- Approximation by conic splines (Q2465575) (← links)
- Line transversals to disjoint balls (Q2482193) (← links)
- Helly-type theorems for line transversals to disjoint unit balls (Q2482201) (← links)
- Intersecting quadrics: an efficient and exact implementation (Q2507161) (← links)
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics (Q3527253) (← links)
- (Q3602881) (← links)
- (Q3619938) (← links)
- (Q3619940) (← links)
- (Q4234272) (← links)
- The Expected Number of 3D Visibility Events Is Linear (Q4441895) (← links)
- A Computational Geometric Approach to Visual Hulls (Q4513219) (← links)
- The number of views of piecewise-smooth algebraic objects (Q4596654) (← links)
- (Q5188242) (← links)
- Invariant-Based Characterization of the Relative Position of Two Projective Conics (Q5188773) (← links)
- Near-optimal parameterization of the intersection of quadrics (Q5361630) (← links)
- Intersecting quadrics (Q5361697) (← links)
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX (Q5386746) (← links)
- Regular and non-regular point sets: Properties and reconstruction (Q5946436) (← links)
