0000000000144494
AUTHOR
Laurent Dupont
showing 3 related works from this author
Selective Cobalt over Nickel separation using neat and confined ionic liquids
2020
International audience; Task Specific Ionic Liquids (TSILs) generated by association between tetraalkylammonium cations and coordinating anions such as dicyanamide (Dca-) and thiocyanate (SCN-) were used for the selective separation of Ni(II) over Co(II). SCN-based TSIL presents higher extraction efficiency than the Dca-based one towards Co(II) (E = 85.4 % vs 54.6 %) and Ni (II) (E = 22 % vs 0.5%) but lower separation factors (βCo/Ni = 21 vs 239). Interestingly, extraction of Co(II) and Ni(II) in Dca-based TSIL can be enhanced using salts with chaotropic anions such as NaNO3 (E > 90 % for Co(II) and E = 85% for Ni(II)). The use of NaCl allows, moreover, the efficient separation of both ions…
A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics
2011
International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always comp…
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
2007
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…