The point-feature Label Placement (PFLP) has been proved to be NP-hard , so the published algorithms are either have exponential time complaxity or are incomplete .

• 点标注问题（Point- Feature Label placement , PFLP）已经被证明是NP难的，因此已有的标注算法或者具有指数级别的运算时间复杂度,或者算法本身是不完全的。