|
|||||
|
|
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments |
|
| Institution: | Department of Computer Science, Kyonggi University, Suwon, Republic of Korea |
| Abstract: | |
| Keywords: | Voronoi diagram Line segments Farthest-color Voronoi diagram Davenport–Schinzel sequence Tight bound |
| 本文献已被 ScienceDirect 等数据库收录！ | |