Fast construction of discrete geodesic graph as generalized discrete geodesic approximation algorithms
Discrete geodesic graph (DGG) is an emerging technique for computing geodesic distances and paths on polyhedral surfaces. DGG has many advantages, such as information reuse, accuracy control, ease of parallelization, good scalability, and guaranteed metric, fast linear time SSAD search. To...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/70313 |