Description: 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. Platform: |
Size: 11264 |
Author:cstar |
Hits:
Description: 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 of the course Duality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations Platform: |
Size: 10240 |
Author:huangif |
Hits:
Description: 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.
-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.
Platform: |
Size: 87040 |
Author:followtime |
Hits:
Description: 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 generates Delaunay triangulations, Voronoi diagrams, furthest-site Voronoi diagrams, and halfspace intersections about a point.
Rbox is a useful tool in generating input for Qhull it generates hypercubes, diamonds, cones, circles, simplices, spirals,
lattices, and random points. Platform: |
Size: 295936 |
Author:邓东生 |
Hits:
Description: 计算几何 in C[PDF]
Joseph O Rourke
1. Polygon Triangulation
2. Polygon Partitioning
3. Convex Hulls in Two Dimensions
4. Convex Hulls in Three Dimensions
5. Voronoi Diagrams
6. Arrangements
7. Search and Intersection
8. Montion Planning
9. Sources-Computational Geometry in C[PDF]
Joseph O Rourke Platform: |
Size: 24091648 |
Author:Edwin |
Hits:
Description: 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 the course Duality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations Platform: |
Size: 10240 |
Author:tocont |
Hits:
Description: CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。-The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page.
The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del Platform: |
Size: 18593792 |
Author:a |
Hits:
Description: Title: Voronoi diagrams
Description: 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.
Platform: |
Size: 338944 |
Author:rachid |
Hits:
Description: 能够得到二维、三维voronoi图，修改后可以获得任意数量的voronoi图。(The two or thress-dimensional Voronoi diagram can be obtained, and any number of Voronoi diagrams can be obtained after modification.) Platform: |
Size: 91136 |
Author:黄小溅 |
Hits:
Search - Voronoi Diagrams