搜索资源列表
Geometry
- 用C++语言实现的各种计算几何算法, 如判断点是否在多边形内, 多边形凸凹性判断, 寻找点集凸包的卷包裹法,求简单多边形的重心,求从多边形外一点出发到该多边形的切线,判断线段是否相交等等! -Using C++ language implementation of a variety of computational geometry algorithms, such as point to determine whether the
inpoly
- 在autocad中，用vba语言来判断点是否在多边形内-In the autocad, the use vba language to determine point-in-polygon
123456
- 判断点是否在多边形内，先画出任意多边形，然后再点一点，会以消息框显示点是否在多边形内-point is whether in the polygon
WTLSelectionWindow
- 用VC++实现了一个小算法，能够判断屏幕上的点在一个多边形外还是多边形内。使用VC++ 2008开发，用到了WTL。-Using VC++ implements a small algorithm, able to determine the point on the screen outside in a polygon or a polygon. Use VC++ 2008 development and use of the WT
geometry
- 判断点是否在多边形内，点是否在有向线段的左边，点是否在圆内，两点是否相交-To determine point-in-polygon, the point of whether there is to the left of line segment, point-in-circle or two whether the intersection
code
- 这五个文件包含五个基本函数，例如，检验点是否在一个多边形内，计算两个时间字符串代表的时间差，显示一个vector的内容等。-/* This method is to check weather a point is inside a polygon outside it*/
RadialPointInPolygon
- 扫描线填充多边形算法,C语言描述，判断点是否在多边形内、-RadialPointInPolygon
Heliport
- 计算简单多边形内，放置一个圆，其最大半径的大小。其中涉及到二分半径，已知半径的情况下两点确定一个圆，一点一边确定一个圆，两边确定一个圆-Calculated within the simple polygon, place a circle, the maximum size of the radius. Half of which related to the radius, known case of two points to d
Judgement
- 一个绝对完美的利用平行于y轴的射线法判断输入的点是否在输入的多边形内或外或边上的小程序-The use of an absolutely perfect parallel to the y-axis ray method to determine whether the input point within or outside the input polygon or edge of a small program
plyno
- 判断一个点是否在已知多边形内，简单多边形，逆时针。-To determine whether a point known polygon, polygon, anti-clockwise.
point
- 关于点在多边形内的一个实现，即射线法。C语言实现的。-Point in the polygon on a realization that ray method. C language implementation.YES.
CSharp
- 在底图上填充不规则区域：逐个判断绘图窗口中的每一个像素，确定它是否在多边形区域内，从而求出们于多边形内的像素。-use C# TO fill unregular area
CPolygon
- 定义了平面多边形类。 其中包括了多边形的很多方法：中心三角化，迪落尼三角化，判断对角线是否在多边形内，等。-Define a plane polygon class Including many polygon method: whether the center triangulation, Di off the Niger Delta, judgment diagonal within the polygon, etc..
TTestMinvexCoh
- 求点集的最小凸包Graham算法。给定平面上的一个点集，找出一个最小点集顺次连结形成一个个凸多边形，使得点集中的点皆在此多边形内或此多边形上，这个凸多边形就是给定点集的二维凸包。 -Demand point set minimum the convex hull Graham algorithm. Given a set of points in the plane, to identify a minimal set of poi
polygon
- 判断某一点是否在多边形内，很好的东西，-When deciding whether a point is in a polygon
isInAngle
- 判定某点是否在某一系列点围成的封闭多边形内-Determine a point surrounded in a series of closed polygons.
Source1
- 判断一个点是否在多边形内还是在多边形外-To determine whether a point is within a polygon
isinpolygo
- 判断点是否在多边形内，在VS2010能运行-To determine whether the point within the polygon, VS2010 can run
point-whether-in-polygon
- 点是否在多边形内的判断，主要面向学习计算机图形学的朋友-Point to determine whether a polygon, mainly for friends to study computer graphics
duobianxingnei
- 判断点是否在多边形内，算法经典，利用常用的射线法实现。-The code applys to judge whether the point is in the polygon.