搜索资源列表
CommonTangent
- CUDA program finds common tangent of 2 convex chains
20100905tuxing
- 本书从图形学最基础的光栅扫描、区域填充、画直线和圆弧等算法讲起，详细介绍了线裁剪和面裁剪、凸区域裁剪和凹区域裁剪的异同，景物空间消隐算法和图像空间消隐算法的差别，具体讲述了二叉空间剖分(BSP)、八叉树等图形学中常用的数据结构。新版本增加了图形用户界面、椭圆、图像压缩和线条反走样算法等，还增加了Liang-Barsky裁剪算法和Nicholl-Lee-Nicholl裁剪算法。新版本大大扩充了可见面光线跟踪算法。在绘制这一章中新增了基于物理的光照明模型，透明效果，阴影生成，纹理映射，以及锥光束、平
ProjectionOnConvexSets
- 重建高分辨率图像使用在凸集投影,高效率matlab程式码-reconstruct high resolution image using Projection On Convex Sets
GrahamScan
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法,该上传文件主要是基于Graham扫描法的凸包算法-convex hull algorithms:based on Graham scan method ~ ~~~~`~·`·`
FoundTuBianXing
- 在图形的多有点中，连线实现画出所有点的外界凸边形，开发工具Opencv+VC-In the multi-bit graphics, the connection to achieve all the points drawn outside convex polygon, development tools Opencv+ VC++
tuxing
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形。功能简单明了.-Enter the coordinates of N points to determine whether these N points form a convex polygon. Function simple.
ConvexOptimization
- 凸优化问题经常出现在许多不同的领域。全面介绍了主题，这本书展示了如何解决这些问题都可以高效率地详细数字。其重点是识别凸优化问题，然后找到解决他们最合适的技术。文本包含许多实例和作业练习，并会提出问题，如工程，计算机科学，数学，统计，金融，经济领域的学生，研究者和实践者。-Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subjec
Nonlinear_Programming
- 全面而完整，本概述提供了密钥算法和理论的单卷处理。笔者提供所有理论方面的明确解释，与大多数结果严格的证明。这两个部分的处理开始的优选条件和凸规划，对偶，广义凸性的讨论，并选定非线性规划分析推导。第二部份是有关技术和数值解无约束优化方法，并介绍了常用的约束非线性优化问题的算法。本次毕业级文本不需要超出初等微积分，线性代数，高等数学和现实背景分析。 -Comprehensive and complete, this overview provides a single-volume treatm
OpenCV
- sample of opencv and convex hull graham algoritme
pku_poj_2187
- O(nlogn)凸包问题 poj2187-O (nlogn) convex hull problem poj2187
zhalan
- 运用凸包的生成算法，具体解决了“栅栏”问题，并且有MFC实现的图形界面-Convex hull generation algorithm used, the specific solution to the " fence" issue, and has implemented graphical interface MFC
convexoptimization
- A useful book on convex optimization. Published by Cambridge University Press.
a_simple_2d_cad_system_with_dynamic_capture_functi
- 一个具有动态捕捉功能的简易2dCAD系统，能灵活绘制一般的简单图形，同时能检测多边形的方向和凹凸性以及点和多边形的关系-A simple 2d CAD dynamic capture system, the flexibility to draw simple graphics in general, but can detect the direction and the concave and convex polygons, and the relationship between poi
HH_GIS_SpAn
- GIS空间分析工具，我们的空间分析课程设计包含道格拉斯抽样、曲线插值与光滑、多边形最小凸包、点群分布参数（分布中心、分布密度、分布轴线等）。基本功能都实现了。-GIS spatial analysis tools, our curriculum includes Douglas spatial analysis sampling, interpolation and smooth curve, the minimum convex polygon, point group distributio
Minimum_PointSet
- 一个用于生成多边形最小凸包的简单程序，基本功能就是用鼠标随意画一个多边形，然后计算并生成多边形最小凸包。很难得-Minimum convex polygon of a package used to generate a simple procedure, the basic function is free to draw a polygon with the mouse, and then calculates and generates the smallest convex polygo
wykobi_dot_net
- 实现多边形的凸包运算，且能顺利进行多边形三角划分，还有各种其他多边形计算几何之间的处理-Operation to achieve the convex hull of polygons, and can smooth the polygon triangulation, computational geometry and various other polygon processing between
analyse
- 空间分析中相关算法的实现：道格拉斯 插值 光滑 最小凸包 分布中心 分布轴线等-Spatial analysis of related algorithms to achieve: Douglas interpolation smooth distribution of the minimum distribution center axis of the convex hull, etc.
CQMesh-2
- CQMesh是一个C + +生成任意多边形域的凸四边形网格程序。 CQMesh需要输入一个多边形三角域，然后转换成同一个三角域的凸四边形网格。-CQMesh is a C++ program for generating convex quadrilateral meshes of arbitrary polygonal domains. CQMesh takes as input a triangulation of a polygonal domain, and then converts
ACM_code
- ACM常用算法，内容涵盖了如快速傅里叶变换，求排列组合数，判断图形是凸集还是凹集，求解模线性方程，求最小生成树等算法-ACM commonly used algorithms, covering, such as fast Fourier transform, find the number of permutations and combinations to determine the graph is convex or concave set of linear equations so
InPolyedron27072009
- InPolyedron detects points inside a manifold closed surface (even non convex ones). The normal orientation is assumed to be outwards. Warning there is no check for closed surface or normal orientation, open surfaces will give nonsense results. I