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

Automatic version	Center problem	Empty circle, Largest empty circle	Largest empty ellipse
Click version	Center problem	Empty circle, Largest empty circle	-

Voronoi diagram(Automatic version)�EVoronoi diagram(Click version)
Farthest point Voronoi diagram(Automatic version)�EFarthest point Voronoi diagram(Click version)
Elliptic Voronoi diagram(Automatic version)
Farthest-point Voronoi diagram(Open 5/Sep/2000 : The 4th Revision Saturday, 19-Jun-2010 22:55:41 JST)

i=1,...,N-1
    j=i+1,...,N
        Consider a bisector of p(i) and p(j)
        k=1,...,N except for i and j
            Consider a bisector of p(i) and p(k)
            Calculate the points of intersection of bisector(i,j) and bisector(i,k)
        next k
        Add the points x=0 and x=(the width of screen) of the bisector (i,j) into the points of intersections
        Sort the points of intersections in terms of x coordinates
        k=1,...,the number of intervals of the points of intersections
            Let c be a midpoint of the interval of the points of intersection.
            Let d be d(c,p(i))
            cnt=0
            h=1,...,N except for i and j
                Let d' be d(c,p(h))
                If d'<d then shout cnt=cnt+1
            next h
            If cnt=N-2, then draw the interval of the points of intersection
         next k
    next j
next i

Mail Form