[BOOK][B] Effective computational geometry for curves and surfaces
JD Boissonnat, M Teillaud - 2007 - Springer
Computational geometry emerged as a discipline in the seventies and has had considerable
success in improving the asymptotic complexity of the solutions to basic geometric problems …
success in improving the asymptotic complexity of the solutions to basic geometric problems …
Can we compute the similarity between surfaces?
A suitable measure for the similarity of shapes represented by parameterized curves or
surfaces is the Fréchet distance. Whereas efficient algorithms are known for computing the …
surfaces is the Fréchet distance. Whereas efficient algorithms are known for computing the …
The predicates of the Apollonius diagram: algorithmic analysis and implementation
We study the predicates involved in an efficient dynamic algorithm for computing the
Apollonius diagram in the plane, also known as the additively weighted Voronoi diagram …
Apollonius diagram in the plane, also known as the additively weighted Voronoi diagram …
Real algebraic numbers: Complexity analysis and experimentation
We present algorithmic, complexity and implementation results concerning real root isolation
of a polynomial of degree d, with integer coefficients of bit size≤ τ, using Sturm (-Habicht) …
of a polynomial of degree d, with integer coefficients of bit size≤ τ, using Sturm (-Habicht) …
On the computability of the Fréchet distance between triangulated surfaces
ME Buchin - 2007 - refubium.fu-berlin.de
The Frechet distance is a metric for parameterized curves and surfaces. It is used in shape
matching for measuring the similarity of geometric shapes. For polygonal curves, it can be …
matching for measuring the similarity of geometric shapes. For polygonal curves, it can be …
Univariate polynomial real root isolation: Continued fractions revisited
We present algorithmic, complexity and implementation results concerning real root isolation
of integer univariate polynomials using the continued fraction expansion of real numbers …
of integer univariate polynomials using the continued fraction expansion of real numbers …
Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils
We present here the first classification of pencils of quadrics based on the type of their
intersection in real projective space and we show how this classification can be used to …
intersection in real projective space and we show how this classification can be used to …
On the complexity of real root isolation using Continued Fractions
We present algorithmic, complexity and implementation results concerning real root isolation
of integer univariate polynomials using the continued fraction expansion of real algebraic …
of integer univariate polynomials using the continued fraction expansion of real algebraic …
An exact and efficient approach for computing a cell in an arrangement of quadrics
E Schömer, N Wolpert - Computational Geometry, 2006 - Elsevier
We present an approach for the exact and efficient computation of a cell in an arrangement
of quadric surfaces. All calculations are based on exact rational algebraic methods and …
of quadric surfaces. All calculations are based on exact rational algebraic methods and …
The predicates for the Voronoi diagram of ellipses
This paper examines the computation of the Voronoi diagram of a set of ellipses in the
Euclidean plane. We propose the first complete algorithms, under the exact computation …
Euclidean plane. We propose the first complete algorithms, under the exact computation …