Shortest Path Problems on a Polyhedral Surface
نویسندگان
چکیده
منابع مشابه
Applying the improved Chen and Han's algorithm to different versions of shortest path problems on a polyhedral surface
The computation of shortest paths on a polyhedral surface is a common operation in many computer graphics applications. There are two best known exact algorithms for the ‘‘single source, any destination’’ shortest path problem. One is proposed by Mitchell et al. (1987) [1]. The other is by Chen and Han (1990) [11]. Recently, Xin andWang (2009) [9] improved the CH algorithm by exploiting a filte...
متن کاملEfficiently determining a locally exact shortest path on polyhedral surfaces
In this paper, we present an efficient visibility-based algorithm for determining a locally exact shortest path (LESP) from a source point to a destination point on a (triangulated) polyhedral surface. Our algorithm, of a finitely-iterative scheme, evolves an initial approximately shortest path into a LESP. During each iteration, we first compute the exact shortest path restricted on the curren...
متن کاملShortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy. In this work, we introduce a new methodology for evaluating speed-up tech...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Path Queries on Polyhedral Surfaces and in Polygonal Domains
In this thesis, we present algorithmic solutions to shortest path queries on polyhedral surfaces and in polygonal domains. The research problems addressed in this thesis and shortest path problems in general are fundamental problems in geographic information systems (GIS) and computational geometry. We present novel algorithms that answer approximate shortest path queries between any pair of po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9723-6