计算几何问题 [英] computational geometry problem

问题描述

如何获取最小面积三角剖分的可执行代码?

how can I get executable code for minimum area triangulation?

推荐答案

在Google上找到它，然后将其窃取...

Find it on google, then steal it...

首先，您如何用基本的代数和三角函数在纸上解决这个问题?

如果可以的话，如果您在那时遇到问题，我们可以帮助您开始将其转换为代码.

First, how would you solve this on paper with basic algebra and trigonometry?

If you can present that, we can help you get started converting it into code if you have issues at that point.

您可以定义什么最小面积三角剖分"

是覆盖平面网格表面所需的最小三角形数量吗?

使用平面网格查找外部线条.这些将是您的起始多边形.

遍历多边形的边缘，每当您找到一个内部锐角时，就画一条直线，将两个不相连的点连接起来.然后，将第二点用作起点，并继续该过程，直到填充了多边形.执行此操作时，请注意不要越过任何现有的线.如果连接这些点，则使您越过现有线，然后继续围绕内边缘，直到找到另一个可以不交叉而可以连接的锐角.

您可以使用笔和纸轻松完成此操作，以了解其工作原理.

绘制一些随机多边形，然后从任意交点开始并按照上述方法进行处理.

Can you define what ''minimum area triangulation''

Is it the minimum number of triangles needed to cover the surface of a flat mesh?

With a flat mesh, find the outside lines. These will be your starting polygon.

Traverse the edges of the polygon, and everytime you find an inside acute angle, draw a line, connecting the the two non-joined points. Then use the second point as your starting point, and continue the process until the polygon is filled. As you do this, take care not to cross any existing lines. If connecting the points, causes you to cross an existing line, then continue around the inner edge until you find another acute angle that you can connect without crossing.

You can do this easily with pen and paper to seee how it works.

Draw some random polygon, and start at any intersection and work around it as described above.

这篇关于计算几何问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！