搜索资源列表
Convexhullproblem
- 点集Q的凸包(convex hull)是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内-The convex hull of point set Q (convex hull) is a minimum convex polygon, to meet the Q of the point or the edge of or within this polygon
plyno
- 判断一个点是否在已知多边形内，简单多边形，逆时针。-To determine whether a point known polygon, polygon, anti-clockwise.
CH
- 令S是平面上的一个点集，封闭S中所有顶点的最小凸多边形，称为S的凸包，表示为CH（S）。如下图中由红色线段表示的多边形就是点集Q={p0,p1,...p12}的凸包。-ConvHull problem
imagedraw
- juery解析xml取得多边形各点循环绘图范例，使用html5的canvas-the parse xml obtain point cycle drawing polygons example on juery use html5' s canvas
paint
- 一个画板工具，可以画线，点，多边形，矩形等等各种图形-A sketch tool, you can draw lines, points, polygons, rectangles, and so on a variety of graphics
JTS
- 根据输入点组成线和面，并计算组成的凸多边形的质心、面积、是否和指定线交叉等-The input lines of dots and the surface, and calculate the composition of the convex polygon centroid, area, and whether the specified line cross, etc.
Leaflet.draw-master
- leaflet 绘制工具类，用于绘制相关的多边形以及线、点面-Leaflet drawing tool class, used to draw the relevant polygon and line, point surface