搜索资源列表
Optimization_Newton
- 设r是f(x) = 0的根,选取x0作为r初始近似值,过点(x0,f(x0))做曲线y = f(x)的切线L,L的方程为y = f(x0)+f (x0)(x-x0),求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0),称x1为r的一次近似值。过点(x1,f(x1))做曲线y = f(x)的切线,并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1),称x2为r的二次近似值。重复以上过程,得r的近似值序列,其中x(n+1)=x(n)-f(x(n))/f (x(n))
intersection
- 利用交点坐标的直线生成算法,上述方法完全能够实现数据的同步更新,并一直处于稳定的应用中。压缩中有程序和文章。-Intersection coordinates using linear generation algorithm, the method is fully capable of achieving data synchronization update, and has been in a stable application. Compression in the program
to-find-the-cross-point
- 求一个经过两点的直线与指定圆心半径的圆的交点-a programe to find a cross dot of a line and a round if it exist.
BYSJ
- 图像处理,通过对数字图像处理的算法研究,结合地板图像中直线的特征,提出自己的算法并实现提取直线和交点并排除非地板直线的功能-Image processing, digital image processing by the algorithm, the image in line with the characteristics of the floor, put forward and implement their own algorithms to extract the intersec
LineSegmentIntersect
- 线段求交,使用二叉树保存消息树,状态树,还有已经求过交点的树,效率还行。-Line segment intersection, save the message using the binary tree, state tree, as well as the intersection of the tree has been seeking, efficiency, okay.
McCurve
- Flash AS3.0 的Bezier曲线类,可以根据给定的2至4个点确定一条Bezier曲线,并可方便地实现曲线的移动,求曲线与直线,曲线与曲线的交点。-Flash AS3.0 class of Bezier curves, can be given two to four points determine a Bezier curve, the curve can easily achieve the movement of demand curve and a straight line,
cagd
- Bezier曲线实现及对其操作,包括控制点的移动及修改,曲线的移动,曲线求交点。-Draw Bezier Curve,move control points and curves ,and solute inserts of curves,also shows the results in simple way.
Topology-Chain-Model
- 基于GIS 数据库中线线空间冲突检测的需求,分析了线目标间空间关系精细化描述和计 算模型. 采用GIS 空间关系理论,利用分解组合的思想,将拓扑不变量归结为局部拓扑关系及次 序,并提出了一种将线线拓扑关系与序关系、度量关系集成描述的拓扑链模型. 结果表明:该模型 可以集成描述线目标间局部详细的拓扑关系、左右关系及相交角度、交点数量、交点距离、相交区 域面积等度量关系,可以满足GIS 数据库中的线目标间空间冲突检测的需求.-To meet the demands for detec
celiangjiajiao
- 本程序用于测量两条直线的夹角,选取图像的起始行与列,及偏移量,转化为二值图像,计算交点。-This procedure is used to measure the angle of the two straight lines, a more detailed explanation, complete the steps. Starting row and column select the image and the offset into the binary image, comput
qiujiaodian
- 已知两条直线上两点的坐标,求这两条直线他们的交点。-The known two lines of two coordinates, to work the intersection of two straight lines they.
Inside
- 输入两个圆的圆心坐标和半径,输出两个圆的交点的个数及坐标-Enter the two circles center coordinates and radius, the output of two circles, the number and coordinates of the intersection
Making-the-intersection
- 求取物探二维侧线交点的程序。通过输入物探侧线的斜率和截距,就能计算交点坐标。-make the intersection for seismic lines.
satellite-orbit-demonstration
- 日本准天顶卫星的轨道演示,包括地球同步卫星轨道等不同轨道降交点变化演示 -Japanese Quasi-Zenith satellite orbit demonstration
breakCurve
- 这个是Autocad二次开发程序 在交点处打断所选线条!-break curve
bufengtouzhen
- 布冯投针 找一根铁丝弯成一个圆圈,使其直径恰恰等于平行线间的距离d。可以想象得到,对于这样的圆圈来说,不管怎么扔下,都将和平行线有两个交点。因此,如果圆圈扔下的次数为n次,那么相交的交点总数必为2n。 现在设想把圆圈拉直,变成一条长为πd的铁丝。显然,这样的铁丝扔下时与平行线相交的情形要比圆圈复杂些,可能有4个交点,3个交点,2个交点,1个交点,甚至于都不相交。 由于圆圈和直线的长度同为πd,根据机会均等的原理,当它们投掷次数较多,且相等时,两者与平行线组交点的总数可望也是一样的。这就是说,
ajdbbzzipu
- autocad vlisp开发的实现jjdbz(交点标注)程序源码 可直接使用。 -the autocad vlisp developed jjdbz of (marked intersection) and the program source code can be used directly.
Cintersectiona
- 计算水平线与垂直线交点个数问问题。扫描方法计算。可直接使用。 -Calculate the horizontal and vertical line intersection number to ask questions. The scanning method of calculation. Can be used directly.
Tex3_interseco
- 实现垂直水平线计算交点的算法法,为乌迪曼波算法书上面的方法 -Vertical and horizontal lines to calculate the intersection algorithms law, Udi Mambo algorithm book above
mPPooincarea
- 绘制庞加莱截面图,在相空间中适当(要有利于观察系统的运动特征与变化,如截面不能与轨线相切,更不能包含轨线)选取一截面,在此截面面上某一对共轭变量如x1与x.1取固定值,称此截面为Poincare截面,相相空间的连续轨迹与Poincare截面的交点成为截点。 -Draw the Poincare sections in phase space appropriate (should be beneficial to observe the motion of the system charac
Intersection
- 用来计算物探二维测线交点的算法。二维测线的交点在实际生产中有着非常重要的意义。-The algorithm used to calculate the intersection of Geophysical 2D line. 2D line intersection has a very important significance in the actual production.