Robust algebraic methods for geometric computing

Angelos Mantzaflaris 1
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : Geometric computation in computer aided geometric design and solid modeling calls for solving non-linear polynomial systems in an approximate-yetcertified manner. We introduce new subdivision algorithms that tackle this fundamental problem. In particular, we generalize the univariate so-called continued fraction solver to general dimension. Fast bounding functions, unicity tests, projection and preconditioning are employed to speed up convergence. Apart from practical experiments, we provide theoretical bit complexity estimates, as well as bounds in the real RAM model, by means of real condition numbers. A main bottleneck for any real solving method is singular isolated points. We employ local inverse systems and certified numerical computations to provide certification criteria to treat singular solutions. In doing so, we are able to check existence and uniqueness of singularities of a given multiplicity structure using verification methods, based on interval arithmetic and fixed point theorems. Two major geometric applications are undertaken. First, the approximation of planar semi-algebraic sets, commonly occurring in constraint geometric solving. We present an efficient algorithm to identify connected components and, for a given precision, to compute polygonal and isotopic approximation of the exact set. Second, we present an algebraic framework to compute generalized Voronoï diagrams, that is applicable to any diagram type in which the distance from a site can be expressed by a bi-variate polynomial function (anisotropic, power diagram etc). In cases where this is not possible (eg. Apollonius diagram, VD of ellipses and so on), we extend the theory to implicitly given distance functions.
Complete list of metadatas

Cited literature [116 references]  Display  Hide  Download


https://tel.archives-ouvertes.fr/tel-00651672
Contributor : Angelos Mantzaflaris <>
Submitted on : Wednesday, December 14, 2011 - 8:21:36 AM
Last modification on : Thursday, October 24, 2019 - 10:14:04 PM
Long-term archiving on : Thursday, March 15, 2012 - 2:21:14 AM

Identifiers

  • HAL Id : tel-00651672, version 1

Collections

Citation

Angelos Mantzaflaris. Robust algebraic methods for geometric computing. Symbolic Computation [cs.SC]. Université Nice Sophia Antipolis, 2011. English. ⟨tel-00651672⟩

Share

Metrics

Record views

559

Files downloads

709