Voronoidiagram

FromWikipedia,thefreeencyclopedia

Inmathematics,aVoronoidiagramisapartitioningofaplaneintoregionsbased
ondistancetopointsinaspecificsubsetoftheplane.Thatsetofpoints(called
seeds,sites,orgenerators)isspecifiedbeforehand,andforeachseedthereisa
correspondingregionconsistingofallpointsclosertothatseedthantoanyother.
TheseregionsarecalledVoronoicells.TheVoronoidiagramofasetofpointsis
dualtoitsDelaunaytriangulation.

ItisnamedafterGeorgyVoronoi,andisalsocalledaVoronoitessellation,a
Voronoidecomposition,aVoronoipartition,oraDirichlettessellation(after
PeterGustavLejeuneDirichlet).Voronoidiagramshavepracticalandtheoretical
applicationstoalargenumberoffields,mainlyinscienceandtechnologybutalso
includingvisualart.[1][2]
20pointsandtheirVoronoicells
(largerversionbelow).
Contents
1 Thesimplestcase
2 Formaldefinition
3 Illustration
4 Properties
5 Historyandresearch
6 Examples
7 HigherorderVoronoidiagrams
7.1 FarthestpointVoronoidiagram
8 Generalizationsandvariations
9 Applications
9.1 Naturalsciences
9.2 Health
9.3 Engineering
9.4 Geometry
9.5 Informatics
10 Algorithms
11 Seealso
12 Notes
13 References
14 Externallinks

Thesimplestcase
Inthesimplestcase,showninthefirstpicture,wearegivenafinitesetofpoints{p1,,pn}intheEuclideanplane.In
thiscaseeachsitepkissimplyapoint,anditscorrespondingVoronoicellRkconsistsofeverypointintheEuclidean
planewhosedistancetopkislessthanorequaltoitsdistancetoanyotherpk.Eachsuchcellisobtainedfromthe
intersectionofhalfspaces,andhenceitisaconvexpolygon.ThelinesegmentsoftheVoronoidiagramareallthepoints
intheplanethatareequidistanttothetwonearestsites.TheVoronoivertices(nodes)arethepointsequidistanttothree
(ormore)sites.

Formaldefinition
Let beametricspacewithdistancefunction .Let beasetofindicesandlet beatuple(orderedcollection)of
nonemptysubsets(thesites)inthespace .TheVoronoicell,orVoronoiregion, ,associatedwiththesite istheset
ofallpointsin whosedistanceto isnotgreaterthantheirdistancetotheothersites ,where isanyindexdifferent
from .Inotherwords,if denotesthedistancebetweenthepoint andthesubset ,then
TheVoronoidiagramissimplythetupleofcells .Inprinciplesomeofthesitescanintersectandevencoincide
(anapplicationisdescribedbelowforsitesrepresentingshops),butusuallytheyareassumedtobedisjoint.Inaddition,
infinitelymanysitesareallowedinthedefinition(thissettinghasapplicationsingeometryofnumbersand
crystallography),butagain,inmanycasesonlyfinitelymanysitesareconsidered.

IntheparticularcasewherethespaceisafinitedimensionalEuclideanspace,eachsiteisapoint,therearefinitelymany
pointsandallofthemaredifferent,thentheVoronoicellsareconvexpolytopesandtheycanberepresentedina
combinatorialwayusingtheirvertices,sides,2dimensionalfaces,etc.Sometimestheinducedcombinatorialstructureis
referredtoastheVoronoidiagram.However,ingeneraltheVoronoicellsmaynotbeconvexorevenconnected.

IntheusualEuclideanspace,wecanrewritetheformaldefinitioninusualterms.EachVoronoipolygon isassociated
withageneratorpoint .Let thesetofallpointsintheEuclideanspace.Let beapointthatgeneratesitsVoronoi
region , thatgenerates ,and thatgenerates ,andsoon.Then,asexpressedbyTranetal[3]"alllocationsinthe
VoronoipolygonareclosertothegeneratorpointofthatpolygonthananyothergeneratorpointintheVoronoidiagram
inEuclidianplane".

