搜索资源列表
denary三角剖分
- denary三角剖分算法源码，用于离散点成面，自动构建面的高级算法，该算法非常难得，希望你们有所启发。-denary triangulation algorithm source code for the discrete points into face, the face automatically build senior algorithm, which is very rare that you have inspired.
sweepline
- 著名的Voronoi Diagram结构fortun算法经典C描述，各位搞算法的仁兄可千万别错过，要看懂该算法，需要搞清楚Voronoi Diagram结构，还有非常深厚的C语言功底。-famous structure fortun Voronoi Diagram C classical algorithm descr iption, to engage algorithm should not miss the chance to b
qull
- DT三角化实现，注意该工程接口在设计上期望使用者直接调用exe，而不是dll。否则需要自行修改源码-DT triangulation achieved, attention to the interface works in the design expectations of the users directly call exe, instead dll. Otherwise, the need to amend its own s
voronoi
- 生成voronoi图的一个类,用这个类可以轻松生成v图，是vc源程序-Generate voronoi diagram of a class, use this type can easily generate v map is vc source
voronoiView
- 针对平面内不相交的点或圆，根据三角剖分的原理，生成VORONOI图-For the plane does not intersect the point or circle, in accordance with the principles of triangulation to generate VORONOI map
voronoi3
- voronoi图的Fortune算法源码,visual c-Fortune s algorithm source code of voronoi diagram with visual c++
voronoi
- 这个是Voronoi生成的代码, 理论基础是扫描线法，具体可以再google上搜索Sweep line method.-include the head file and source code for generating the Voronoi diagram, which is based on the Sweep line algorithm
Voronoi
- 2 dimension Voronoi diagram
voronoi-2
- 可以实现2维的voronoi结构图的计算。-this progrom is about the 2D voronoi.
voronoi
- Voronoi算法不完全代码，C++描述-Voronoi algorithm does not completely code, C++ descr iption
voronoi
- Voronoi图的分治算法，达到O（nlogn）的时间复杂度。-Voronoi diagram of the divide and conquer algorithm to achieve O (nlogn) time complexity.
voronoi
- voronoi diagram generator in code c-voronoi diagram generator in code c++
qhull-2010.1
- 一个快速实现三维凸包的程序,并且有Delaunay三角化，半平面交，voronoi图。-a 3D quickhull program，and has delaunay triagulation,half intersection,voronoi programs.
cppfrance_DIAGRAMME-VORONOI-CENTROIDALE-WIN32___P
- digramme de voronoi centroide
voronoi
- voronoi图的实现代码，非常的好用，非常好-voronoi diagram of the implementation code
voronoi
- 从Voronoi结构所脱胎的计算几何来看，Voronoi图是对平面n个离散点而言的，它把平面分为几个区，每一个区包括一个点，该点所在的区是到该点距离最近点的集合。-From the perspective of a Voronoi structure have spun out of the computational geometry, Voronoi diagram is for plane n discrete points, i
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法： 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题，即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解； 4) 该问题所分解出的各个子问题是相互独立的，即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is
new--2
- 维诺图 分治法 特别的实现方法 速度为n的平方及-Voronoi
Voronoi
- 采用中垂线构图的方式解决Voronoi构图问题，本算法随机生成外部凸包，可以高效解决内部节点个数为20以下的Voronoi构图，并且用graphics.h画出相应图形。-Using the vertical resolution of Voronoi patterned patterning problem, the algorithm randomly generated outside the convex hull can eff