搜索资源列表
InterpolationAitkenNotIsometry
- 埃特金不等距逐步插值。给定n个不等距节点的函数值及精度要求，使用埃特金逐步插值法计算指定插值点t处的函数近似值-Unequidistance interpolation with Aitken method. Using this method to get the near value of special point t ,and satify the functin values and presicion of n points
shortest_BySophia
- 给定平面上N个点，找其中的一对点，使得在N个点组成的所有点对中，该点对间的距离最小。-given plane N and find the one pair of points made in the composition of N points on all points, which points to the distance between the smallest.
curve_test.tar
- curve_test is a set of 3 programs to demonstrate 3 different kind of third-order parametric curves: Hemite curve segments, Bezier curve segments, and Splines. Hemite curves are defined by two endpoints and two v
ConvexHall
- 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
netwarchess
- 主要函数介绍： Init1() 程序启动时加载初始化 Init() 重新布棋初始化 Image0MouseDown 点到主棋盘空白处进行判断是否可以在此处布棋 Image1MouseDown 点到自方棋子记录原始的oldID、oldX、oldY的值 Image26MouseDown 点到对面棋进行判断 Image101MouseDown 点到副棋盘空白处进行判断是否可以在此处放棋 -main function
cpair
- 本程序可以在输入n点后，判断出这n个点中距离最近的两个点-procedures in the importation of n point, the judge out of this n points from the nearest two points
oscill_src
- This a simple implementation of Oscilloscope control. This control shows last N points of user data. It has up to 8 channels (number of channels are defined by OSC_MAX_CHANNELS parameter in header file). Each channel can
tianchong
- 任意多边形的填充,只要输入N个点,然后用鼠标实现.-arbitrary polygon filling, as long as the importation of N points, and then use the mouse to achieve.
tianchong
- 任意多边形的填充,只要输入N个点,然后用鼠标实现.-arbitrary polygon filling, as long as the importation of N points, and then use the mouse to achieve.
InterpolationAitkenNotIsometry
- 埃特金不等距逐步插值。给定n个不等距节点的函数值及精度要求，使用埃特金逐步插值法计算指定插值点t处的函数近似值-Unequidistance interpolation with Aitken method. Using this method to get the near value of special point t ,and satify the functin values and presicion of n points
shortest_BySophia
- 给定平面上N个点，找其中的一对点，使得在N个点组成的所有点对中，该点对间的距离最小。-given plane N and find the one pair of points made in the composition of N points on all points, which points to the distance between the smallest.
curve_test.tar
- curve_test is a set of 3 programs to demonstrate 3 different kind of third-order parametric curves: Hemite curve segments, Bezier curve segments, and Splines. Hemite curves are defined by two endpoints and two v
fft-by_skyline
- 这是一个我自己写的FFT的c程序，可以计算n(<4096)个点（可以是虚数）的结果 -This is one I wrote it myself FFT c procedures can be calculated n (
myfft_ifft.zip
- FFT and IFFT for 16-bits wave, you can use this instead of convolution calculate, input samples must be 2^n. If its not 2^n samples just stuff zero in last array. I already make it to C++ class you can new a calss
ninpoly
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形-Enter the coordinates of N points, N points to determine whether this constitutes a convex polygon
N
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形。-Enter the coordinates of N points, to determine whether the N points form a convex polygon
Two-dimensional-extreme-points
- 在二维空间里有两个点A=(X1，Y1)和B=(X2，Y2)，如果X1>X2并且Y1>Y2 ，我们认为A优于B，A是这个集合的最大极值点，在给定的二维空间里的N个点的集合S中，找出最大极值点。,In a two-dimensional space, there are two points A = (X1, Y1) and B = (X2, Y2), if X1> X2, and Y1> Y2, we believ
Perspective-n-Point-Problem
- 这篇文献是图像摄影学方面比较基础重要的一篇文献。采用透视模型，基于n个点对来估计摄像头位姿参数。-This document is the basis for comparison image photography learning important aspects of a document. Use of perspective model, based on n points to estimate the camera po
Max-Points-on-a-Line
- leetcode中求最大共线的点的数量，题目leetcode上有-Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
Max-Points-on-a-Line
- 给定的n个点在二维平面上,发现的最大数量点躺在同一直线。-Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.