Illustration
Asasimpleillustration,consideragroupofshopsinacity.Supposewewanttoestimatethenumberofcustomersofa
givenshop.Withallelsebeingequal(price,products,qualityofservice,etc.),itisreasonabletoassumethatcustomers
choosetheirpreferredshopsimplybydistanceconsiderations:theywillgototheshoplocatednearesttothem.Inthis
casetheVoronoicell ofagivenshop canbeusedforgivingaroughestimateonthenumberofpotentialcustomers
goingtothisshop(whichismodeledbyapointinourcity).

Formostcities,thedistancebetweenpointscanbemeasuredusingthefamiliarEuclideandistance:
ortheManhattandistance:
.ThecorrespondingVoronoidiagramslookdifferentfordifferentdistance
metrics.

Voronoidiagramsof20pointsundertwodifferentmetrics

Euclideandistance Manhattandistance

Properties
 ThedualgraphforaVoronoidiagram(inthecaseofaEuclideanspacewithpointsites)correspondstothe
Delaunaytriangulationforthesamesetofpoints.
TheclosestpairofpointscorrespondstotwoadjacentcellsintheVoronoidiagram.
AssumethesettingistheEuclideanplaneandagroupofdifferentpointsaregiven.Thentwopointsareadjacent
ontheconvexhullifandonlyiftheirVoronoicellsshareaninfinitelylongside.
Ifthespaceisanormedspaceandthedistancetoeachsiteisattained(e.g.,whenasiteisacompactsetoraclosed
ball),theneachVoronoicellcanberepresentedasaunionoflinesegmentsemanatingfromthesites.[4]Asshown
there,thispropertydoesnotnecessarilyholdwhenthedistanceisnotattained.
Underrelativelygeneralconditions(thespaceisapossiblyinfinitedimensionaluniformlyconvexspace,therecan
beinfinitelymanysitesofageneralform,etc.)Voronoicellsenjoyacertainstabilityproperty:asmallchangein
theshapesofthesites,e.g.,achangecausedbysometranslationordistortion,yieldsasmallchangeintheshapeof
theVoronoicells.ThisisthegeometricstabilityofVoronoidiagrams.[5]Asshownthere,thispropertydoesnot
holdingeneral,evenifthespaceistwodimensional(butnonuniformlyconvex,and,inparticular,nonEuclidean)
andthesitesarepoints.

Historyandresearch
InformaluseofVoronoidiagramscanbetracedbacktoDescartesin1644.PeterGustavLejeuneDirichletused2
dimensionaland3dimensionalVoronoidiagramsinhisstudyofquadraticformsin1850.BritishphysicianJohnSnow
usedaVoronoidiagramin1854toillustratehowthemajorityofpeoplewhodiedintheSohocholeraepidemiclived
closertotheinfectedBroadStreetpumpthantoanyotherwaterpump.

VoronoidiagramsarenamedafterRussianandUkrainianmathematicianGeorgyFedosievychVoronyi(orVoronoy)who
definedandstudiedthegeneralndimensionalcasein1908.Voronoidiagramsthatareusedingeophysicsand
meteorologytoanalysespatiallydistributeddata(suchasrainfallmeasurements)arecalledThiessenpolygonsafter
AmericanmeteorologistAlfredH.Thiessen.Incondensedmatterphysics,suchtessellationsarealsoknownasWigner
Seitzunitcells.VoronoitessellationsofthereciprocallatticeofmomentaarecalledBrillouinzones.Forgenerallattices
inLiegroups,thecellsaresimplycalledfundamentaldomains.Inthecaseofgeneralmetricspaces,thecellsareoften
calledmetricfundamentalpolygons.Otherequivalentnamesforthisconcept(orparticularimportantcasesofit):
Voronoipolyhedra,Voronoipolygons,domain(s)ofinfluence,Voronoidecomposition,Voronoitessellation(s),Dirichlet
tessellation(s).

