The following pages link to Sylvain Lazard (Q325149):
Displaying 42 items.
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- On the complexity of sets of free lines and line segments among balls in three dimensions (Q420577) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- Bivariate triangular decompositions in the presence of asymptotes (Q512372) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Analysis of farthest point sampling for approximating geodesics in a graph (Q679744) (← links)
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767) (← links)
- On point-sets that support planar graphs (Q714901) (← links)
- Common tangents to spheres in \(\mathbb R^{3}\) (Q818699) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- Lines tangent to four triangles in three-dimensional space (Q878381) (← 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)
- An upper bound on the average size of silhouettes (Q958221) (← links)
- On the degree of standard geometric predicates for line transversals in 3D (Q1025306) (← links)
- (Q1028231) (redirect page) (← links)
- On the complexity of umbra and penumbra (Q1028233) (← links)
- The Voronoi diagram of three lines (Q1028584) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- On the edge-length ratio of outerplanar graphs (Q1740698) (← links)
- Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves (Q2029428) (← links)
- Rounding meshes in 3D (Q2189740) (← links)
- Corrigendum to ``On the edge-length ratio of outerplanar graphs'' (Q2285163) (← links)
- Intersecting quadrics: an efficient and exact implementation (Q2507161) (← links)
- Transversals to line segments in three-dimensional space (Q2572590) (← links)
- Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization (Q2840989) (← links)
- Recognizing Shrinkable Complexes Is NP-Complete (Q2921395) (← links)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (Q2961545) (← links)
- Rational univariate representations of bivariate systems and applications (Q2963223) (← links)
- Separating linear forms for bivariate systems (Q2963224) (← links)
- Silhouette of a random polytope (Q2970445) (← links)
- (Q2970458) (← links)
- A SUCCINCT 3D VISIBILITY SKELETON (Q3084691) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Improved algorithm for computing separating linear forms for bivariate systems (Q3452380) (← links)
- Farthest-Polygon Voronoi Diagrams (Q3527230) (← links)
- (Q5115798) (← links)
- Drawing Kn in Three Dimensions with One Bend per Edge (Q5301393) (← links)
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs (Q5419482) (← links)
