搜索资源列表
geometry_c++
- 计算几何学常用算法库 C++语言实现 代码内容 计算几何学常用算法库，包括以下算法： 确定两条线段是否相交 判断点p是否在线段上 判断点q是否在多边形Polygon内 计算多边形的面积 寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm li
cagd_arithmetic
- 怒火之袍的贡献，有算法介绍如判断点是否在线段上、判断两线段是否相交、判断线段和直线是否相交、判断点是否在多边形中、判断线段是否在多边形内、计算点到线段的最近点、计算点到圆的最近距离及交点坐标、计算两条共线的线段的交点、求线段或直线与圆的交点、凸包的求法等等，图文并茂-Army's contribution to the gowns, as introduced algorithm to determine the point of whether online, to judge whe
mylineseg
- 线段及直线的基本运算 1. 点与线段的关系2. 求点到线段所在直线垂线的垂足3. 点到线段的最近点4. 点到线段所在直线的距离 5. 点到折线集的最近距离 6. 判断圆是否在多边形内7. 求矢量夹角余弦 8. 求线段之间的夹角9. 判断线段是否相交10.判断线段是否相交但不交在端点处11.求线段所在直线的方程 12.求直线的斜率 13.求直线的倾斜角14.求点关于某直线的对称点15.判断两条直线是否相交及求直线交点 16.判断线段是否相交，如果相交返回交点-straight line segme
poly_cross
- 求两个多变行是否相交。里面用到了线段是否相交函数，希望对大家有用。-Seek whether the intersection of two changeable. Whether it used the segment intersection function, useful for all of us hope.
polygoncut
- 对任意多边形进行切割，求其相交部分,相交部分用红色线段标出。-draw two polygon and then they can cut each other.The color of intersected parts are red.
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
SutherlandTriCubeIntersectTest
- 三角形和立方体的相交测试demo，OpenGL实现 使用3维Sutherland算法做优化 线段与三角的相交测试技术与D3D的拾取示例实现相同-Triangle and cube intersection test demo, OpenGL implementation. use3-D Sutherland algorithm for optimization .line segment and triangle intersection test using the same tech
display
- 简单计算机层析成像投影图像仿真软件,具体功能为射线与图像相交，所得到的线段的长度。用于X射线投影有关用途。-Simple computer tomography projection image simulation software, the specific function is getting the segment length of the ray with the image. It is for X-ray projection .
DTBasicFuctions
- 一些GIS计算公共方法 判断两个矩形是否相交 判断两个线段是否相交 判断点是否在面内 判断线与面是否相交 判断线与矩形是否相交 判断点是否在线上 计算线段的地理方位角-GIS calculation method to determine some of the public to judge two rectangles are intersected to determine the intersection point of two line segments
MFCWORK2_CUT
- 绘图区中绘制矩形和线段，相交部分进行矩形对线段的裁剪-Drawing area, draw a rectangle and line segments, the intersection of rectangular cut on the line segment
HaveSamePoint
- 在二维平面下，输入两条线段的始末坐标，并判断该两条线段是否相交-In the two-dimension plane,input begin and end positions of two line segments, then judge two of them have the same point
line_intersect
- 判断过线段外一点沿某角度的直线是否与线段相交，如果相交则返回交点-to check the intersecting relationship about a line with a specified point along a specified angle and a line segment. to return the intersecting point coordinate if intersected.
扫描线算法求线段交点
- 利用经典的扫描线算法求两两相交的线段集交点。(Scan line algorithm for line set intersection points.)