查找给定重叠矩形集合的多边形顶点的算法 [英]Algorithm for finding polygon vertices for a given set of overlapping rectangles
使用具有N个顶点的多边形来估算给定形状的算法是什么? [英]What is an algorithm for estimating a given shape using a polygon with N vertices?
给定一个由 n 个顶点组成的简单多边形 P,以及由 k 个点组成的集合 S,确定每个多边形顶点是否被 S 中的某个点覆盖 [英]Given a simple polygon P, consisting of n vertices, and Set S Of k points, determine if each of the polygon vertices are covered by some point from S