File:Voronoi green sibson.svg

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Original file ‎(SVG file, nominally 1,074 × 1,006 pixels, file size: 140 KB)

Captions

Captions

Add a one-line explanation of what this file represents

Summary[edit]

Description
Français : Algorithme de Green et Sibson pour la construction du diagramme de Voronoï (algorithme incrémental).
  1. Le diagramme est déterminé pour les points p1 à p10. On ajoute le point p11 :
    • il se trouve dans le domaine du point q (= p5) ;
    • la médiatrice de [p11q] scinde le domaine de q, les extrémités de cette nouvelle paroi sont notées x1 et x2.
  2. Le point x2 appartient aussi au domaine du point r (= p2). La médiatrice de [p11r] scinde le domaine de r, et ainsi de suite.
  3. Diagramme final.
English: Green and Sibson to build the Voronoi diagram (incremental algorithm).
  • The Voronoi diagram is buikt for the points p1 to p10. We add the point p11:
    • it stands in the cell of the point q (= p5);
    • the bissecting line of [p11q] splits the cell of q, the ends of this new cell wall are called x1 and x2.
  • he point x2 is also in the cell of r (= p2). The bissecting line of [p11r] splits the cell of r, and so on.
  • Final Voronoi diagram.
    		•
    Date
    Source Own work. Data set from File:Smallest circle problem.svg. Algorithm from Green, Peter and Sibson, Robin, Computing Dirichlet tessellations in the plane, in Computer Journal, vol. 21, no 2, 1978, p. 168-173
    Author Cdang


     
    This W3C-unspecified vector image was created with Inkscape .

    Licensing[edit]

    I, the copyright holder of this work, hereby publish it under the following licenses:
    GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
    w:en:Creative Commons
    attribution share alike
    This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported, 2.5 Generic, 2.0 Generic and 1.0 Generic license.
    You are free:
    • to share – to copy, distribute and transmit the work
    • to remix – to adapt the work
    Under the following conditions:
    • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
    • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
    You may select the license of your choice.

    File history

    Click on a date/time to view the file as it appeared at that time.

    Date/TimeThumbnailDimensionsUserComment
    current12:53, 15 January 2013Thumbnail for version as of 12:53, 15 January 20131,074 × 1,006 (140 KB)Cdang (talk | contribs){{Information |description={{fr|1=Algorithme de Green et Sibson pour la construction du diagramme de Voronoï (algorithme incrémental). # Le diagramme est déterminé pour les points ''p''<sub>1</sub> à ''p''<sub>10</sub>. On ajoute le point ''p''<su...

    You cannot overwrite this file.

    There are no pages that use this file.

    File usage on other wikis

    The following other wikis use this file:

    Metadata

    This file contains additional information such as Exif metadata which may have been added by the digital camera, scanner, or software program used to create or digitize it. If the file has been modified from its original state, some details such as the timestamp may not fully reflect those of the original file. The timestamp is only as accurate as the clock in the camera, and it may be completely wrong.

    Retrieved from "https://commons.wikimedia.org/w/index.php?title=File:Voronoi_green_sibson.svg&oldid=454974673"