CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - plane points
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - plane points - List
[
MPI
]
fig_mpi
DL : 0
Is the figure on the plane, presented in the form of plural-va points (xi, yi) There are changes that need to perform (turning, moving, scaling) Leave the system, which has undertaken the conversion figures, but every single child process may take only one task (ie, three types of child processes) UP 1. reads and forms the shape and steam-we change. 2. preparing assignments 3. gather figure. DP 1. compute 2. or betrays are further along the pipeline (m e, etc DP), or passes the result UP I work only full pipes (those the number of processes and a multiple of 3 +1)
Date
: 2025-12-29
Size
: 1.19mb
User
:
anyman
[
MPI
]
convhull
DL : 0
设平面上n个点为 ,坐标原点为 。可按照下面方法求得包含这n个点的凸多边形。 (1)求最右边点,即x坐标最大点,设为 。 (2) 以 点为中心,在其余 个点中选取与 逆时针旋转角度最小的点,设为 。 (3)再以 点为中心,在其余 个点中选取与 逆时针旋转角度最小的点 。如此类推,直到新选取的点与 点重合为止。设已求得多边形k个点依次为 ,其中第 点与第1点重合。则分别以点 为三角形顶点计算面积并求和即可。 -Let n points in the plane as the coordinate origin is. The following methods can be obtained by including the n-point convex polygon. (1) Find the right of the point, the x coordinate of the maximum point, is set. (2) as the center point, the remaining points in the selection and counterclockwise rotation in the smallest point set. (3) then as the center point, the remaining points in the selection and counter-clockwise rotation of the smallest point. And so on, until the new selected points coincide with the point up. Let k points have been obtained in order for the polygon, where the first point coincides with point 1. Point of the triangle is the vertex of each area and the sum can be calculated.
Date
: 2025-12-29
Size
: 26kb
User
:
pzg
[
MPI
]
voronoi
DL : 0
从Voronoi结构所脱胎的计算几何来看,Voronoi图是对平面n个离散点而言的,它把平面分为几个区,每一个区包括一个点,该点所在的区是到该点距离最近点的集合。-From the perspective of a Voronoi structure have spun out of the computational geometry, Voronoi diagram is for plane n discrete points, it put the plane is divided into several districts, each district includes a point, the point of the area where is the nearest to the point at which point set.
Date
: 2025-12-29
Size
: 3kb
User
:
李阳
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.