Examples
Voronoitessellationsofregularlatticesofpointsintwoorthreedimensionsgive
risetomanyfamiliartessellations.

A2Dlatticegivesanirregularhoneycombtessellation,withequal
hexagonswithpointsymmetryinthecaseofaregulartriangularlatticeit
isregularinthecaseofarectangularlatticethehexagonsreduceto
rectanglesinrowsandcolumnsasquarelatticegivestheregular
tessellationofsquaresnotethattherectanglesandthesquarescanalsobe
generatedbyotherlattices(forexamplethelatticedefinedbythevectors
(1,0)and(1/2,1/2)givessquares).Seehere(http://mbostock.github.com/d3/
ex/voronoi.html)foradynamicvisualexample.
Asimplecubiclatticegivesthecubichoneycomb.
Ahexagonalclosepackedlatticegivesatessellationofspacewithtrapezo
rhombicdodecahedra. ThisisasliceoftheVoronoidiagram
Afacecentredcubiclatticegivesatessellationofspacewithrhombic ofarandomsetofpointsina3D
dodecahedra. box.Ingeneralacrosssectionofa
Abodycentredcubiclatticegivesatessellationofspacewithtruncated 3DVoronoitessellationisnota2D
octahedra. Voronoitessellationitself.(Thecells
Parallelplaneswithregulartriangularlatticesalignedwitheachother's
areallconvexpolyhedra.)
centersgivethehexagonalprismatichoneycomb.
Certainbodycenteredtetragonallatticesgiveatessellationofspacewith
rhombohexagonaldodecahedra.

Forthesetofpoints(x,y)withxinadiscretesetXandyinadiscretesetY,wegetrectangulartileswiththepointsnot
necessarilyattheircenters.
HigherorderVoronoidiagrams
AlthoughanormalVoronoicellisdefinedasthesetofpointsclosesttoasinglepointinS,annthorderVoronoicellis
definedasthesetofpointshavingaparticularsetofnpointsinSasitsnnearestneighbors.HigherorderVoronoi
diagramsalsosubdividespace.

HigherorderVoronoidiagramscanbegeneratedrecursively.TogeneratethenthorderVoronoidiagramfromsetS,start
withthe(n1)thorderdiagramandreplaceeachcellgeneratedbyX={x1,x2,...,xn1}withaVoronoidiagram
generatedonthesetSX.

FarthestpointVoronoidiagram

Forasetofnpointsthe(n1)thorderVoronoidiagramiscalledafarthestpointVoronoidiagram.

ForagivensetofpointsS={p1,p2,...,pn}thefarthestpointVoronoidiagramdividestheplaneintocellsinwhichthe
samepointofPisthefarthestpoint.NotethatapointofPhasacellinthefarthestpointVoronoidiagramifandonlyifit
isavertexoftheconvexhullofP.Thus,letH={h1,h2,...,hk}betheconvexhullofPwedefinethefarthestpoint
Voronoidiagramasthesubdivisionoftheplaneintokcells,oneforeachpointinH,withthepropertythatapointqlies
inthecellcorrespondingtoasitehiifandonlyifd(q,hi)>d(q,pj)foreachpjSwithhipj,whered(p,q)isthe
Euclideandistancebetweentwopointspandq.[6][7]

Generalizationsandvariations
Asimpliedbythedefinition,VoronoicellscanbedefinedformetricsotherthanEuclidean,suchastheMahalanobis
distanceorManhattandistance.However,inthesecasestheboundariesoftheVoronoicellsmaybemorecomplicated
thanintheEuclideancase,sincetheequidistantlocusfortwopointsmayfailtobesubspaceofcodimension1,evenin
the2dimensionalcase.

AweightedVoronoidiagramistheoneinwhichthefunctionofapairofpointsto
defineaVoronoicellisadistancefunctionmodifiedbymultiplicativeoradditive
weightsassignedtogeneratorpoints.IncontrasttothecaseofVoronoicells
definedusingadistancewhichisametric,inthiscasesomeoftheVoronoicells
maybeempty.ApowerdiagramisatypeofVoronoidiagramdefinedfromaset
ofcirclesusingthepowerdistanceitcanalsobethoughtofasaweighted
Voronoidiagraminwhichaweightdefinedfromtheradiusofeachcircleisadded
tothesquareddistancefromthecircle'scenter.[8]

