求一java程序代码，计算convex hull，即平面上n个点的凸包算法，要求条理清晰，易读易懂，满意有加50分！
展开全部
most ubiquitous structure in
computational geometry
-useful to construct other structures
-many applications: robot motion
planning, shape analysis etc.
- a beautiful object, one of the early
success stories in computational
geometry that sparked interest
among Computer Scientists by
the invention of O(nlogn) algorithm
rather than a O(n**3) algorithm.
- intimately related to sorting algorithm
for both lower and upper bound.
Intuitive definition 1
Given a set S = {p1, p2, …, pN} of points in the plane,
the convex hull H(S) is the smallest convex polygon in the plane
that contains all of the points of S.
computational geometry
-useful to construct other structures
-many applications: robot motion
planning, shape analysis etc.
- a beautiful object, one of the early
success stories in computational
geometry that sparked interest
among Computer Scientists by
the invention of O(nlogn) algorithm
rather than a O(n**3) algorithm.
- intimately related to sorting algorithm
for both lower and upper bound.
Intuitive definition 1
Given a set S = {p1, p2, …, pN} of points in the plane,
the convex hull H(S) is the smallest convex polygon in the plane
that contains all of the points of S.
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
什么意思，说详细点
本回答被提问者采纳
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
你是东大谁啊
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
陈龙？？？？这也行。。。
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
更多回答（2）
推荐律师服务：
若未解决您的问题，请您详细描述您的问题，通过百度律临进行免费专业咨询
