Skip to Main content Skip to Navigation


...
inria-00100887v1  Journal articles
Pankaj K. AgarwalThérèse BiedlSylvain LazardSteve RobbinsSubhash Suri et al.  Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2002, 31 (6), pp.1814-1851. ⟨10.1137/S0097539700374550⟩
...
hal-00827890v1  Conference papers
Pankaj K. AgarwalThérèse BiedlSylvain LazardSteve RobbinsSubhash Suri et al.  Curvature-Constrained Shortest Paths in a Convex Polygon
Symposium on Computational Geometry - SCG 1998, Jun 1998, Mineapolis, United States. pp.392-401, ⟨10.1145/276884.276928⟩
...
inria-00100429v1  Journal articles
Laurent AlonsoFrançois CunySylvain PetitjeanJean-Claude PaulSylvain Lazard et al.  The Virtual Mesh: A Geometric Abstraction for Efficiently Computing Radiosity
ACM Transactions on Graphics, Association for Computing Machinery, 2001, 20 (3), pp.169-201. ⟨10.1145/501786.501789⟩
...
hal-00846953v1  Conference papers
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawings with Circular Arcs
Canadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122
...
hal-00997207v1  Journal articles
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawing with Circular Arcs
Journal of Graph Algorithms and Applications, Brown University, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩
...
hal-01384396v2  Journal articles
Dominique AttaliOlivier DevillersMarc GlisseSylvain Lazard. Recognizing Shrinkable Complexes Is NP-Complete
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩
...
hal-01015747v1  Conference papers
Dominique AttaliOlivier DevillersMarc GlisseSylvain Lazard. Recognizing shrinkable complexes is NP-complete
Proceedings of the 22nd European Symposium on Algorithms, 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩
...
inria-00098832v1  Conference papers
Therese C. BiedlErik D. DemaineSylvain LazardSteven M. RobbinsMichael A. Soss. Convexifying Monotone Polygons
10th 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⟩
...
inria-00098772v2  Conference papers
Thérèse BiedlErik DemaineMartin DemaineSylvain LazardAnna Lubiw et al.  Locked and Unlocked Polygonal Chains in Three Dimensions
Symposium on Discrete Algorithms - SODA'99, Jan 1999, Baltimore, United States. pp.866 - 867
...
inria-00442806v1  Conference papers
Jean-Daniel BoissonnatSylvain Lazard. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
Symposium on Computational Geometry (SoCG'96), 1996, Philadelphia, United States. pp.242-251, ⟨10.1145/237218.237393⟩
...
inria-00442776v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersSylvain Lazard. From spider robots to half disk robots
IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958
...
inria-00442802v1  Conference papers
Jean-Daniel BoissonnatSylvain Lazard. Convex hulls of bounded curvature
Canadian Conference on Computational Geometry (CCCG'96), 1996, Ottawa, Canada. pp.14-19
...
inria-00099289v1  Journal articles
Jean-Daniel BoissonnatOlivier DevillersSylvain Lazard. Motion planning of legged robots
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2000, 30 (1), pp.218-246. ⟨10.1137/S0097539797326289⟩
...
inria-00099509v1  Journal articles
Jean-Daniel BoissonnatSylvain Lazard. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (3), pp.189-229. ⟨10.1142/S0218195903001128⟩
...
inria-00100261v1  Journal articles
Ciprian BorceaXavier GoaocSylvain LazardSylvain Petitjean. Common Tangents to Spheres in $R3$
Discrete and Computational Geometry, Springer Verlag, 2006, 35 (2), pp.287-300. ⟨10.1007/s00454-005-1230-y⟩
...
hal-00809430v1  Conference papers
Yacine BouzidiSylvain LazardMarc PougetFabrice Rouillier. Rational Univariate Representations of Bivariate Systems and Applications
ISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.109-116
...
hal-00809425v1  Conference papers
Yacine BouzidiSylvain LazardMarc PougetFabrice Rouillier. Separating Linear Forms for Bivariate Systems
ISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.117-124
...
inria-00580431v1  Conference papers
Yacine BouzidiSylvain LazardMarc PougetFabrice Rouillier. New bivariate system solver and topology of algebraic curves
27th European Workshop on Computational Geometry - EuroCG 2011, Mar 2011, Morschach, Switzerland
...
hal-00992634v1  Conference papers
Yacine BouzidiSylvain LazardGuillaume MorozMarc PougetFabrice Rouillier. Improved algorithm for computing separating linear forms for bivariate systems
ISSAC - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan
...
hal-01366148v1  Conference papers
David BremnerOlivier DevillersMarc GlisseSylvain LazardGiuseppe Liotta et al.  Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece
...
hal-01529154v2  Journal articles
David BremnerOlivier DevillersMarc GlisseSylvain LazardGiuseppe Liotta et al.  Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩
...
inria-00099449v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  On the Number of Lines Tangent to Four Convex Polyhedra
14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
...
inria-00103916v1  Journal articles
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
...
inria-00103995v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D
Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
...
inria-00000384v1  Journal articles
Hervé BrönnimannHazel EverettSylvain LazardFrank SottileSue Whitesides. Transversals to line segments in three-dimensional space
Discrete and Computational Geometry, Springer Verlag, 2005, 34 (3), pp.381 - 390. ⟨10.1007/s00454-005-1183-1⟩
...
inria-00000598v1  Journal articles
Hervé BrönnimannOlivier DevillersSylvain LazardFrank Sottile. Lines tangent to four triangles in three-dimensional space
Discrete and Computational Geometry, Springer Verlag, 2007, 37 (3), pp.369-380. ⟨10.1007/s00454-006-1278-3⟩
...
inria-00099873v1  Conference papers
Hervé BrönnimannOlivier DevillersSylvain LazardFrank Sottile. On the number of line tangents to four triangles in three-dimensional space
16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p
...
inria-00099479v1  Conference papers
Hervé BronnimannHazel EverettSylvain LazardFrank SottileSue Whitesides. Transversals to Line Segments in R3
15th Canadian Conference on Computational Geometry - CCCG'2003, 2003, Halifax, Canada, 4 p
...
hal-00103047v1  Conference papers
Frédéric CazalsMarc Pouget. Estimating Differential Quantities Using Polynomial Fitting of Osculating Jets
Eurographics Symposium on Geometry Processing, Jun 2003, Aachen, Germany. pp.177-187
...
inria-00329731v1  Journal articles
Frédéric CazalsMarc Pouget. Jet fitting 3: A Generic C++ Package for Estimating the Differential Properties on Sampled Surfaces via Polynomial Fitting
ACM Transactions on Mathematical Software, Association for Computing Machinery, 2008, 35 (3)
...
hal-00103023v1  Journal articles
Frédéric CazalsMarc Pouget. Differential topology and geometry of smooth embedded surfaces: selected topics
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2005, Vol. 15, No. 5, pp.511-536. ⟨10.1142/S0218195905001816⟩
...
inria-00097582v1  Journal articles
Frédéric CazalsMarc Pouget. Estimating Differential Quantities using Polynomial fitting of Osculating Jets
Computer Aided Geometric Design, Elsevier, 2005, 22 (2), pp.121-146
...
inria-00329762v1  Book sections
Frédéric CazalsJean-Charles FaugèreMarc PougetFabrice Rouillier. Ridges and Umbilics of Polynomial Parametric Surfaces
B. Juttler and R. Piene. Geometric Modeling and Algebraic Geometry, Springer, pp.141--159, 2008, 978-3-540-72184-0. ⟨10.1007/978-3-540-72185-7_8⟩
...
inria-00438463v1  Journal articles
Erin Wolf ChambersEric Colin de VerdièreJeff EricksonSylvain LazardFrancis Lazarus et al.  Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time
Computational Geometry, Elsevier, 2010, Special Issue on 24th Annual Symposium on Computational Geometry (SoCG'08), 43 (3), pp.295-311. ⟨10.1016/j.comgeo.2009.02.008⟩
...
inria-00329754v1  Conference papers
Jinsan ChengSylvain LazardLuis PeñarandaMarc PougetFabrice Rouillier et al.  On The Topology of Planar Algebraic Curves
24th European Workshop on Computational Geometry - EuroCG 2008, Mar 2008, Nancy, France. pp.213--216
...
inria-00517175v1  Journal articles
Jinsan ChengSylvain LazardLuis PeñarandaMarc PougetFabrice Rouillier et al.  On the topology of real algebraic plane curves
Mathematics in Computer Science, Springer, 2010, 4 (1), pp.113-137. ⟨10.1007/s11786-010-0044-3⟩
...
inria-00425383v1  Conference papers
Jinsan ChengSylvain LazardLuis PeñarandaMarc PougetFabrice Rouillier et al.  On the topology of planar algebraic curves
25th annual symposium on Computational geometry - SCG 2009, Jun 2009, Aarhus, Denmark. pp.361--370, ⟨10.1145/1542362.1542424⟩
...
inria-00189038v1  Conference papers
Otfried CheongHazel EverettMarc GlisseJoachim GudmundssonSamuel Hornus et al.  Farthest-Polygon Voronoi Diagrams
15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩
...
inria-00442816v3  Journal articles
Otfried CheongHazel EverettMarc GlisseJoachim GudmundssonSamuel Hornus et al.  Farthest-Polygon Voronoi Diagrams
Computational Geometry, Elsevier, 2011, Computational Geometry, Theory and Applications, 44 (4), pp.14. ⟨10.1016/j.comgeo.2010.11.004⟩
...
inria-00434090v1  Journal articles
Otfried CheongHazel EverettHyo-Sil KimSylvain LazardRené Schott. Parabola separation queries and their application to stone throwing
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.349-360. ⟨10.1142/S0218195907002379⟩
...
inria-00099245v1  Book sections
Hafsa DeddiHazel EverettSylvain Lazard. Interpolation problem with curvature constraints
A. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000
...
inria-00187253v1  Conference papers
Julien DemouthOlivier DevillersHazel EverettMarc GlisseSylvain Lazard et al.  Between umbra and penumbra
Proceedings 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⟩
...
inria-00000374v1  Conference papers
Olivier DevillersHazel EverettSylvain LazardMaria PentchevaStephen Wismath. Drawing $K_n$ in Three Dimensions with One Bend per Edge
13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland
...
inria-00099810v1  Journal articles
Olivier DevillersVida DujmovicHazel EverettXavier GoaocSylvain Lazard et al.  The expected number of 3D visibility events is linear
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩
...
hal-01727375v1  Conference papers
Olivier DevillersSylvain LazardWilliam Lenhart. 3D Snap Rounding
Proceedings of the 34th International Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.30:1 - 30:14, ⟨10.4230/LIPIcs.SoCG.2018.30⟩
...
hal-01698928v1  Reports
Olivier DevillersSylvain LazardWilliam Lenhart. 3D Snap Rounding
[Research Report] RR-9149, Inria Nancy - Grand Est. 2018, pp.1-22
...
inria-00103923v1  Journal articles
Olivier DevillersHazel EverettSylvain LazardMaria PentchevaSteve Wismath. Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295
...
hal-02549290v1  Journal articles
Olivier DevillersSylvain LazardWilliam Lenhart. Rounding meshes in 3D
Discrete and Computational Geometry, Springer Verlag, 2020, ⟨10.1007/s00454-020-00202-2⟩
...
inria-00336256v1  Conference papers
Olivier DevillersMarc GlisseSylvain Lazard. Predicates for line transversals to lines and line segments in three-dimensional space
Proceedings of the 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩
...
hal-02406758v1  Conference papers
Sény DiattaGuillaume MorozMarc Pouget. Reliable Computation of the Singularities of the Projection in R3 of a Generic Surface of R4
MACIS 2019 - Mathematical Aspects of Computer and Information Sciences, Nov 2019, Gebze-Istanbul, Turkey
...
hal-00643824v1  Conference papers
Vida DujmovićWill EvansSylvain LazardWilliam LenhartGiuseppe Liotta et al.  On Point-sets that Support Planar Graphs
19th International Symposium on Graph Drawing, Sep 2011, Eindhoven, Netherlands
...
inria-00100878v1  Book sections
Laurent DupontDaniel LazardSylvain LazardSylvain Petitjean. Towards the Robust Intersection of Implicit Quadrics
J. Winkler and M. Niranjan. Uncertainty in Geometric Computations, Kluwer Academic Publishers, pp.59-68, 2002, International Series in Engineering and Computer Science
...
inria-00099789v1  Conference papers
Laurent DupontDaniel LazardSylvain LazardSylvain Petitjean. Near-Optimal Parameterization of the Intersection of Quadrics
19th Symposium on Computational Geometry - SoCG 2003, Jun 2003, San Diego, United States. pp.246-255, ⟨10.1145/777792.777830⟩
...
inria-00099925v1  Conference papers
Laurent DupontSylvain LazardDaniel LazardSylvain Petitjean. Near-Optimal Parameterization of the Intersection of Quadrics: Theory and Implementation
International Conference on Polynomial System Solving - ICPSS 2004, 2004, Paris, France, 3 p
...
inria-00186085v1  Conference papers
Hazel EverettDaniel LazardSylvain LazardMohab Safey El Din. The Voronoi Diagram of Three Lines
23rd 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⟩
...
inria-00000373v2  Conference papers
Hazel EverettSylvain LazardSylvain PetitjeanLinqiao Zhang. An Experimental Assessment of the 2D Visibility Complex
17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada
...
inria-00189036v1  Conference papers
Hazel EverettSylvain LazardGiuseppe LiottaSteve Wismath. Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices
The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩
...
inria-00442788v1  Conference papers
Hazel EverettSylvain LazardSteve RobbinsH. SchröderSue Whitesides. Convexifying Star-Shaped Polygons
10th Canadian Conference on Computational Geometry (CCCG'98), 1998, Montreal, Canada. pp.10-12
...
inria-00103945v1  Conference papers
Hazel EverettSylvain LazardBill LenhartJeremy RedburnLinqiao Zhang. Predicates for Line Transversals in 3D
18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada
...
inria-00103926v1  Journal articles
Hazel EverettSylvain LazardSylvain PetitjeanLinqiao Zhang. On the Expected Size of the 2D Visibility Complex
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.361-381. ⟨10.1142/S0218195907002380⟩
...
inria-00431518v1  Journal articles
Hazel EverettDaniel LazardSylvain LazardMohab Safey El Din. The Voronoi diagram of three lines
Discrete and Computational Geometry, Springer Verlag, 2009, 42 (1), pp.94-130. ⟨10.1007/s00454-009-9173-3⟩
...
inria-00425378v1  Conference papers
Hazel EverettChristian GillotDaniel LazardSylvain LazardMarc Pouget. The Voronoi diagram of three arbitrary lines in R3
25th European Workshop on Computational Geometry - EuroCG'09, Mar 2009, Bruxelles, Belgium. pp.297-300
...
inria-00442751v2  Conference papers
Marc GlisseSylvain Lazard. On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States