"如何在Web Service [ASP.NET，C#]中使用凸凸算法? [英] "How to use convexHull algorithms in web Service[ASP.NET ,C# ]?

问题描述

大家好.

我需要做一个关于Web Service [WİTHC#]中的凸凸算法的项目.
此处的算法名称:

•又名礼品包装Jarvis游行:
最简单的(虽然在最坏的情况下不是最省时的)平面算法之一.由Chand&Kapur在1970年和R. A. Jarvis在1973年独立发现.它具有O(nh)时间复杂度，其中n是集合中的点数，h是船体中的点数.在最坏的情况下，复杂度为Θ(n2).
•格雷厄姆扫描:
罗纳德·格雷厄姆(Ronald Graham)于1972年发布的一种稍微复杂一点，但效率更高的算法.如果点已按坐标之一或固定矢量的夹角进行排序，则该算法将花费O(n)时间. />

如果有人帮忙，对我来说太好了.谢谢大家.

hello to all .

I need to do a project about convexHull algorithms in web Service [WİTH C#].
Algorithm names here :

•Gift wrapping aka Jarvis march :
One of the simplest (although not the most time efficient in the worst case) planar algorithms. Discovered independently by Chand & Kapur in 1970 and R. A. Jarvis in 1973. It has O(nh) time complexity, where n is the number of points in the set, and h is the number of points in the hull. In the worst case the complexity is Θ(n2).
•Graham scan :
A slightly more sophisticated, but much more efficient algorithm, published by Ronald Graham in 1972. If the points are already sorted by one of the coordinates or by the angle to a fixed vector, then the algorithm takes O(n) time.


İf anyone help it will be great for me . Thank you all .

推荐答案

最佳参考可从CodeProject获得: ^ ]

Best reference is available at CodeProject: Convex Hull[^]

也许也是起点(3D):
http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html [ ^ ]

问候

Maybe also a starting point (3D):
http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html[^]

Regards

这篇关于"如何在Web Service [ASP.NET，C#]中使用凸凸算法?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！