Search - convex hull c code

Search - convex hull c code - List

[Special Effects] geometry_c++ DL : 0: 计算几何学常用算法库 C++语言实现代码内容计算几何学常用算法库，包括以下算法：确定两条线段是否相交判断点p是否在线段上判断点q是否在多边形Polygon内计算多边形的面积寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm library, include the following algorithm : to determine whether the intersection of two segments to judge whether p-point of judgment, whether the point q Polygon Polygon estimate Polygon area for convex hull graham scanning
Update : 2008-10-13 Size : 12.68kb Publisher : henry
[Other resource] chull DL : 0: Computational Geometry in C 书中的源代码生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
Update : 2008-10-13 Size : 8.76kb Publisher : wuxsren
[Graph program] chull DL : 0: This code is described in \"Computational Geometry in C\" (Second Edition), Chapter 4. It is not written to be comprehensible without the explanation in that book. Input: 3n integer coordinates for the points. Output: the 3D convex hull, in postscript with embedded comments showing the vertices and faces. Compile: gcc -o chull chull.c (or simply: make)
Update : 2008-10-13 Size : 9.68kb Publisher : fds
[Graph Recognize] 2D DL : 0: C code for \"Computational Geometry in C (Second Edition)\": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Update : 2008-10-13 Size : 66.29kb Publisher : Mark
[Graph Recognize] 2D DL : 0: C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm-C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Update : 2025-02-17 Size : 66kb Publisher : Mark
[OpenGL program] ConvexHall DL : 0: ConvexHall实现 3D Convex Hall implementation: Given N points in the space, the algorithm display the construction of the convex hall.-ConvexHall Convex 3D Hall implementati on : Given N points in the space, the algorithm display the construction of the c onvex hall.
Update : 2025-02-17 Size : 46kb Publisher : 李萍
[Special Effects] geometry_c++ DL : 0: 计算几何学常用算法库 C++语言实现代码内容计算几何学常用算法库，包括以下算法：确定两条线段是否相交判断点p是否在线段上判断点q是否在多边形Polygon内计算多边形的面积寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm library, include the following algorithm : to determine whether the intersection of two segments to judge whether p-point of judgment, whether the point q Polygon Polygon estimate Polygon area for convex hull graham scanning
Update : 2025-02-17 Size : 12kb Publisher : henry
[source in ebook] chull DL : 0: Computational Geometry in C 书中的源代码生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
Update : 2025-02-17 Size : 8kb Publisher : industry pho
[Algorithm] ConvexHull DL : 0: 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to generate a random number of points, patterns, and at the same time to support the set display range, display algorithm processing time and the use of document features such as import and export points. (File format for the first four bytes is the number of points, after all points are x coordinates and y coordinates, each account for 4-byte value).
Update : 2025-02-17 Size : 50kb Publisher : 王晓桐
[Graph program] chull DL : 0: This code is described in "Computational Geometry in C" (Second Edition), Chapter 4. It is not written to be comprehensible without the explanation in that book. Input: 3n integer coordinates for the points. Output: the 3D convex hull, in postscript with embedded comments showing the vertices and faces. Compile: gcc -o chull chull.c (or simply: make)-This code is described in "Computational Geometry in C" (Second Edition), Chapter 4. It is not written to be comprehensible without the explanation in that book. Input: 3n integer coordinates for the points. Output: the 3D convex hull, in postscript with embedded comments showing the vertices and faces. Compile: gcc-o chull chull.c (or simply: make)
Update : 2025-02-17 Size : 9kb Publisher : fds
[Special Effects] Ccode2.tar DL : 0: c语言计算几何三角化 Ch1, Code 1.14 凸形外壳[2D] Ch3, Code 3.8 凸形外壳[3D] Ch4, Code 4.8 球 Chapter 4, Fig. 4.15 德劳内类型 Ch5, Code 5.2 ...See *English version.-\Computational Geometry in C\ the book s recipe Triangulate Chapter 1, Code 1.14 /tri Convex Hull[2D] Chapter 3, Code 3.8 /graham Convex Hull[3D] Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Update : 2025-02-17 Size : 56kb Publisher : XJ
[Mathimatics-Numerical algorithms] 1 DL : 0: 用C 语言实现的对于凸包问题的求解。实现了基本的功能，代码量很少采用插值算法，先生成四个原始点，之后判断其他点-Using C language for the convex hull of the solution of the problem. To achieve the basic function of the volume of rarely used code interpolation algorithm, the original Mr. into four points, after the judge the other points
Update : 2025-02-17 Size : 1kb Publisher : 昝月波
[Algorithm] convex DL : 0: C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
Update : 2025-02-17 Size : 1.7mb Publisher : bob stan
[2D Graphic] GSConvexHull-CPP DL : 0: convex hull c++ code
Update : 2025-02-17 Size : 6kb Publisher : urubu
[Special Effects] tuke DL : 1: 凸壳的生成是计算机图形学中的基本图形处理算法，本程序是演示生成凸壳的c++源码 -Convex hull of computer graphics generation is the basic graphics algorithms, this procedure is to demonstrate the Convex Hull of generating c++ source code
Update : 2025-02-17 Size : 46kb Publisher : 王小明
[GUI Develop] 2 DL : 0: 用C#编写的计算凸包的程序，可以运行，代码简单。-Calculated using C#, the convex hull of the program, you can run the code simple.
Update : 2025-02-17 Size : 59kb Publisher : 黄文嘉
[OpenCV] draw-the-outline-of-the-convex-hull DL : 0: OPENCV学习代码，绘制轮廓的凸包,对初学者有一定帮助-OPENCV learning code, draw the outline of the convex hull, based programming Opencvd of C++
Update : 2025-02-17 Size : 128kb Publisher : 曹郁文
[Mathimatics-Numerical algorithms] Convex hull implementation code DL : 0: 使用C语言编程，实现凸包的快速生成，提高了运算的效率。(Using C language programming, realize the rapid generation of convex hull, improve the efficiency of the operation.)
Update : 2025-02-17 Size : 4kb Publisher : 快乐人生Bob