搜索资源列表
05362373
- High Quality Visual Hull Reconstruction by Delaunay Refinement
meshlab_ex
- constructing "meshlab" 3D module using background and foreground image and camera parameter. 1.For the silhouette extracted from each view, construct the chessboard distance transform map using 4-neighbor distance for
JavaConvexHall
- 实现Java凸包算法，但是有一些小问题，例如数组越界。-Convex hull algorithm that implements the Java
CONVEX-HULL
- Convex hull finding of a polygon
convex-hull
- 点集Q的凸包(convex hull)是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内。-Q of the convex point set bag (convex hull) is to point to a minimum convex polygons, meet the Q point or in the polygon the side or in them.
find-hull
- 寻找一个不规则图形的外边界点,保存到数组中来-find hull of the gui aaa aa a a a a aa
quick-convex-hull
- 算法练习之：快速排序实现凸包算法。附有ppt进行详细说明。-Algorithm practice of: algorithm quicksort convex hull. With ppt be described in detail.
CONVEX-HULL-OF-A-SIMPLE-POLYLINE
- 一种快速计算图形凸包的算法，算法比较简单，实现起来也很容易，有兴趣的可以参阅一下。-A fast algorithm to calculate the graphics convex hull algorithm is relatively simple, and is also very easy to implement, are interested can see what.
convex-hull
- 这是一个求凸包的算法，效率约为O（n^2)-This is an evaluation of the convex hull algorithm efficiency is about O (n ^ 2)
Convex-hull-
- Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
Convex-hull
- 根据基于生成凸包的算法，编写一个自动生成凸包的程序- According to the convex hull based algorithm to generate, write a program to automatically generate the convex hull
draw-the-outline-of-the-convex-hull
- OPENCV学习代码，绘制轮廓的凸包,对初学者有一定帮助-OPENCV learning code, draw the outline of the convex hull, based programming Opencvd of C++
HULL
- 运用角度来生成任意二维点集的凸包，并用OpenGL显示-the generation of the hull in 2D
Convex-hull-detection
- 凸包检测适合于初学者对于图像处理和OPENCV运用的重要一步，有助于学习和研究-Convex hull detection suitable for beginners to image processing and is an important step in the OPENCV use, helps to study and research
Hull
- 凸包算法实现三角网的构建Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
Convex-hull-algorithm
- 凸包算法。寻找最少的点包围点云，可以用来绘制色空间的色域。-Convex hull algorithm. The least points will be founed surround all the point cloud, which coule be used to draw the color gamut for color space.
Archetype-Hull-Ranking
- 我们设计一个新奇的规则化框架以学习相似性度量用于无约束人脸验证。我们形式化它的目标函数通过融合鲁棒性对于大规模的个人人脸的内部变化和新奇的相似性度量的辨别力。额外，我们的形式是一个凸优化问题，保证了全局最优解的存在。-we migrate such a geometric model to address face recognition and verification together through proposing a
Convex-hull-test-base
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法-The most common convex hull convex hull algorithms Graham Jarvis stepping and scanning method
Implementation of convex hull
- 实现凸包实现，采用MATLAB编写代码，用于凸包算法的快速实现。(Implementation of convex hull)
Convex hull implementation code
- 使用C语言编程，实现凸包的快速生成，提高了运算的效率。(Using C language programming, realize the rapid generation of convex hull, improve the efficiency of the operation.)