Dynamic convex hull

•  Delaunay triangulation

  In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation; they tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934 .

  

  0.0%
  

  100.0%
  

  0.0%
  
•  Binary space partitioning

  Binary space partitioning (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree. In other words, it is a method of breaking up intricately shaped polygons into smaller and simpler polygons in such a way as to eliminate all reflex angles (angles which measure greater than 180°) from the original shape.

  

  100.0%
  

  0.0%
  

  0.0%
  
•  Computational geometry

  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 problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry.

  

  0.0%
  

  0.0%
  

  100.0%
  
•  Voronoi diagram

  In mathematics, a Voronoi diagram is a special kind of decomposition of a metric space determined by distances to a specified discrete set of objects in the space, e.g. , by a discrete set of points. It is named after Georgy Voronoi, also called a Voronoi tessellation, a Voronoi decomposition, or a Dirichlet tessellation, In the simplest case, we are given a set of points S in the plane, which are the Voronoi sites.

  

  0.0%
  

  100.0%
  

  0.0%
  
•  Geometric primitive

  The term geometric primitive in computer graphics and CAD systems is used in various senses, with common meaning of atomic geometric objects the system can handle (draw, store). Sometimes the subroutines that draw the corresponding objects are called "geometric primitives" as well. The most "primitive" primitives are point and straight line segment, which were all that early vector graphics systems had.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Gift wrapping algorithm

  The gift wrapping algorithm is a simple algorithm for computing the convex hull of a given set of points.

  

  0.0%
  

  0.0%
  

  100.0%
  
•  Graham scan

  The Graham scan is a method of computing the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald Graham, who published the original algorithm in 1972. The algorithm finds all vertices of the convex hull ordered along its boundary. It may also be easily modified to report all input points that lie on the boundary of their convex hull.

  

  100.0%
  

  0.0%
  

  0.0%
  
•  Geometric hashing

  In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation. (Extensions exist to some other object representations and transformations. ) In an off-line step, the objects are encoded by treating each (non-collinear) triple of points as a geometric basis. The remaining points can be represented in an invariant fashion with respect to this basis using two parameters.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  De Boor's algorithm

  In the mathematical subfield of numerical analysis the de Boor's algorithm is a fast and numerically stable algorithm for evaluating spline curves in B-spline form. It is a generalization of the de Casteljau's algorithm for Bezier curves. The algorithm was devised by Carl R. de Boor. Simplified, potentially faster variants of the de Boor algorithm have been created but they suffer from comparatively lower stability.

  

  0.0%
  

  50.0%
  

  50.0%
  
•  Minkowski addition

  In geometry, the Minkowski sum — also known as dilation — of two sets A and B in Euclidean space is the result of adding every element of A to every element of B, i.e. the set For example, if we have two 2-simplices, with points represented by A = and B =, then the Minkowski sum is A + B =, which looks like a hexagon, with three 'repeated' points at (1,0). This defines a binary operation called Minkowski addition, named after Hermann Minkowski.

  

  0.0%
  

  50.0%
  

  50.0%
  

• Geometric algorithms by likeorhate

Register now, and make your vote count more!

•  Vilnius

  Vilnius (see also other names, is the capital of Lithuania, and its largest city, with a population of 555,613 as of 2008. It is the seat of the Vilnius city municipality and of the Vilnius district municipality. It is also the capital of Vilnius County.

  

  20.0%
  

  60.0%
  

  20.0%
  
•  Geovisualization

  Geovisualization, short for Geographic Visualization, refers to a set of tools and techniques supporting geospatial data analysis through the use of interactive visualization. Like the related fields of scientific visualization and information visualization geovisualization emphasizes knowledge construction over knowledge storage or information transmission.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Krottenkopf

  The Krottenkopf (2,086 metres) is a mountain within the Estergebirge in the district of Garmisch-Partenkirchen.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Franco Forelli

  

  37.9%
  

  31.0%
  

  31.0%
  
•  Overo lethal white syndrome

  

  47.4%
  

  36.8%
  

  15.8%