TheVoronoidiagramofnpointsinddimensionalspacerequires

storagespace.Therefore,Voronoidiagramsareoftennotfeasibleford>2.An
alternativeistouseapproximateVoronoidiagrams,wheretheVoronoicellshave ApproximateVoronoidiagramofa
afuzzyboundary,whichcanbeapproximated.[9]Anotheralternativeiswhenany setofpoints.Noticetheblended
colorsinthefuzzyboundaryofthe
siteisafuzzycircleandasaresultthecellsbecomefuzzytoo.[10]
Voronoicells.
Voronoidiagramsarealsorelatedtoothergeometricstructuressuchasthemedial
axis(whichhasfoundapplicationsinimagesegmentation,opticalcharacterrecognition,andothercomputational
applications),straightskeleton,andzonediagrams.Besidespoints,suchdiagramsuselinesandpolygonsasseeds.By
augmentingthediagramwithlinesegmentsthatconnecttonearestpointsontheseeds,aplanarsubdivisionofthe
environmentisobtained.[11]Thisstructurecanbeusedasanavigationmeshforpathfindingthroughlargespaces.The
navigationmeshhasbeengeneralizedtosupport3Dmultilayeredenvironments,suchasanairportoramultistorey
building.[12]

Applications
Naturalsciences
 Inbiology,Voronoidiagramsareusedtomodelanumberofdifferentbiologicalstructures,includingcells[13]and
bonemicroarchitecture.[14]Indeed,Voronoitessellationsworkasageometricaltooltounderstandthephysical
constraintsthatdrivetheorganizationofbiologicaltissues.[15]
Inhydrology,Voronoidiagramsareusedtocalculatetherainfallofanarea,basedonaseriesofpoint
measurements.Inthisusage,theyaregenerallyreferredtoasThiessenpolygons.
Inecology,Voronoidiagramsareusedtostudythegrowthpatternsofforestsandforestcanopies,andmayalsobe
helpfulindevelopingpredictivemodelsforforestfires.
Incomputationalchemistry,Voronoicellsdefinedbythepositionsofthenucleiinamoleculeareusedtocompute
atomiccharges.ThisisdoneusingtheVoronoideformationdensitymethod.
Inastrophysics,Voronoidiagramsareusedtogenerateadaptativesmoothingzonesonimages,addingsignalfluxes
oneachone.Themainobjectivefortheseproceduresistomaintainarelativelyconstantsignaltonoiseratioonall
theimage.
Incomputationalfluiddynamics,theVoronoitessellationofasetofpointscanbeusedtodefinethecomputational
domainsusedinfinitevolumemethods,e.g.asinthemovingmeshcosmologycodeAREPO.[16]

Health
Inmedicaldiagnosis,Voronoidiagramsbasedmodelsformuscletissuecanbeusedtodetectneuromuscular
diseases.[15]
Inepidemiology,Voronoidiagramscanbeusedtocorrelatesourcesof
infectionsinepidemics.OneoftheearlyapplicationsofVoronoidiagrams
wasimplementedbyJohnSnowtostudythe1854BroadStreetcholera
outbreakinSoho,England.Heshowedthecorrelationbetweenresidential
areasonthemapofCentralLondonwhoseresidentshadbeenusinga
specificwaterpump,andtheareaswithmostdeathsduetotheoutbreak.

Engineering

