搜索资源列表
voronoi
- 一个绘制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 t
voronoi图形的构建
- 关于voronoi图形的c语言构建!!
Voronoi_graph.zip
- Voronoi图的pascal实现算法,图论中一种很有用的算法,Pascal achieve Voronoi diagram algorithms, a very useful algorithm in graph theory.
voronoi3.rar
- voronoi图的Fortune算法源码,visual c++,Fortune s algorithm source code of voronoi diagram with visual c++
Mesh_Ap_Delaunay
- Creates and displays a Delaunay Triangulation (DT) or a Voronoi Diagram (VoD)
Voronoi1
- Voronoi图是以两点间线段的长度作为距离 ,对平面的一种分割。然而 ,在地理环境中 ,存在着许多自然的或人为的障碍 ,使得从一点到另一点不能直线到达。为了扩大Voronoi图的应用领域 ,本文对传统的Voronoi图进行扩充 ,给出了障碍Voronoi图的定义、性质 ,以及离散生成线段障碍Voronoi图的方法-Voronoi diagram based on the length of line between two points as the distance from a parti
3d_Voronoi_AKA_Project_Cell
- 用于生成3d Voronoi图的vbs脚本,运行环境 rhino 4.0-Is used to generate 3d Voronoi diagram vbs scr ipt, rhino 4.0 operating environment
TIN_Voronoi
- 构建离散点集的Voronoi图,算法大致流程:先构建Delaunay TIN,然后连接相邻三角形的重心记得Voronoi图,然后基于TIN的拓扑,构建Voronoi多边形的拓扑关系。-Construction of discrete point set Voronoi diagram algorithm for general processes: first, to build Delaunay TIN, then remember that the focus of a triangle c
voronoi_test.m
- Voronoi test diagram
VORONOI
- vc++使用MFC生成voronoi图和凸壳 功能强大-vc++ using the MFC generates voronoi diagram and convex hull powerful
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.
PlantraEN1608
- Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines
Voronoi
- Voronoi Diagram for computer graphics
Creat-Voronoi-based-on-Delaunay
- 本文叙述了一种基于Delaunay三角网生成Voronoi图的算法。-This paper describes an algorithm based on Delaunay Triangulation Voronoi diagram.
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, it put the plane is divided int
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法: 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题,即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解; 4) 该问题所分解出的各个子问题是相互独立的,即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
c++-voronoi
- 利用c++程序来实现voronoi图的生成,十分简单、有效(Using c++ program to achieve the generation of Voronoi diagram, very simple and effective)
Voronoi
- 用三角网方式生成Voronoi图,功能很详细(Create a Voronoi diagram with a triangulation method with detailed functions)
voronoi
- 基于matlab软件,实现3D有边界的voronoi图。(A Voronoi diagram with a boundary for 3D)
voronoi
- 能够得到二维、三维voronoi图,修改后可以获得任意数量的voronoi图。(The two or thress-dimensional Voronoi diagram can be obtained, and any number of Voronoi diagrams can be obtained after modification.)