Constant-time all-pairs geodesic distance query on triangle meshes
Computing discrete geodesics on polyhedral surfaces plays an important role in computer graphics. In contrast to the well-studied "single-source, all-destination" discrete geodesic problem, little progress has been reported to the all-pairs geodesic, i.e., computing the geodesic distance b...
| Asıl Yazarlar: | , , |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Conference Paper |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
2013
|
| Konular: | |
| Online Erişim: | https://hdl.handle.net/10356/96690 http://hdl.handle.net/10220/12996 |