Sylvain Lazard
Présentation
== PhD students
Publications
Publications
|
|
Planification de trajectoires de robots mobiles non-holonomes et de robots à pattesInformatique [cs]. Université Pierre et Marie Curie - Paris VI, 1996. Français. ⟨NNT : ⟩ |
|
|
Problèmes de Géométrie Algorithmique sur les Droites et les Quadriques en Trois DimensionsGénie logiciel [cs.SE]. Université Nancy II, 2007 |
Algebraic kernelCGAL Editorial board. CGAL User and Reference Manual, 3.6 edition, CGAL Editorial board, 2010 |
|
|
|
Towards the Robust Intersection of Implicit QuadricsJ. Winkler and M. Niranjan. Uncertainty in Geometric Computations, Kluwer Academic Publishers, pp.59-68, 2002, International Series in Engineering and Computer Science |
|
|
Interpolation problem with curvature constraintsA. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000 |
|
|
Numerical Algorithm for the Topology of Singular Plane CurvesEuroCG 2019 - 35th European Workshop on Computational Geometry, Mar 2019, Utrecht, Netherlands |
|
|
3D Snap RoundingProceedings of the 34th International Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.30:1 - 30:14, ⟨10.4230/LIPIcs.SoCG.2018.30⟩ |
|
|
On the Edge-length Ratio of Outerplanar GraphsInternational Symposium on Graph Drawing and Network Visualization, 2017, Boston, United States |
|
|
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. ⟨10.1007/978-3-319-50106-2_42⟩ |
|
|
Improved algorithm for computing separating linear forms for bivariate systemsISSAC - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan |
|
|
Recognizing shrinkable complexes is NP-completeESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ |
|
|
Rational Univariate Representations of Bivariate Systems and ApplicationsISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.109-116 |
|
|
Separating Linear Forms for Bivariate SystemsISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.117-124 |
|
|
Universal Point Sets for Planar Graph Drawings with Circular ArcsCanadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122 |
|
|
New bivariate system solver and topology of algebraic curves27th European Workshop on Computational Geometry - EuroCG 2011, Mar 2011, Morschach, Switzerland |
|
|
On Point-sets that Support Planar Graphs19th International Symposium on Graph Drawing, Sep 2011, Eindhoven, Netherlands |
|
|
On the Computation of the 3D Visibility Skeleton16th Annual International Computing and Combinatorics Conference - COCOON 2010, Jul 2010, Nha Trang, Vietnam |
|
|
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States. ⟨10.1145/1810959.1810969⟩ |
|
|
Univariate Algebraic Kernel and Application to Arrangements8th International Symposium SEA 2009, Jun 2009, Dortmund, Germany. pp.209-220, ⟨10.1007/978-3-642-02011-7⟩ |
|
|
On the topology of planar algebraic curves25th annual symposium on Computational geometry - SCG 2009, Jun 2009, Aarhus, Denmark. pp.361--370, ⟨10.1145/1542362.1542424⟩ |
|
|
The Voronoi diagram of three arbitrary lines in R325th European Workshop on Computational Geometry - EuroCG'09, Mar 2009, Bruxelles, Belgium. pp.297-300 |
|
|
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n VerticesThe 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩ |
|
|
Predicates for line transversals to lines and line segments in three-dimensional spaceSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩ |
|
|
A CGAL-based Univariate Algebraic Kernel and Application to Arrangements24th European Workshop on Computational Geometry - EuroCG 2008, Mar 2008, Nancy, France. pp.91--94 |
|
|
On The Topology of Planar Algebraic Curves24th European Workshop on Computational Geometry - EuroCG 2008, Mar 2008, Nancy, France. pp.213--216 |
|
|
On the Size of the 3D Visibility Skeleton: Experimental Results16th Annual European Symposium on Algorithms - ESA 2008, Sep 2008, Karlsruhe, Germany. pp.805--816, ⟨10.1007/978-3-540-87744-8_67⟩ |
|
|
Walking Your Dog in the Woods in Polynomial TimeSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.101--109, ⟨10.1145/1377676.1377694⟩ |
|
|
The Voronoi Diagram of Three Lines23rd Annual Symposium on Computational Geometry (SoCG'07), Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.255-264, ⟨10.1145/1247069.1247116⟩ |
|
|
Between umbra and penumbraProceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩ |
|
|
Farthest-Polygon Voronoi Diagrams15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩ |
|
|
Towards an Implementation of the 3D Visibility Skeleton23rd Annual Symposium on Computational Geometry, Jun 2007, Gyeongju, South Korea. pp.131 - 132, ⟨10.1145/1247069.1247094⟩ |
Throwing stones in simple polygons2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), Jun 2006, Hong Kong, China, pp.185-193, ⟨10.1007/11775096_18⟩ |
|
|
|
Predicates for Line Transversals in 3D18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada |
|
|
An Experimental Assessment of the 2D Visibility Complex17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada |
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland |
|
|
Intersecting Quadrics: An Efficient and Exact ImplementationSymposium on Computational Geometry - SoCG'2004, Jun 2004, Brooklyn, NY, United States. pp.419 - 428, ⟨10.1145/997817.997880⟩ |
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩ |
|
|
On the number of line tangents to four triangles in three-dimensional space16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p |
|
|
Orientation des pièces artistiques pour le procédé de Stratoconception10th European Forum on Rapid Prototyping, Sep 2004, Paris, France |
|
|
Near-Optimal Parameterization of the Intersection of Quadrics: Theory and ImplementationInternational Conference on Polynomial System Solving - ICPSS 2004, 2004, Paris, France, 3 p |
|
|
Transversals to Line Segments in R315th Canadian Conference on Computational Geometry - CCCG'2003, 2003, Halifax, Canada, 4 p |
|
|
Near-Optimal Parameterization of the Intersection of Quadrics19th Symposium on Computational Geometry - SoCG 2003, Jun 2003, San Diego, United States. pp.246-255, ⟨10.1145/777792.777830⟩ |
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada |
Géométrie algorithmique pour la CAO et la conception optimale de robots68ème Congrés ACFAS, May 2000, Montréal, Canada |
|
|
|
Locked and Unlocked Polygonal Chains in Three DimensionsSymposium on Discrete Algorithms - SODA'99, Jan 1999, Baltimore, United States. pp.866 - 867 |
|
|
Convexifying Monotone Polygons10th Annual International Symposium on Algorithms & Computation - ISAAC'99, Kamakoti V (IMSC, India) Rangarajan K (MCC, India) Rama R (IIT, Madras, India) Boopal E (IIT, Madras, India), Dec 1999, Chennai, India. 10 p, ⟨10.1007/3-540-46632-0_42⟩ |
|
|
Curvature-Constrained Shortest Paths in a Convex PolygonSymposium on Computational Geometry - SCG 1998, Jun 1998, Mineapolis, United States. pp.392-401, ⟨10.1145/276884.276928⟩ |
|
|
Convexifying Star-Shaped Polygons10th Canadian Conference on Computational Geometry (CCCG'98), 1998, Montreal, Canada. pp.10-12 |
|
|
A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstaclesSymposium on Computational Geometry (SoCG'96), 1996, Philadelphia, United States. pp.242-251, ⟨10.1145/237218.237393⟩ |
|
|
Convex hulls of bounded curvatureCanadian Conference on Computational Geometry (CCCG'96), 1996, Ottawa, Canada. pp.14-19 |
Motion planning of legged robotsWorkshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States |
|
|
|
From spider robots to half disk robotsIEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958 |
|
|
One-Bend Drawing of $K_n$ in 3D, revisitedMichael A. Bekos; Markus Chimani. The 31st International Symposium on Graph Drawing and Network Visualization, Sep 2023, Palermo, Italy. Springer, 2023 |
|
|
On Tangents to Quadric Surfaces2004 |
|
|
Removing self-intersections in 3D meshes while preserving floating-point coordinates2025 |
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge, revisited2023 |
|
|
Isolating the singularities of the plane projection of a generic space curve2020 |