搜索资源列表
VoronoiDiagrams
- Voronoi Diagrams 1Partially supported by the Deutsche Forschungsgemeinschaft, grant Kl 655 2-2.
Voronoi
- Voronoi diagrams. Not continued working.
Voronoigulations
- voronoi diagrams code
mesh_applet
- Create a Delaunay triangulation or Voronoi diagram by clicking points. Delaunay triangulations and Voronoi diagrams are among the most widely used data structures in the field of Computational Geometry. These are Java-oriented source codes.
Voronoi_Diagram_Notes_1
- Voronoi diagrams (Fortune algorithm)
tr198
- Voronoi diagrams document
k_cvdcs_extabstr_cg96
- Calculating Voronoi Diagrams using Convex Sweep Curves
lecture2-650
- Present a mathematical framework for discussing the topics in the remainder of the course Duality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations -Present a mathematical framework for discussing the topics in the remainder
geompack
- voronoi图及delaunay三角网格化程序-voronoi diagrams and delaunay triangulation gridding procedure
Advancedgraphicscapabilities
- 高级绘图功能 彗星图 二维彗星轨迹图 三维彗星轨迹图 帧动画 色图变幻 Voronoi 图和三角剖分 彩带图 彩带图 伪彩图 切片图 网格图和曲面图特效 显示轮廓线 瀑布效果 带光照模式的阴影图 函数绘图 三维图形控制 视点 灯光效果 色彩控制 -Advanced graphics capabilities of comets comet locus two
GEOMPACK
- 不规则三角网(TIN)能以不同层次的分辨率来描述地形表面,被视为DEM中最基本和最重要的一种模型。程序功能为带约束条件的离散点不规则三角网生成。-Voronoi diagrams, Delaunay triangulations
Delaunay-triangulations
- GEOMPACK - Voronoi diagrams, Delaunay triangulations GEOMPACK is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane.
qhull
- qhull生成算法，纯c语言实现。 通过顶点生成convex hull的快速算法，也会生成delaunay三角形和Voronoi图。- Qhull is a general dimension convex hull program that reads a set of points from stdin, and outputs the smallest convex set that contains the points to stdout. It also generate
lecture2-650
- Present a mathematical framework for discussing the topics in the remainder of the courseDuality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations-Present a mathematical framework for discussing the topics in the remainder of th
CGAL-4.5
- CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和
Voronoi-Diagrams-master
- robotic voronoi coverage
Voronoi_di1814141142004
- Title: Voronoi diagrams Descr iption: Exploration of several pixel-based voronoi diagram algorithms. Voronoi diagrams are used to divide space (in this case 2D space) amongst a collection of points.
voronoi
- 能够得到二维、三维voronoi图，修改后可以获得任意数量的voronoi图。(The two or thress-dimensional Voronoi diagram can be obtained, and any number of Voronoi diagrams can be obtained after modification.)