Three common questions, which include Two-dimensional k-coverage (k=1), Two-dimensional maximum k-coverage, Three-dimensional k-coverage (k=1) and Three-dimensional maximum k-coverage, are researched orderly in this paper.
本文逐渐加深依次研究了覆盖问题中比较常见的四个问题:二维k-覆盖(k≥1)、二维最大k-覆盖、三维k-覆盖和三维最大k-覆盖问题。
参考来源 - 基于剖分的传感器网络覆盖快速算法研究Three common questions, which include Two-dimensional k-coverage (k=1), Two-dimensional maximum k-coverage, Three-dimensional k-coverage (k=1) and Three-dimensional maximum k-coverage, are researched orderly in this paper.
本文逐渐加深依次研究了覆盖问题中比较常见的四个问题:二维k-覆盖(k≥1)、二维最大k-覆盖、三维k-覆盖和三维最大k-覆盖问题。
参考来源 - 基于剖分的传感器网络覆盖快速算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
应用推荐