文摘
Given a polygon P(V,E)P(V,E), our objective is to insert a smallest set (V∪V′)(V∪V′) of vertices on the edges of P such that P can be uniquely reconstructed from the unordered set of vertices. The maximum number of extra vertices is determined by |V||V| and certain geometric parameters of P. A non-trivial lower bound on the required number of pseudo-vertices is an interesting problem to solve.