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...
Bewaard in:
| Hoofdauteurs: | , , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Carleton University
2025-02-01
|
| Reeks: | Journal of Computational Geometry |
| Online toegang: | https://jocg.org/index.php/jocg/article/view/5173 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|