Voronoi diagram

Voronoi diagram
A diagram that assigns a set of points in a plane into an equal number of cells, such that each point p is inside a cell consisting of all regions closer to p than to any other point.

Wikipedia foundation.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Voronoi diagram — The Voronoi diagram of a random set of points in the plane (all points lie within the image). In mathematics, a Voronoi diagram is a special kind of decomposition of a given space, e.g., a metric space, determined by distances to a specified… …   Wikipedia

  • Voronoi diagram — Diagramme de Voronoï Un diagramme de Voronoï. En mathématiques, un diagramme de Voronoï (aussi appelé décomposition de Voronoï, partition de Voronoï ou encore polygones de Voronoï) représente une décomposition particulière d’un espace métrique… …   Wikipédia en Français

  • Voronoi diagram — …   Deutsch Wikipedia

  • Voronoi-Diagramm — Als Voronoi Diagramm, auch Thiessen Polygonen oder Dirichlet Zerlegung, wird eine Zerlegung des Raumes in Regionen bezeichnet, die durch eine vorgegebene Menge an Punkten des Raumes, hier als Zentren bezeichnet, bestimmt werden. Jede Region wird… …   Deutsch Wikipedia

  • Voronoi-Interpolation — Die Voronoi Interpolation (engl. natural neighbor interpolation „Interpolation durch natürliche Nachbarn“), auch Sibson Interpolation genannt, ist ein Interpolationsverfahren, das mit Voronoi Diagrammen arbeitet. Prinzip Gegeben sind Punkte in… …   Deutsch Wikipedia

  • Diagram — Further information: Chart Sample flowchart representing the decision process to add a new article to Wikipedia. A diagram is a two dimensional geometric symbolic representation of information according to some visualization technique. Sometimes …   Wikipedia

  • Mathematical diagram — This article is about general diagrams in mathematics. For diagrams in the category theoretical sense, see Diagram (category theory). Euclid s Elements, ms. from Lüneburg, A.D. 1200 Mathematical diagrams are diagrams in the field of mathematics,… …   Wikipedia

  • Fortune's algorithm — is a plane sweep algorithm for generating a Voronoi diagram from a set of points in a plane using O( n log n ) time and O( n ) space. [cite book|author = Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf | year = 2000 | title …   Wikipedia

  • Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown 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… …   Wikipedia

  • Lloyd's algorithm — In computer graphics and electrical engineering, Lloyd s algorithm, also known as Voronoi iteration or relaxation, is a method for evenly distributing samples or objects, usually points.Lloyd s algorithm starts with an initial distribution of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”