Search - plane points

Search - plane points - List

[Other] Rectangle DL : 0: 在考虑平面上“点类”和“矩形类”的关系时，由于出发点不同，可以有多种方式，例如：可以认为一个矩形对象由两个点类对象组成（左上角和右下角），也可以认为矩形是在点的基础上加上宽和高构成的，-considering the plane "in category" and "rectangle" in the relationship, as the starting point will be different, a variety of forms, such as : a rectangle that can be targeted by the two types of objects composed points (upper left and lower right), could also be considered in rectangular points on the basis of added width and high consisting of,
Date : 2025-12-29 Size : 243kb User : 刘洁
[Other] stars DL : 0: 程序源码。通过编译，运行成功。原题：Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astronomers want to know the distribution of the levels of the stars. -procedures source. By compiling, running successfully. Original title : Astronomers often examine star maps where star s are represented by points on a plane and each st ar has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astronome rs want to know the distribution of the levels of the stars.
Date : 2025-12-29 Size : 1kb User : 孙威
[Other] readtext DL : 0: 读取mif文件里的点、线、面坐标并输出到一个新文件，按格式点坐标，线点的个数点的坐标，面顶点数坐标-Mif file to read the point, line and plane coordinates and the output to a new document, according to the format point coordinates, line points, the number of point coordinates, surface Vertices coordinates
Date : 2025-12-29 Size : 8kb User : haoqian
[Other] dia DL : 0: 给定平面上n个点组成的多边形P的相继n条边的长度，试设计一个O(n)时间算法，计算多边形P的直径 -A given plane, composed of n points of the polygon P have n edges of length, try to design a O (n) time algorithm to calculate the diameter of the polygon P
Date : 2025-12-29 Size : 1kb User : 王八
[Other] ZJU2007CSTEST1 DL : 0: 给定一系列2维平面点的坐标(x, y)，其中x和y均为整数，要求用一个最小的长方形框将所有点框在内。长方形框的边分别平行于x和y坐标轴，点落在边上也算是被框在内。-Given a series of 2-dimensional plane the coordinates of points (x, y), in which x and y are integers, with a minimum requirement of a rectangular box including all the points box. Rectangular box parallel to the edge, respectively, x and y coordinate axis, point fall on the edge of the box is also regarded as being included.
Date : 2025-12-29 Size : 1kb User : tom
[Other] chull_3dConvexHull DL : 0: 求空间点集的三维凸包。chull.cpp, chull.h。来自计算几何英文原著作者个人网站。-computer 3D convex hull of a set of points. The set of points are not on a same plane.
Date : 2025-12-29 Size : 5kb User : liuctic
[Other] closestPair DL : 0: 给定平面上的n个点，找其中的一对点，使得在n个点组成的所有点对中，该点对间的距离最小。-Plane on a given n points, find one of a pair of points, making the composition of the n points of all points, the distance between points on the smallest.
Date : 2025-12-29 Size : 50kb User : zhouyunkai
[Other] Membrane DL : 0: This program simulates wave propagation on the plane which I called membrane . Really it is based on the grid of pixel points connected by springs. Model is very simplified but it is possible to observe some wave effects such as diffraction.-This program simulates wave propagation on the plane which I called membrane . Really it is based on the grid of pixel points connected by springs. Model is very simplified but it is possible to observe some wave effects such as diffraction.
Date : 2025-12-29 Size : 12kb User : Eruanno
[Other] algorithms DL : 0: quicksort的迭代样式算法实现平面内n个点求最近两点间的距离（分治算法）算法数据结构-quicksort algorithm iterative style of plane n-point demand recently the distance between two points (sub-rule algorithm) algorithm for data structure
Date : 2025-12-29 Size : 1kb User : robey
[Other] Delaunay-triangulations DL : 0: GEOMPACK - Voronoi diagrams, Delaunay triangulations GEOMPACK is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane. -GEOMPACK- Voronoi diagrams, Delaunay triangulations GEOMPACK is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane.
Date : 2025-12-29 Size : 85kb User : followtime
[Other] Find DL : 0: 北邮复试上机题（两种方法）： Description 在平面上的n个点中找出横坐标最小的点。 Input 第一行是一个正整数n（1<=n<=1000），表示一共有n个点。接下来n行，每行2个整数，分别表示每个点的横坐标和纵坐标。 Output 输出横坐标最小的那个点的横坐标和纵坐标，如果横坐标最小的点有多个，则只输出其中纵坐标最小的那个点。 Sample Input 5 5 2 2 3 2 4 3 2 4 1 Sample Output 2 3-Description N points on the plane to find the abscissa of the minimum point. Input The first line is a positive integer n (1 <= n <= 1000), said a total of n points. The next n lines, each line two integers that represent horizontal and vertical coordinates of each point. Output Output abscissa of the minimum point of abscissa and ordinate, if the abscissa of the minimum point, only the output of which the vertical axis the smallest point. Sample Input 5 52 23 24 32 41 Sample Output 23
Date : 2025-12-29 Size : 1kb User : Jeniffer1
[Other] square DL : 0: 在一个二维平面上给定N个点（4 <= N<=1000 ）Pi(xi,yi) ( Pi(xi,yi) ( |xi| <= 20000 ,|yi| <= 20000,不存在重复点存在重复点 ), 请问在这些点中能形成多少个正方。 -Given a two-dimensional plane of N points (4 < = N < = 1000) Pi, (xi, yi) (Pi (xi, yi) (| xi | < = 20000, | yi | < = 20000 does not exist repeat duplicate points), does the square of the number of these points can be formed.
Date : 2025-12-29 Size : 1kb User : chen
[Other] FitC DL : 0: 有了平面上的一群点，疑似圆弧，想求其圆心和半径。提供了简单易懂的代码实现方法-With a group of points in the plane, suspected arcs, would like to seek the center and radius. Provides a simple code
Date : 2025-12-29 Size : 10kb User : xuxiangxing
[Other] source DL : 0: //给定平面上的几个点求某个矩形区域包含几个点 //要是点的坐标比较小可以直接N^2的预处理 1的查询对每次查询暴力当然也可以，但是适用性可以认为为0。。。 //这个算法不受点的坐标的影响也不受矩形坐标的影响效率为nlogn + mlogn n:点的个数 m:为查询次数 //先对数据已x坐标排序，这样可以二分出大致区间 //对于y坐标的处理（我上一年的时候直接暴力），昨天忽然灵感突现，用归并树保存x坐标排序后的数据的每段的y坐标序，然后再进行二分） -//Given a few points on the plane seeking a rectangular area contains several points// if the coordinates of the point is relatively small direct N ^ 2 pretreatment 1 course each query violence, but the applicability It can be considered as 0. . .// The coordinates of this algorithm from point not affect the efficiency of the rectangular coordinates nlogn+ m log n n: number of points m: as the number of queries// first sort data x coordinate, so two approximate interval is separated// y coordinate processing (direct violence) of the previous year when, yesterday, all of a sudden inspiration came, the y coordinate of the sequence of each segment of the x coordinate of the sort of data saved by merging tree, then two points)
Date : 2025-12-29 Size : 1kb User : sdad
[Other] closest-pairs DL : 0: 给出平面上的N 个二维点，求出距离最小的2 个点对。本题中距离定义为他们的直线距离。例如(0,0) (3,4)的距离为5.-The given N-dimensional points on the plane, find the minimum distance of the two pairs of points. Distance defined in the title for their straight-line distance. For example, (0,0), (3,4), the distance is 5.
Date : 2025-12-29 Size : 55kb User : 钟联合
[Other] batewosi DL : 0: 已知巴特沃思幅度平方函数,可以求得Ha函数在S左半平面的N时极值点Sk。由题意，试设计一通用程序，由键盘输入H1.W1，和H2，W2。求c,N和Sk值。-Known the Butterworth magnitude squared function, we can obtain the Ha function in the left half-plane S N when extreme points Sk. By the meaning of the questions, try to design a general program, by the keyboard input H1.W1, and H2, W2. Find the value of c, N and Sk.
Date : 2025-12-29 Size : 143kb User : 朱朱
[Other] JPDA DL : 0: 在运动的位置叠加噪声。进行JPDA概率数据关联及kalman滤波。两运动目标在x-y平面做匀速直线运动。初始位置是（4000,1200）（300,1500）速度分别是（200,200）（400,200）传感器对量目标进行位置状态量测。采样间隔T=1,点数n=80.检测概率为1，正确量测落入跟踪内的概率为0.99，杂波均匀分布的密度为2个/km2由RAND函数产生在[0，1]上均匀分布的随机变量，跟踪门限为9.21。 -Superimposed noise in the position of the movement. JPDA probabilistic data association and kalman filtering. Two moving targets uniform linear motion in the xy plane. The initial position (4000,1200) (300,1500) speed (200,200) (400,200) position sensor on the amount of target state measurements. Sampling interval T = 1, points n = 80. Detection probability of correctly measured fall into the tracking probability 0.99, 2/km2 clutter uniform distribution of density generated by the RAND function [0,1] uniformly distributed random variables tracking threshold of 9.21.
Date : 2025-12-29 Size : 3kb User : 雪
[Other] CloseCurve DL : 0: 根据平面上多边形顶点序列数据，以最大y值为起始点，逆时针方向重新对数据点排列的vb源程序-According plane polygon vertex sequence data, the maximum y value of the starting point, the data points counterclockwise re-arranged vb source
Date : 2025-12-29 Size : 5kb User : lfn
[Other] ClosestPair DL : 0: 平面最近点对问题是计算几何学中研究的基本问题之一。假设在平面S上有n个点，在这n个点所组成的点对中，寻找距离最近点对问题。例如：有两点与。它们之间的距离为：。n个点可以组成个点对，找其中的一点对，使得在n个点组成的所的点对中，该点对的为最小。-Plane closest point to the problem is one of the basic problems of research in computational geometry. Suppose there are n points in the plane S, in which n point by point to, to find the closest point to the problem. For example: there are two points and. The distance between them is:. N point can form a point to, to find the point of, make in the n of point by point to, to the point at which to a minimum.
Date : 2025-12-29 Size : 1.83mb User : 李阳
[Other] linecross DL : 0: 能够进行空间三点求解平面方程，方便进行空间几何计算-Able to space three points for solving plane equation，To facilitate spatial geometric calculation
Date : 2025-12-29 Size : 15kb User : 张大为

« 12 »