DLDaniel Lazard
Daniel Lazard
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daniel Lazard has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
2015 Hal
1 shared publicationDaniel Mobile
1 shared publication- Fabrice Rouillier
HSE University Moscow Russia
1 shared publication - François Boulier
Université de Lille 1
1 shared publication - François Ollivier
LIX UMR CNRS 7161 École polytechnique 91128 Palaiseau cedex France
1 shared publication - Jin-San Cheng
Academy of Mathematics and Systems Science Chinese Academy of Sciences
1 shared publication
Latest Publications
- Open Access
Certified Rational Parametric Approximation of Real Algebraic Space Curves with Local Generic Position Method
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the case of dimension one. By certified, we mean the approximation curve and the original curve have the same topology and their Hausdauff distance is smaller than a given precision. Thus, the method also gives a new algorithm to compute the topology for space algebraic curves. The main advantage of the algorithm, inhering from the local generic method, is that topology computation and approximation for a space curve is directly reduced to the same tasks for two plane curves. In particular, the error bound of the approximation space curve is obtained from the error bounds of the approximation plane curves explicitly. Nontrivial examples are used to show the effectivity of the method.Open AccessCertified Rational Parametric Approximation of Real Algebraic Space Curves with Local Generic Position Method
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the case of dimension one. By certified, we mean the approximation curve and the original curve have the same topology and their Hausdauff distance is smaller than a given precision. Thus, the method also gives a new algorithm to compute the topology for space algebraic curves. The main advantage of the algorithm, inhering from the local generic method, is that topology computation and approximation for a space curve is directly reduced to the same tasks for two plane curves. In particular, the error bound of the approximation space curve is obtained from the error bounds of the approximation plane curves explicitly. Nontrivial examples are used to show the effectivity of the method. - 6 October 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 4 (1) , 93-112
CAD and Topology of Semi-Algebraic Sets
- 6 October 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 4 (1) , 93-112
CAD and Topology of Semi-Algebraic Sets
- 30 September 2009
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 44 (9) , 1176-1193
Iterated discriminants
- 30 September 2009
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 44 (9) , 1176-1193
Iterated discriminants
- 7 March 2009
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 20 (1) , 73-121
Computing representations for radicals of finitely generated differential ideals
- 7 March 2009
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 20 (1) , 73-121
Computing representations for radicals of finitely generated differential ideals
- 23 October 2007
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 1 (2) , 291-304
Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process
- 23 October 2007
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 1 (2) , 291-304
Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process
- 3 September 2004
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 67 (1-2) , 67-84
Injectivity of real rational mappings: the case of a mixture of two Gaussian laws
- 3 September 2004
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 67 (1-2) , 67-84
Injectivity of real rational mappings: the case of a mixture of two Gaussian laws
- 1 January 2002
- Published by Springer Nature
- p. 59-68
Towards the Robust Intersection of Implicit Quadrics
- 1 January 2002
- Published by Springer Nature
- p. 59-68
Towards the Robust Intersection of Implicit Quadrics