搜索资源列表
4
- 判断链表是否相交 若相交,打印相交的元素各一次-To determine whether the intersection if the intersection list, print the first element of the intersection
alpha
- 本代码显示了两个相交的三角形,颜色不同,在相交的地方颜色都不同-This code shows the intersection of two triangles of different color, place at the intersection of the color is different
Geometry
- 用C++语言实现的各种计算几何算法, 如判断点是否在多边形内, 多边形凸凹性判断, 寻找点集凸包的卷包裹法,求简单多边形的重心,求从多边形外一点出发到该多边形的切线,判断线段是否相交等等! -Using C++ language implementation of a variety of computational geometry algorithms, such as point to determine whether the polygon, the polygon convexity
2008638621518
- 树是由n(n≥0)个结点组成的有限集合T。n=0的树称为空树;对n>0的树,有:(1)仅有一个特殊的结点称为根结点,根结点没有前驱结点;(2)当n>1时,除根结点外其余的结点分为m(m>0)个互不相交的有限集合T1,T2,…,Tm,其中每个集合Ti本身又是一棵结构和树类似的子树。 -Tree is n (n ≥ 0) consisting of nodes finite set T. n = 0 of the tree known as the empty tree fo
voronoiView
- 针对平面内不相交的点或圆,根据三角剖分的原理,生成VORONOI图-For the plane does not intersect the point or circle, in accordance with the principles of triangulation to generate VORONOI map
MESH-on-the-minimum-for-a-convex-body-surrounded.r
- 关于求一个MESH的最小凸包围体 所谓凸体, 就是从凸体内任意一点,向周围发射线,都只此MESH相交一次。-MESH on the minimum for a convex body surrounded the so-called convex body, convex body from any point, to launch around the line, only this time MESH intersection.
SegmentsIntersection
- 计算几何的利用叉积判断线段是否相交的算法,这个算法算法导论上有详细的介绍-The use of computational geometry plot fork intersection to determine whether segments of the algorithm, this algorithm has a detailed introduction to algorithms introduction
Circle_Recognition_Through_a_Point_Hough_Transform
- :给出了一种新的Hough 变换圆检测方法——点Hough 变换(PHT)。该方法根据圆周上任意两条不平行弦的中垂线相交与圆心的几 何性质,同时选取曲线上3点 进行计算,将传统Hough变换圆检测时的三维参量统计变成一维参量统计,极大地降低了计算复杂性和对资源的需求。为了克服任意选取组合点可能带来的计算量增加及统计结果的分散程度提高,文中提出了点的选择方法。合成图和实际图像的实验结果表明,该方法用于普通图像中圆检测时快速、稳定、准确。-: This paper presents a new
opacity
- 两个图像相交部分进行半透明处理,其它部分保持原有的样子-Intersection part of two semi-transparent image processing
uml
- 在关联建模中,存在一些情况下,你需要包括其它类,因为它包含了关于关联的有价值的信息。对于这种情况,你会使用 关联类 来绑定你的基本关联。关联类和一般类一样表示。不同的是,主类和关联类之间用一条相交的点线连接。图 11 显示一个航空工业实例的关联类-Modeling in the association, the existence of some cases, you need to include other categories, because it contains valuable o
ast
- arcgis 画polygen 并选择与之相交的要素-arcgis painting polygen and select elements of the intersection with
a
- arcgis 画多边形,并查找与之相交的其它多边形-polygon arcgis painting, and find the intersection with other polygons
B1_Intersect
- 数据结构典型算法的代码: 关于两条直线是否相交-Data structure of a typical algorithm code: With regard to whether the intersection of two straight lines
Therelativeorientation
- 连续像对相对定向是指在相对定向中,以一张像片为准,旋转和移动另一张像片达到同名光线对对相交,解求相对定向元素的过程。-For as to the relative orientation is defined as the relative orientation, with a photograph in which rotation and movement to achieve another photograph of the same name right right light in
Picking
- 思路: 场景中的每个mesh关联到一个唯一的COLOR值。 Pick检测时, 将当前场景渲染到纹理, (在PS中各mesh仅用自己的关键COLOR),即刻取回当前鼠标的位置的COLOR, 查找COLOR就可以知道当前被Pick的Mesh。 使用Render To Texture 的快速Picking, 无需锁住Vertex Buffer进行三角面和射线的相交测试, 仅在读取数据的时候锁住纹理的一个相素, 但是显卡要支持Render To Texture,纹理尺寸必须支持非2的n次方,D3DF
GEOMETRY
- 所有的与软件环境无关的函数: 1、点在线上判断 2、确定两条线段是否相交,包括端点 3、求两条线的交点 4、 判断点q是否在多边形Polygon内 等多个函数-All has nothing to do with the software environment of the function: 1, 2-point line on the judge to determine whether two line segments intersect, including th
AETool
- 属于AE源码。在程序中对相交线的打断,对线的修剪以及合并(union)两个polygon要素。对选区区域测量其面积和周长。-AE source is. In the proceedings of the interrupted line of intersection of line cutting and union (union) of two polygon elements. Region of the constituency of its size and girth measure
pic
- 兩圖相交, 可將兩張圖相合併,成為新的一張圖-Intersection of the two plans could be to merge the two plans, a new map
TreeViewCheckBox
- treeview和checkbox, 兩個相交合用在一起-treeview and checkbox, combined with the two intersecting
interzoneproblem
- 区间相交问题给定x 轴上n 个闭区间。去掉尽可能少的闭区间,使剩下的闭区间都不相交。 由文件input.txt给出输入数据。第一行是正整数n,表示闭区间数。接下来的n行中, 每行有2 个整数,分别表示闭区间的2个数端点。-Interval intersection problem of a given x-axis n-closed interval. Remove the closed interval of as little as possible, so that the res