搜索资源列表
VORONOI
- vc++使用MFC生成voronoi图和凸壳 功能强大-vc++ using the MFC generates voronoi diagram and convex hull powerful
SweepLine
- Voronoi Sweep line Algorithm By Java
MATLAB
- Matlab in voronoi tessellation
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
Voronoi-Topological-Neighbors
- 提出一种三维散乱点云的Voronoi拓扑近邻点集查询算法-a new voronoi topological neighbors algorithm
Voronoi-theory
- Voronoi图论相关知识，化简无线传感器网络拓扑结构。-Voronoi graph theory of knowledge, simplification of wireless sensor network topology.
Creat-Voronoi-based-on-Delaunay
- 本文叙述了一种基于Delaunay三角网生成Voronoi图的算法。-This paper describes an algorithm based on Delaunay Triangulation Voronoi diagram.
voronoi
- C++ MFC生成voronoi图像，自定义结点-The application wizard has created this voronoi application for you. This application not only demonstrates the basics of using the Microsoft Foundation Classes but is also a starting point for writing your application
voronoi
- voronoi图的C++ 生成源代码 在GIS上运用非常广泛-voronoi Generation algorithm
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 tessellation
- Define a computation that calculates the Voronoi tessellation of the atoms in the simulation box. The tessellation is calculated using all atoms in the simulation, but non-zero values are only stored for atoms in the group.
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法： 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题，即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解； 4) 该问题所分解出的各个子问题是相互独立的，即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
Voronoi
- 用Delphi语言编程实现Voronoi图，这对于最短路径分析是很有用的-Delphi programming language with a Voronoi diagram, which for the shortest path analysis is useful
voronoi
- java语言编写，实现Voronoi三角网构建和泰森多边形构建-java language to achieve Voronoi triangulation build and construct Thiessen polygons
Voronoi
- 维诺图的实现，应用分治法实现维诺图，代码详细有注释-Voronoi come true
voronoi
- oommf中用于Voronoi分割的微磁学计算-micromagnetic calculation for Voronoi division oommf
leach-voronoi
- 改进版本的泰森多边形法LEACH聚簇算法，比普通LEACH更为高效-leach voronoi
Voronoi-Diagrams-master
- robotic voronoi coverage