当前位置：
首页 资源下载
搜索资源 - Delaunay triangulation
搜索资源列表
-
0下载：
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.
-
-
1下载：
Delaunay三角网，及Voronoi三角形生成，实现用户加点，自动生成功能！界面友好！速度稍慢~,Delaunay Triangulation and Voronoi triangle generation, add a little to achieve the user to automatically generate the feature! User-friendly! A slower pace ~
-
-
1下载：
此资料介绍的是：利用OpenGL实现三维地形可
视化,采用Delaunay三角化法得到地形采样点,并用已知数据对三角曲面进行插值加密,生成规则格网(GRID)数据结构的方法,可得到高度真实感的三维地形可视化效果。
-The data presented are: the use of OpenGL for three-dimensional terrain visualization, using Delaunay triangulation method to be terrain
-
-
0下载：
基于德洛内三角分解的有限元划分，可形成刚度总阵-Delaunay triangulation based on decomposition of the finite element division, the total stiffness matrix can be formed
-
-
0下载：
Delaunay三角剖分算法介绍和c++源码。代码封装了其他人的代码包，在cygwin和redhat下编译通过。-This C++ library module is just a wrapper class on the Triangle package of Jonathan. The C++ wrapper will certainly slow access down if you want to mess with the triangulation but the basic del
-
-
0下载：
实时障碍物识别
Realtime Obstacle Detection and Tracking Based on Constrained
Delaunay Triangulation-Real-time obstacle identification Realtime Obstacle Detection and Tracking Based on ConstrainedDelaunay Triangulation
-
-
0下载：
该程序使用OpenCV提供的函数在Visual studio6.0的环境下对若干点进行Delaunay三角剖分，具有很高的实用价值，编译已通过，绝对可用-The program provides a function to use OpenCV in Visual studio6.0 environment where a number of points on the Delaunay triangulation of high practical value, the compiler ha
-
-
0下载：
tin三角网的构造
tin是使用不规则多边形拟和地球表面或者其他不规则表面，是构造数字地面模型，数字高程模型的基本方法之一-tin structure of triangulation is the use of tin to be irregular polygon and the Earth s surface or other irregular surfaces, is constructed digital terrain model, digital elevation mode
-
-
0下载：
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.
-
-
0下载：
Creates and displays a Delaunay Triangulation (DT) or a Voronoi Diagram (VoD)
-
-
0下载：
A 2D Delaunay Triangulation (DT) with incremental site insertion
-
-
0下载：
delaunay voronoi三角化的java代码，此代码由康奈尔大学的教授编写-delaunay voronoi triangulation of java code, the code by the Cornell University professor of preparation
-
-
1下载：
利用渐次插入算法，根据坐标数据生成简易Delaunay三角网。-Use of gradual insertion algorithm, according to the coordinate data to generate simple Delaunay triangulation
-
-
1下载：
三角网剖分 将平面数据点进行三角剖分 快速构建delaunay三角网-delaunay triangulation which can triangulate the dots on the plane
-
-
1下载：
用C++编写的Delaunay三角网实现算法-Using C++ to prepare the Delaunay triangulation algorithm
-
-
0下载：
Delaunay三角剖分-Delaunay triangulation
-
-
0下载：
带岛区约束数据域的Delaunay三角剖分通用算法研究(文章)，有参考价值-Band Island constrained domain of generic algorithm for Delaunay triangulation (articles), there is reference value
-
-
0下载：
Delaunay triangulation VC
-
-
0下载：
Delaunay triangulation is one of the most well known algorithms for space tesselation. Dynamic Delaunay triangulation, in which you can update the input points using a predefined matrice for saving points, is presented in this document.
-
-
0下载：
Achieved with vc Delaunay triangulation of an arbitrary polygon
-
« 12
3
4
5
6
7
8
9
10
...
14
»
