如何找到多边形极值点 [英] how to find polygon extreme points

问题描述

我需要帮助才能找到多边形的极端点。示例三角形点。三角形上有3个极值点，在三角形结构的每个角上示例点A（8,15），点B（1,2）点C（16,2）是否有人可以帮助我？样本集大小为16X 16.


谢谢

解决方案

绘制多边形时......你会已经有了为多边形绘制的点....所以最重要的是什么

@ThatThatGuy

$ b $我希望运行一个程序，以确定自从我从孩子们那里拍摄草图以来的极端点。它们的大小或绘制形状的区域不同于个体...

查看一些名为Convex Hull Generation（即Google）的东西。有很多资源可供您使用，算法很容易编码。


这里有一些维基页面，但你可能想谷歌了解更多细节:)

http://en.wikipedia.org/ wiki / Convex_hull
http://en.wikipedia.org /维基/ Gift_wrapping_algorithm

hi, i need help to find extreme points of polygon. example triangle points. there is 3 extreme points on triangle, on each corner of the triangle structure example points A (8, 15), point B (1, 2) points C (16,2)does anyone can help me on it? the sample set size is 16X 16.

thanks

解决方案

When you draw the polygon... you''ll already have the points to be drawn for the polygon.... so whats the big deal

@ThatThatGuy
i want to run a program to identify the extreme points since i took sketches from children. they size or area of drawn shape is varies from the individual...

Look into something called Convex Hull Generation (ie, Google). There''s quite a few resources available for you, and the algorithm is pretty easy to code.

Here''s some wiki pages, but you might want to google for more details :)

http://en.wikipedia.org/wiki/Convex_hull
http://en.wikipedia.org/wiki/Gift_wrapping_algorithm

这篇关于如何找到多边形极值点的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！