2000 : The 2nd Revision Thursday, 03-Jun-2010 22:12:49 JST)

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	-

Additively weighted power Voronoi diagram is drawn by using distance function d(p,p(i))
d(p,p(i))=dis(p,p(i))^2-w(i)
where dis is Euclidean distance and w(i) is the weight of p(i).
An edge is generally a straight line segment.
Java(pwvoro.java)

If you have a message, don't hesitate to send it by using
E-mail:

Mail Form
or
BBS

Use of Takashi Ohyama's website
English Home of Takashi Ohyama
Japanese Home of Takashi Ohyama