关于voronoi泰森多边形的一些资料

本文转自：http://www.dreamflier.net/blog/user1/3/2451.html

 

Voronoi图，又叫泰森多边形或Dirichlet图，它是由一组由连接两邻点直线的垂直平分线组成的连续多边形组成。N个在平面上有区别的点，按照最邻近原则划分平面；每个点与它的最近邻区域相关联。Delaunay三角形是由与相邻Voronoi多边形共享一条边的相关点连接而成的三角形。Delaunay三角形的外接圆圆心是与三角形相关的Voronoi多边形的一个顶点。 Voronoi三角形是Delaunay图的偶图；

百度百科:http://baike.baidu.com/view/501103.htm

==============================================

官方网址WIKI: http://www.voronoi.com

相关论文:

http://www.voronoi.com/wiki/index.php?title=Publications#2005-now

相关软件:

http://www.voronoi.com/wiki/index.php?title=Software
=============================================

这里有个三维渲染的java实现:

http://home.eps.hw.ac.uk/~ab226/software/DynoCurve/Voronoi.java
http://home.eps.hw.ac.uk/~ab226/software/soft.html

这里有个开源的applet,不错,演示很形象:

http://www.cs.cornell.edu/home/chew/Delaunay.html

这里下面的线性扫描清的实现也很形象:

http://www.diku.dk/hjemmesider/studerende/duff/Fortune/

============================================

google code里的voronoijava:

http://code.google.com/p/voronoijava/source/browse/

看起来有点复杂?

===========================================

这里有个A visual implementation of Fortune's Voronoi algorithm

http://www.diku.dk/hjemmesider/studerende/duff/Fortune/

网址里的开源,GitHub (可能需要翻墙)
搜索了一下,结果还真不少:
https://github.com/search?utf8=%E2%9C%93&q=voronoi+&repo=&langOverride=&start_value=1&type=Everything&language=Java

===========================================

一个教材的配套:

http://comscigate.com/Books/IntroSedgewick/30oop/35inheritance/Voronoi.java.html">http://comscigate.com/Books/IntroSedgewick/30oop/35inheritance/Voronoi.java.html

解释:
http://comscigate.com/Books/IntroSedgewick/30oop/35inheritance/

和上面那个差不多.
http://introcs.cs.princeton.edu/java/36inheritance/Voronoi.java.html

解释:

http://introcs.cs.princeton.edu/java/36inheritance/

==========================================

voronoi 2D Graphic 2D图形编程

Voronoi功能 自動拆開樹枝狀的的能力 按鈕-Voronoi automatically open the ability of dendritic button

http://read.pudn.com/downloads115/sourcecode/others/485975/voronoi.java__.htm

==========================================

一个绘制Voronoi图和Delauany三角剖分的程序，并且给出了求凸包的算法。该程序可以演示如何进行三角剖分，帮助你理解整个剖分过程。-a Voronoi diagram mapping and triangulation Delauany procedures, and is seeking a convex hull algorithms. The procedure can demonstrate how triangulation, and help you understand the subdivision process

http://www.pudn.com/downloads36/sourcecode/graph/detail113134.html

=======================================