Voronoi Diagrams

Post on 07-Jul-2015

190 views 3 download

Preview:

Click to see full reader

Report this document

description

In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on 'closeness' to points in a specific subset of the plane. In this presentation you will seen definitions of Voronoi Diagrams and also computing Voronoi Diagrams ways. Proofs are explained in details and easiest way. Attention!: This presentation has animation effects to describe problems better and visually, so you should download it and then view it with Microsoft PowerPoint, or you can't see parts of some pages. Also this file has first two parts of subjects: "Definition and Basic Properties" &"Computing the Voronoi Diagram". Feel free to ask your questions.

Transcript of Voronoi Diagrams

1

2

http://lpetrich.org/Science/GeometryDemo/GeometryDemo_GMap.html

p1, p2, . . . , pn

pi pi pj

pj ≠

pi

pi

pi

e

pi pj

pk

pi

pi

mv – me + mf =2

Mv-Me+Mf=2let call Mv as nv , (nv+1) – ne+n = 2

Me as ne ,(number of sites)Mf as n

(sum of all degrees) 2ne

, 2ne 3(nv+1) , 2ne 3(2+ne-n)

2ne 6+3ne-3n ne 3n-6

, n-2+(nv+1) 3n-6 nv 2n-5

3(nv+1)

Cp

Cp

pi pj

Cp pi pj

Cp

pi pj pk

pi pj

pk

pi pj

pk

pi

pj pk

pi pj pk

pi pj

pi pj pk

pi pj

pi pj

pipj

26

pi pi pj ≠

T(n) = O(n² log n)

• l+

l+

l+

`

pj

ly

• pj pj,x pj,y

pi,y pj,y ly

pi pk

55

Copyright © 2022 FDOCUMENTS