分割一般封闭多边形的算法 [英] Algorithm for partitioning a general closed polygon

问题描述

我可以得到一些有关如何分区的可读文献的指针吗?
将普通多边形分成单调链.我正在尝试使用gpc库进行多边形剪裁，该剪裁会产生太多的最小值(是两次)，这很有趣-有些事情很有趣.

Can I get some pointers to readable literature on how to partition
a general polygon into montone chains. I am trying to use the gpc library for polygon clipping which generates minimas which are far too too (yes twice over) many - something is funny.

推荐答案

考虑使用Google吗?搜索将多边形划分为单调链"，您将获得22,000个结果.当然，其中之一必须是可读的".

Did you even think about using google? Search for "partition polygon into monotone chains" and you''ll get 22,000 results. Surely, one of those has to be "readable".

这篇关于分割一般封闭多边形的算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！