The convex decomposition of arbitrary planar polygon 任意平面多邊形的凸分解。
After deeply studying current relative algorithms, and adopting the ideas of advanced decomposition algorithms, a convex decomposition algorithm for arbitrary planar polygons is put forward in the dissertation, which is based on the algorithm of nearest bridging and the ideas of second bridging and loop division 本文通過對國內(nèi)外相關(guān)算法的深入研究,借鑒先進剖分算法的思想,提出了基于環(huán)分割的任意平面多邊形的凸分解算法,包括最近搭橋算法、二次搭橋思想和環(huán)分割思想。