Inpolymerphysics,Voronoidiagramscanbeusedtorepresentfree
volumesofpolymers.
Inmaterialsscience,polycrystallinemicrostructuresinmetallicalloysare JohnSnow'soriginaldiagram
commonlyrepresentedusingVoronoitessellations.Insolidstatephysics,
theWignerSeitzcellistheVoronoitessellationofasolid,andtheBrillouin
zoneistheVoronoitessellationofreciprocal(wavenumber)spaceofcrystalswhichhavethesymmetryofaspace
group.
Inaviation,Voronoidiagramsaresuperimposedonoceanicplottingchartstoidentifythenearestairfieldforin
flightdiversion,asanaircraftprogressesthroughitsflightplan.
Inarchitecture,VoronoipatternswerethebasisforthewinningentryforredevelopmentofTheArtsCentreGold
Coast.[17]
Inmining,Voronoipolygonsareusedtoestimatethereservesofvaluablematerials,minerals,orotherresources.
ExploratorydrillholesareusedasthesetofpointsintheVoronoipolygons.

Geometry
ApointlocationdatastructurecanbebuiltontopoftheVoronoidiagraminordertoanswernearestneighbor
queries,whereonewantstofindtheobjectthatisclosesttoagivenquerypoint.Nearestneighborquerieshave
numerousapplications.Forexample,onemightwanttofindthenearesthospital,orthemostsimilarobjectina
database.Alargeapplicationisvectorquantization,commonlyusedindatacompression.
Ingeometry,Voronoidiagramscanbeusedtofindthelargestemptycircleamidasetofpoints,andinanenclosing
polygone.g.tobuildanewsupermarketasfaraspossiblefromalltheexistingones,lyinginacertaincity.
VoronoidiagramstogetherwithfarthestpointVoronoidiagramsareusedforefficientalgorithmstocomputethe
roundnessofasetofpoints.[6]TheVoronoiapproachisalsoputtogooduseintheevaluationof
circularity/roundnesswhileassessingthedatasetfromacoordinatemeasuringmachine.

Informatics

Innetworking,Voronoidiagramscanbeusedinderivationsofthecapacityofawirelessnetwork.
Incomputergraphics,Voronoidiagramsareusedtocalculate3Dshattering/fracturinggeometrypatterns.Itisalso
usedtoprocedurallygenerateorganicorlavalookingtextures.
Inautonomousrobotnavigation,Voronoidiagramsareusedtofindclearroutes.Ifthepointsareobstacles,thenthe
 edgesofthegraphwillbetheroutesfurthestfromobstacles(andtheoreticallyanycollisions).
Inmachinelearning,Voronoidiagramsareusedtodo1NNclassifications.[18]
Inuserinterfacedevelopment,Voronoipatternscanbeusedtocomputethebesthoverstateforagivenpoint.[19]

Algorithms
Directalgorithms:

Fortune'salgorithm,anO(nlog(n))algorithmforgeneratingaVoronoidiagramfromasetofpointsinaplane.
Lloyd'salgorithmanditsgeneralizationviatheLindeBuzoGrayalgorithm(akakmeansclustering),producesa
Voronoitessellationinaspaceofarbitrarydimensions.

StartingwithaDelaunaytriangulation(obtainthedual):

BowyerWatsonalgorithm,anO(nlog(n))toO(n2)algorithmforgeneratingaDelaunaytriangulationinany
numberofdimensions,fromwhichtheVoronoidiagramcanbeobtained.

Seealso
CentroidalVoronoitessellation
Computationalgeometry
Delaunaytriangulation
Mathematicaldiagram
Naturalneighborinterpolation
Nearestneighborsearch
Nearestneighborinterpolation
Voronoipole
Powerdiagram
Mapsegmentation

