Sylvain Lazard

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves
Journal of Computational and Applied Mathematics
2021-06-03Paper
3D snap rounding2020-08-18Paper
Rounding meshes in 3D
Discrete & Computational Geometry
2020-06-16Paper
Corrigendum to ``On the edge-length ratio of outerplanar graphs
Theoretical Computer Science
2020-01-16Paper
On the edge-length ratio of outerplanar graphs
Theoretical Computer Science
2019-05-02Paper
On the edge-length ratio of outerplanar graphs
Lecture Notes in Computer Science
2019-02-20Paper
Monotone simultaneous paths embeddings in \(\mathbb{R}^d\)2018-12-10Paper
Analysis of farthest point sampling for approximating geodesics in a graph
Computational Geometry
2018-01-19Paper
On the topology of planar algebraic curves
Proceedings of the twenty-fifth annual symposium on Computational geometry
2017-10-20Paper
Near-optimal parameterization of the intersection of quadrics
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
Intersecting quadrics
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
Recognizing shrinkable complexes is NP-complete2017-03-30Paper
Silhouette of a random polytope2017-03-30Paper
Bivariate triangular decompositions in the presence of asymptotes
Journal of Symbolic Computation
2017-02-24Paper
Monotone simultaneous embeddings of paths in \(d\) dimensions
Lecture Notes in Computer Science
2017-02-21Paper
Rational univariate representations of bivariate systems and applications
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation
2017-02-10Paper
Rational univariate representations of bivariate systems and applications
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation
2017-02-10Paper
Separating linear forms for bivariate systems
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation
2017-02-10Paper
Solving bivariate systems using rational univariate representations
Journal of Complexity
2016-10-17Paper
Improved algorithm for computing separating linear forms for bivariate systems
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation
2015-11-11Paper
Improved algorithm for computing separating linear forms for bivariate systems
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation
2015-11-11Paper
Separating linear forms and rational univariate representations of bivariate systems
Journal of Symbolic Computation
2014-12-09Paper
Recognizing shrinkable complexes is NP-complete
Algorithms - ESA 2014
2014-10-08Paper
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications
2014-06-10Paper
On the complexity of sets of free lines and line segments among balls in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
2014-04-03Paper
Bounded-curvature shortest paths through a sequence of points using convex optimization
SIAM Journal on Computing
2013-07-24Paper
On point-sets that support planar graphs
Computational Geometry
2012-10-12Paper
On the complexity of sets of free lines and line segments among balls in three dimensions
Discrete & Computational Geometry
2012-05-22Paper
On point-sets that support planar graphs
Graph Drawing
2012-03-09Paper
Farthest-polygon Voronoi diagrams
Computational Geometry
2011-03-25Paper
A succinct 3D visibility skeleton
Discrete Mathematics, Algorithms and Applications
2011-03-25Paper
On the topology of real algebraic plane curves
Mathematics in Computer Science
2011-02-19Paper
On the Computation of 3D Visibility Skeletons
Lecture Notes in Computer Science
2010-07-20Paper
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
Discrete & Computational Geometry
2010-03-04Paper
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry
2009-11-16Paper
The Voronoi diagram of three lines
Discrete & Computational Geometry
2009-07-06Paper
On the complexity of umbra and penumbra
Computational Geometry
2009-06-30Paper
On the degree of standard geometric predicates for line transversals in 3D
Computational Geometry
2009-06-18Paper
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry
2009-02-12Paper
The Voronoi diagram of three lines2009-02-12Paper
Between umbra and penumbra2009-02-12Paper
Predicates for line transversals to lines and line segments in three-dimensional space
Proceedings of the twenty-fourth annual symposium on Computational geometry
2009-02-12Paper
Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications
2009-01-19Paper
Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications
2009-01-19Paper
An upper bound on the average size of silhouettes
Discrete & Computational Geometry
2008-12-02Paper
Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
Journal of Symbolic Computation
2008-11-18Paper
Near-optimal parameterization of the intersection of quadrics. II. A classification of pencils
Journal of Symbolic Computation
2008-11-18Paper
Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections
Journal of Symbolic Computation
2008-11-18Paper
Farthest-Polygon Voronoi Diagrams
Algorithms – ESA 2007
2008-09-25Paper
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
International Journal of Computational Geometry & Applications
2008-05-14Paper
PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING
International Journal of Computational Geometry & Applications
2008-05-14Paper
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing
2008-04-22Paper
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
Graph Drawing
2008-03-25Paper
Throwing Stones Inside Simple Polygons
Algorithmic Aspects in Information and Management
2008-01-04Paper
Lines tangent to four triangles in three-dimensional space
Discrete & Computational Geometry
2007-04-26Paper
Graph Drawing
Lecture Notes in Computer Science
2006-11-13Paper
Intersecting quadrics: an efficient and exact implementation
Computational Geometry
2006-10-10Paper
Common tangents to spheres in \(\mathbb R^{3}\)
Discrete & Computational Geometry
2006-03-21Paper
Transversals to line segments in three-dimensional space
Discrete & Computational Geometry
2005-11-10Paper
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
International Journal of Computational Geometry & Applications
2004-09-29Paper
The Expected Number of 3D Visibility Events Is Linear
SIAM Journal on Computing
2004-01-08Paper
Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing
2003-01-05Paper
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
Algorithmica
2002-09-25Paper
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry
2002-07-22Paper
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics
2002-05-15Paper
scientific article; zbMATH DE number 1522946 (Why is no real title available?)2000-10-30Paper
Motion Planning of Legged Robots
SIAM Journal on Computing
2000-10-18Paper
scientific article; zbMATH DE number 797427 (Why is no real title available?)1997-04-23Paper


Research outcomes over time


This page was built for person: Sylvain Lazard