Reload

Voronoi diagrams (Automatic version)	Ordinary	Multiplicatively Weighted /Area	Additively W /Area	PW(additively Weighted Power)	Compoundly W	LW(L_{weight} norm)
	Higher-order	HMW	HAW	HPW	HCW	HLW
	Elliptic	Manhattan	Supremum	Karlsruhe	Farthest-point
	HElliptic	HManhattan Farthest-Point Manhattan	HSupremum	HKarlsruhe	Higher-order Farthest-point
	line-segment		line-segments sometimes cross each other		line-segments need to cross each other	largest empty circle in a polygon
	Higher order line-segment		Higher order line-segment (segnebts sometimes cross each other)		Higher order line-segment (segments need to cross each other)
	Area of Voronoi Region /MW Area /AW Area	Delaunay Tessellation	order-2 Delaunay	Order-3 Delaunay	Farthest Delaunay
	Delaunay some edges deleted	-	-	Extended Voronoi Edges	-	-
	Voronoi area game for two	for three	for four	for five	for six	-
Voronoi diagrams (Click version)	Ordinary	-				Largest Empty circle in a polygon
	Higher-order
	-	Manhattan	Supremum	Karlsruhe	Farthest-point
		HManhattan Farthest-Point Manhattan	HSupremum	HKarlsruhe
	Area of Voronoi Region	Delaunay Tessellation	order-2 Delaunay	Order-3 Delaunay	Farthest Delaunay
	Voronoi area game for two	for three	for four	for five	for six	-

CW, LW and Karlsruhe are very heavy.

Screensaver for Win 95,98

Additively weighted Voronoi diagram(Open 5/Sep/2000 : The 2nd Revision Saturday, 03-Jul-2010 21:13:45 JST)

Sort generators such that w[1]<w[2]<...<w{N]
i=1,...,N-1
    j=i+1,...,N
        Consider a bisector of p(i) and p(j) hyperbolic arc; that is, difference of two distances (distance to i and distance to j) is constant.
        At first, rotate i and j such that two y-coordinates are same. Next, move two points such that middle point of i and j become origin point. That is, i and j become two foci as (-a,0) and (a,0).
        Compute hyperbolic arc (x,y) for (-a,0), (a,0) and rotate back, move back.
        Regarding to parameters, see Okabe, Boots, Sugihara, Chiu. Spatial Tessellations, Wiley.
        for x=0 to right edge of screen
            compute y for x, hyperbolic arc
            compute d from (x,y) to i
            set cnt=0
            k=1,...,N except for i and j
                compute d_k from (x,y) to k
                if d_k<d then cnt=1 and break
            next k
            if cnt=0 then plot (x,y)
        next x
        make y loop if need
    next j
next i

Mail Form