This article is about the book. For the field, see computational geometry.
Algorithmic Geometry is a textbook on computational geometry. It was originally written in the French language by Jean-Daniel Boissonnat and Mariette Yvinec, and published as Géometrie algorithmique by Edusciences in 1995. It was translated into English by Hervé Brönnimann, with improvements to some proofs and additional exercises, and published by the Cambridge University Press in 1998.[1][2][3]
^Cite error: The named reference zbl was invoked but never defined (see the help page).
^Cite error: The named reference lms was invoked but never defined (see the help page).
^Cite error: The named reference mr was invoked but never defined (see the help page).
and 25 Related for: Algorithmic Geometry information
AlgorithmicGeometry is a textbook on computational geometry. It was originally written in the French language by Jean-Daniel Boissonnat and Mariette Yvinec...
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical...
Geometry (from Ancient Greek γεωμετρία (geōmetría) 'land measurement'; from γῆ (gê) 'earth, land', and μέτρον (métron) 'a measure') is a branch of mathematics...
Algebraic geometry is a branch of mathematics which uses abstract algebraic techniques, mainly from commutative algebra, to solve geometrical problems...
In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface...
Range Searching". Jean-Daniel Boissonnat; Mariette Yvinec (1998). AlgorithmicGeometry. Cambridge University Press. ISBN 0-521-56529-4. Translation of a...
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed...
applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of...
computational geometry and computational complexity theory. A primary concern of algorithmic topology, as its name suggests, is to develop efficient algorithms for...
as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including...
In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles...
In computational geometry, the gift wrapping algorithm is an algorithm for computing the convex hull of a given set of points. In the two-dimensional...
The Computational GeometryAlgorithms Library (CGAL) is an open source software library of computational geometryalgorithms. While primarily written in...
Digital geometry deals with discrete sets (usually discrete point sets) considered to be digitized models or images of objects of the 2D or 3D Euclidean...
Algorithmic art or algorithm art is art, mostly visual art, in which the design is generated by an algorithm. Algorithmic artists are sometimes called...
Taxicab geometry or Manhattan geometry is geometry where the familiar Euclidean distance is ignored, and the distance between two points is instead defined...
Euclidean geometry is a mathematical system attributed to ancient Greek mathematician Euclid, which he described in his textbook on geometry, Elements...
convolving a surface geometry with a blur kernel formed using the Laplace-Beltrami operator. Applications of geometry processing algorithms already cover a...
Schwarzkopf, Computational Geometry - Algorithms and Applications, Second Edition, 2000 Jon Louis Bentley and Thomas A. Ottmann, Algorithms for Reporting and Counting...
and verification, algorithmic game theory, machine learning, computational biology, computational economics, computational geometry, and computational...
superseded the fixed-function pipeline of the past that only allowed for common geometry transforming and pixel-shading functions; with shaders, customized effects...
are used in analyzing VLSI electronic circuits. Computational geometry applies algorithms to geometrical problems and representations of geometrical objects...
In computational geometry, the method of rotating calipers is an algorithm design technique that can be used to solve optimization problems including...
flood fill algorithm is a simple but relatively robust algorithm that works for intricate geometries and can determine which part of the (target) area that...
Global Information