|
|||||
|
|
Reprint of: Memory-constrained algorithms for simple polygons |
|
| Institution: | 1. JAIST, Japan;2. TU Eindhoven, The Netherlands;3. UPC, Barcelona, Spain;4. Freie Universität Berlin, Germany;5. WWU Münster, Germany |
| Abstract: | |
| Keywords: | Space–time trade-off Constant workspace Triangulation Shortest path Simple polygon |
| 本文献已被 ScienceDirect 等数据库收录！ | |