Notes
1.FranzAurenhammer(1991).VoronoiDiagramsASurveyofaFundamentalGeometricDataStructure.ACMComputing
Surveys,23(3):345405,1991
2.AtsuyukiOkabe,BarryBoots,KokichiSugihara&SungNokChiu(2000).SpatialTessellationsConceptsandApplicationsof
VoronoiDiagrams.2ndedition.JohnWiley,2000,671pagesISBN0471986356
3.Q.T.Tran,D.TainarandM.Safar(2009)"TransactionsonLargeScaleDataandKnowledgeCenteredSystems",pag357.ISBN
9783642037214.
4.DanielReem,AnalgorithmforcomputingVoronoidiagramsofgeneralgeneratorsingeneralnormedspaces,InProceedingsof
thesixthInternationalSymposiumonVoronoiDiagramsinscienceandengineering(ISVD2009),2009,pp.144152(http://dx.d
oi.org/10.1109/ISVD.2009.23)
5.DanielReem,ThegeometricstabilityofVoronoidiagramswithrespecttosmallchangesofthesites,Fullversion:arXiv
1103.4125(2011)(http://arxiv.org/abs/1103.4125),ExtendedabstractinProceedingsofthe27thAnnualACMSymposiumon
ComputationalGeometry(SoCG2011),pp.254263(http://dx.doi.org/10.1145/1998196.1998234)
6.MarkdeBergMarcvanKreveldMarkOvermarsOtfriedSchwarzkopf(2008).ComputationalGeometry(Thirded.).Springer
Verlag.ISBN9783540779742.7.4FarthestPointVoronoiDiagrams.Includesadescriptionofthealgorithm.
7.Skyum,Sven(18February1991)."Asimplealgorithmforcomputingthesmallestenclosingcircle".InformationProcessing
Letters37(3):121125.doi:10.1016/00200190(91)90030L.,containsasimplealgorithmtocomputethefarthestpointVoronoi
diagram.
8.Edelsbrunner,Herbert(1987),"13.6PowerDiagrams",AlgorithmsinCombinatorialGeometry,EATCSMonographson
TheoreticalComputerScience10,SpringerVerlag,pp.327328.
9.S.Arya,T.Malamatos,andD.M.Mount,SpaceEfficientApproximateVoronoiDiagrams(http://www.cs.ust.hk/faculty/arya/pu
b/stoc02.pdf),Proc.34thACMSymp.onTheoryofComputing(STOC2002),pp.721730.
10.Jooyandeh,MohammadrezaMohades,AliMirzakhah,Maryam(2009)."UncertainVoronoiDiagram"(PDF).Information
ProcessingLetters(Elsevier)109(13):709712.doi:10.1016/j.ipl.2009.03.007.
11.Geraerts,Roland(2010),PlanningShortPathswithClearanceusingExplicitCorridors(PDF),InternationalConferenceon
RoboticsandAutomation,IEEE,pp.19972004.
12.vanToll,WouterG.CookIV,AtlasF.Geraerts,Roland(2011),NavigationMeshesforRealisticMultiLayeredEnvironments
(PDF),InternationalConferenceonIntelligentRobotsandSystems,IEEE/RSJ,pp.35263532.
13.MartinBock(2009)."GeneralizedVoronoiTessellationasaModelofTwodimensionalCellTissueDynamics".
14.HuiLi(2012)."SpatialModelingofBoneMicroarchitecture".
 15.SanchezGutierrez,D.Tozluoglu,M.Barry,J.D.Pascual,A.Mao,Y.Escudero,L.M.(20160104)."Fundamental
physicalcellularconstraintsdriveselforganizationoftissues".TheEMBOJournal35(1):7788.
doi:10.15252/embj.201592374.PMC4718000.PMID26598531.
16.Springel,Volker(2010)."Epursimuove:Galileaninvariantcosmologicalhydrodynamicalsimulationsonamovingmesh".
MNRAS401(2):791851.doi:10.1111/j.13652966.2009.15715.x.
17."GOLDCOASTCULTURALPRECINCT".ARMArchitecture.
18.TomM.Mitchell(1997).MachineLearning(InternationalEdition1997ed.).McGrawHill.p.233.ISBN0070428077.
19."UserInterfaceAlgorithms".

References
G.LejeuneDirichlet(1850)."berdieReduktionderpositivenquadratischenFormenmitdreiunbestimmten
ganzenZahlen".JournalfrdieReineundAngewandteMathematik40:209227.
Voronoi,Georgy(1908)."Nouvellesapplicationsdesparamtrescontinuslathoriedesformesquadratiques".
JournalfrdieReineundAngewandteMathematik133(133):97178.doi:10.1515/crll.1908.133.97.
AtsuyukiOkabe,BarryBoots,KokichiSugihara&SungNokChiu(2000).SpatialTessellationsConceptsand
ApplicationsofVoronoiDiagrams.2ndedition.JohnWiley,2000,671pages,ISBN0471986356
FranzAurenhammer,RolfKlein&DerTsaiLee(2013)"VoronoiDiagramsandDelaunayTriangulations".World
Scientific,2013,337pages,ISBN9789814447638
Bowyer,Adrian(1981)."ComputingDirichlettessellations".Comput.J.24(2):162166.
doi:10.1093/comjnl/24.2.162.
Reem,Daniel(2009)."AnalgorithmforcomputingVoronoidiagramsofgeneralgeneratorsingeneralnormed
spaces".ProceedingsofthesixthInternationalSymposiumonVoronoiDiagramsinscienceandengineering(ISVD
2009).pp.144152.doi:10.1109/ISVD.2009.23.

DanielReem(2011).ThegeometricstabilityofVoronoidiagramswithrespecttosmallchangesofthesites.Full
version:arXiv1103.4125(2011)(http://arxiv.org/abs/1103.4125),Extendedabstract:inProceedingsofthe27th
AnnualACMSymposiumonComputationalGeometry(SoCG2011),pp.254263(http://dx.doi.org/10.1145/1998
196.1998234).
Watson,DavidF.(1981)."ComputingthendimensionalDelaunaytessellationwithapplicationtoVoronoi
polytopes".Comput.J.24(2):167172.doi:10.1093/comjnl/24.2.167.
MarkdeBergMarcvanKreveldMarkOvermarsOtfriedSchwarzkopf(2000).ComputationalGeometry(2nd
reviseded.).SpringerVerlag.ISBN3540656200.Chapter7:VoronoiDiagrams:pp.147163.Includesa
descriptionofFortune'salgorithm.
RolfKlein(1989).Abstractvoronoidiagramsandtheirapplications.LectureNotesinComputerScience333.
SpringerVerlag.pp.148157.doi:10.1007/3540503358_31.ISBN3540520554.

Externallinks
RealtimeinteractiveVoronoiandDelaunaydiagramswithsourcecode(htt
WikimediaCommonshas
p://www.cs.cornell.edu/Info/People/chew/Delaunay.html) mediarelatedtoVoronoi
Demoforvariousmetrics(http://www.nirarebakun.com/eng.html) diagrams.
MathworldonVoronoidiagrams(http://mathworld.wolfram.com/VoronoiDi
agram.html)
VoronoiDiagrams:ApplicationsfromArchaeologytoZoology(http://www.ics.uci.edu/~eppstein/gina/scot.drysdal
e.html)
VoronoiDiagrams(http://www.cgal.org/Part/VoronoiDiagrams)inCGAL,theComputationalGeometry
AlgorithmsLibrary
MorediscussionsandpicturegalleryoncentroidalVoronoitessellations(http://www.math.psu.edu/qdu/Res/Pic/gal
lery3.html)
VoronoiDiagrams(http://demonstrations.wolfram.com/VoronoiDiagrams/)byEdPegg,Jr.,JeffBryant,and
TheodoreGray,WolframDemonstrationsProject.
AVoronoidiagramonasphere(http://www.preschern.org/pdf/WorldMap.pdf)
PlotaVoronoidiagramwithMathematica(http://datavoreconsulting.com/programmingtips/voronoidiagramsin
mathematica/)

Retrievedfrom"https://en.wikipedia.org/w/index.php?title=Voronoi_diagram&oldid=725905384"

Categories: Discretegeometry Computationalgeometry Diagrams Ukrainianinventions Russianinventions

Thispagewaslastmodifiedon18June2016,at16:57.
TextisavailableundertheCreativeCommonsAttributionShareAlikeLicenseadditionaltermsmayapply.By
usingthissite,youagreetotheTermsofUseandPrivacyPolicy.Wikipediaisaregisteredtrademarkofthe
WikimediaFoundation,Inc.,anonprofitorganization.