排序方式: 共有2条查询结果,搜索用时 287 毫秒
1
1.
We show that given a simple Polygon P it is NP‐hard to determine the smallest α ∈ [0, π] such that P can be illuminated by α‐vertexlights, if we place exactly one α‐vertexlight in each vertex of P. 相似文献
2.
1