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...
Spremljeno u:
| Glavni autori: | , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Carleton University
2025-02-01
|
| Serija: | Journal of Computational Geometry |
| Online pristup: | https://jocg.org/index.php/jocg/article/view/5173 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|