Shortest paths in portalgons
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric. We refer to such a representation as a portalg...
Збережено в:
| Автори: | , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Carleton University
2025-02-01
|
| Серія: | Journal of Computational Geometry |
| Онлайн доступ: | https://jocg.org/index.php/jocg/article/view/5173 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|