最小面积三角剖分 [英] minimum area triangulation

问题描述

我想实现以下关于最小面积三角剖分的算法.我有凸包代码.
谁能帮我吗?


1.Jarvis方法用于构建集合S的凸包
(此方法是最好的近似值，因为如果
不位于凸包上的基本点数，我们将得到
时间O(hn)，其中h –凸包上的点).


2.虽然顶点不包含在多边形中:选择
在该多边形点P内的点中，
将与边(u，v)之一形成最大三角形
区域，一个不包含其他点的区域，也包含
不与该多边形的边缘相交(
的可见"边缘 重点).
3.设(u，v)-边，P-形成
三角形的点 满足指定条件的最大面积.切断
边(u，v)并形成两个新的(u，P)和(P，v).返回第2页.

在以下链接中查看更多信息:

http://www.waset.org/journals/waset/v77/v77-122.pdf [ ^ ]

I want to implement following algorithm about minimum area triangulation.I have convex hull code.
Can anyone help me please?


1.Jarvis method for building the convex hull of the set S
(this method is best approximations, because if the
basic number of points not lying on the convex hull, we’ll get
it in time O (hn), where h – points that lie on the convex hull).


2. While the vertex is not included in the polygon: choose
among the points that are inside this polygon point P, which
will form with one of the edges (u, v) the triangle of maximum
area, and one that does not contain other points, and also does
not intersects the edges of this polygon (the edge "seen" from
the point).
3. Let (u, v) - edge, P - points that formed a triangle of
maximum area that satisfied the specified conditions. Severing
edge (u, v) and form two new (u, P) and (P, v). Return to p.2 .

See more information at following link:

http://www.waset.org/journals/waset/v77/v77-122.pdf[^]

推荐答案

我们不做您的作业:它的设置是有原因的.在这里，您可以考虑自己被告知的内容，并尝试理解它.也可以在那里帮助您的导师识别您的弱点，并将更多的注意力放在补救措施上.

自己尝试，如果您遇到某个特定问题，请询问该问题.我们将竭诚为您服务！

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, and if you get stuck on a specific problem, ask about that. We will be happy to help!

这篇关于最小面积三角剖分的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！