synovium
发表于 2025-3-28 18:36:45
A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons, algorithms for the .-partitioning problem are presented. Their time complexities are O(. log..) or O(..log .), depending on the properties of the given .-gon. In most cases, both algorithms find .-partitions with no more than 2.(.) components.
完整
发表于 2025-3-28 22:43:00
http://reply.papertrans.cn/28/2742/274108/274108_42.png