Sciweavers

DCG   2010
Wall of Fame | Most Viewed DCG-2010 Paper
DCG
2010
289views more  DCG 2010»
13 years 5 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source289
2Download preprint from source171
3Download preprint from source146
4Download preprint from source137
5Download preprint from source135
6Download preprint from source132
7Download preprint from source122
8Download preprint from source121
9Download preprint from source118
10Download preprint from source107
11Download preprint from source104
12Download preprint from source101
13Download preprint from source101
14Download preprint from source97
15Download preprint from source93
16Download preprint from source93
17Download preprint from source91
18Download preprint from source88
19Download preprint from source87
20Download preprint from source85
21Download preprint from source84
22Download preprint from source84
23Download preprint from source84
24Download preprint from source80
25Download preprint from source79
26Download preprint from source78
27Download preprint from source77
28Download preprint from source76
29Download preprint from source76
30Download preprint from source75
31Download preprint from source73
32Download preprint from source71
33Download preprint from source71
34Download preprint from source69
35Download preprint from source67
36Download preprint from source67
37Download preprint from source65
38Download preprint from source64
39Download preprint from source64
40Download preprint from source64
41Download preprint from source64
42Download preprint from source61
43Download preprint from source61
44Download preprint from source57
45Download preprint from source53
46Download preprint from source45