Table of Contents
20 relations: Algorithm, Arrangement of hyperplanes, Cambridge University Press, Computational complexity theory, Computational geometry, Convex hull, Convex hull algorithms, Data structure, Delaunay triangulation, French language, Jean-Daniel Boissonnat, Linear programming, London Mathematical Society, Mariette Yvinec, Mathematical Reviews, Peter McMullen, Point-set triangulation, Randomized algorithm, Voronoi diagram, ZbMATH Open.
Algorithm
In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.
See Algorithmic Geometry and Algorithm
Arrangement of hyperplanes
In geometry and combinatorics, an arrangement of hyperplanes is an arrangement of a finite set A of hyperplanes in a linear, affine, or projective space S. Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties of the complement, M(A), which is the set that remains when the hyperplanes are removed from the whole space.
See Algorithmic Geometry and Arrangement of hyperplanes
Cambridge University Press
Cambridge University Press is the university press of the University of Cambridge.
See Algorithmic Geometry and Cambridge University Press
Computational complexity theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other.
See Algorithmic Geometry and Computational complexity theory
Computational geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry.
See Algorithmic Geometry and Computational geometry
Convex hull
In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. Algorithmic Geometry and convex hull are computational geometry.
See Algorithmic Geometry and Convex hull
Convex hull algorithms
Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science.
See Algorithmic Geometry and Convex hull algorithms
Data structure
In computer science, a data structure is a data organization, and storage format that is usually chosen for efficient access to data.
See Algorithmic Geometry and Data structure
Delaunay triangulation
In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles whose circumcircles do not contain any of the points.
See Algorithmic Geometry and Delaunay triangulation
French language
French (français,, or langue française,, or by some speakers) is a Romance language of the Indo-European family.
See Algorithmic Geometry and French language
Jean-Daniel Boissonnat
Jean-Daniel Boissonnat (born 18 May 1953) is a French computer scientist, who works as a director of research at the French Institute for Research in Computer Science and Automation (INRIA).
See Algorithmic Geometry and Jean-Daniel Boissonnat
Linear programming
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements and objective are represented by linear relationships.
See Algorithmic Geometry and Linear programming
London Mathematical Society
The London Mathematical Society (LMS) is one of the United Kingdom's learned societies for mathematics (the others being the Royal Statistical Society (RSS), the Institute of Mathematics and its Applications (IMA), the Edinburgh Mathematical Society and the Operational Research Society (ORS).
See Algorithmic Geometry and London Mathematical Society
Mariette Yvinec
Mariette Yvinec is a French researcher in computational geometry at the French Institute for Research in Computer Science and Automation (INRIA) in Sophia Antipolis.
See Algorithmic Geometry and Mariette Yvinec
Mathematical Reviews
Mathematical Reviews is a journal published by the American Mathematical Society (AMS) that contains brief synopses, and in some cases evaluations, of many articles in mathematics, statistics, and theoretical computer science.
See Algorithmic Geometry and Mathematical Reviews
Peter McMullen
Peter McMullen (born 11 May 1942) is a British mathematician, a professor emeritus of mathematics at University College London.
See Algorithmic Geometry and Peter McMullen
Point-set triangulation
A triangulation of a set of points \mathcal in the Euclidean space \mathbb^d is a simplicial complex that covers the convex hull of \mathcal, and whose vertices belong to \mathcal.
See Algorithmic Geometry and Point-set triangulation
Randomized algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure.
See Algorithmic Geometry and Randomized algorithm
Voronoi diagram
In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. Algorithmic Geometry and Voronoi diagram are computational geometry.
See Algorithmic Geometry and Voronoi diagram
ZbMATH Open
zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and abstracts for articles in pure and applied mathematics, produced by the Berlin office of FIZ Karlsruhe – Leibniz Institute for Information Infrastructure GmbH.
See Algorithmic Geometry and ZbMATH Open