[图书][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
[图书][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 …
Classroom examples of robustness problems in geometric computations
The algorithms of computational geometry are designed for a machine model with exact real
arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause …
arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause …
Algorithm engineering–an attempt at a definition
P Sanders - Efficient Algorithms: Essays Dedicated to Kurt …, 2009 - Springer
This paper defines algorithm engineering as a general methodology for algorithmic
research. The main process in this methodology is a cycle consisting of algorithm design …
research. The main process in this methodology is a cycle consisting of algorithm design …
Fast and exact geometric analysis of real algebraic plane curves
A Eigenwillig, M Kerber, N Wolpert - Proceedings of the 2007 …, 2007 - dl.acm.org
An algorithm is presented for the geometric analysis of an algebraic curve f (x, y)= 0 in the
real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the plane …
real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the plane …
[图书][B] Algorithm Engineering
M Müller-Hannemann, S Schirra - 2001 - Springer
The systematic development of efficient algorithms has become a key technology for all
kinds of ambitious and innovative computer applications. With major parts of algorithmic …
kinds of ambitious and innovative computer applications. With major parts of algorithmic …
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) …
Real root isolation for exact and approximate polynomials using Descartes' rule of signs
A Eigenwillig - 2008 - publikationen.sulb.uni-saarland.de
Collins und Akritas (1976) have described the Descartes method for isolating the real roots
of an integer polynomial in one variable. This method recursively subdivides an initial …
of an integer polynomial in one variable. This method recursively subdivides an initial …
[图书][B] Computing handbook: computer science and software engineering
T Gonzalez, J Diaz-Herrera, A Tucker - 2014 - books.google.com
Computing Handbook, Third Edition: Computer Science and Software Engineering mirrors
the modern taxonomy of computer science and software engineering as described by the …
the modern taxonomy of computer science and software engineering as described by the …
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
We present the first exact, complete and efficient implementation that computes for a given
set P= p1,..., pn of quadric surfaces the planar map induced by all intersection curves p1∩ …
set P= p1,..., pn of quadric surfaces the planar map induced by all intersection curves p1∩ …