Loading...
Please wait, while we are loading the content...
Similar Documents
Generalized Source Shortest Paths on Polyhedral Surfaces
| Content Provider | Semantic Scholar |
|---|---|
| Author | Fort, Marta Sellarès, Joan Antoni |
| Copyright Year | 2007 |
| Abstract | We present an algorithm for computing shortest paths and distances from a single generalized source (point, segment, polygonal chain or polygon) to any query point on a possibly non-convex polyhedral surface. The algorithm also handles the case in which polygonal chain or polygon obstacles on the polyhedral surface are allowed. Moreover, it easily extends to the case of several generalized sources to compute the (implicitly represented) Voronoi diagram of a set of generalized sites on the polyhedral surface. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ima.udg.edu/~mfort/publications/GSSPOPSEuroCG07.pdf |
| Alternate Webpage(s) | http://www.researchgate.net/profile/J_Sellares/publication/232701153_Generalized_source_shortest_paths_on_polyhedral_surfaces/links/02bfe50cb9061cf4f0000000.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
