Counting of Shortest Paths in Cubic Grid
نویسندگان
چکیده
The enumeration of shortest paths in cubic grid is presented here. The cubic grid considers three neighborhods— 6-neighborhood (face connectivity), 18-neighborhood (edge connectivity), and 26-neighborhood (vertex connectivity). The formulation for distance metrics are given here. L1, D18, and L∞ are the three metrics for 6-neighborhood, 18-neighborhood, and 26-neighborhood. The problem is to find the number of shortest paths based on neighborhoods between two given points in 3D cubic grid represented by coordinate triplets. The formulation for the three neighborhoods are presented here. This problem has theoretical importance and practical aspects.
منابع مشابه
Weight of Shortest Path Analyses for the Optimal Location Problem
In this paper we consider the shortest path counting problem ( S P C P ) : how many shortest paths contain each edge of the network N = (V, E) with the vertex set V and the edge set E? There are n[n 1) shortest paths in the network with \V\ = n, so among all these shortest paths the S P C P requires us to count the number of shortest paths passing each edge. Defining the weight of shortest path...
متن کاملApproximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
We consider two 3-dimensional situations when a polytime algorithm for approximating a shortest path can be constructed. The main part of the paper treats a well known problem of constructing a shortest path touching lines in R3: given a list of straight lines L = (L1, . . . , Ln) in R 3 and two points s and t , find a shortest path that, starting from s , touches the lines Li in the given orde...
متن کاملAny-Angle Path Planning
In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous ...
متن کاملAnt colony algorithm as a high-performance method in resource estimation using LVA field; A case study: Choghart Iron ore deposit
Kriging is an advanced geostatistical procedure that generates an estimated surface or 3D model from a scattered set of points. This method can be used for estimating resources using a grid of sampled boreholes. However, conventional ordinary kriging (OK) is unable to take locally varying anisotropy (LVA) into account. A numerical approach has been presented that generates an LVA field by calcu...
متن کاملPath Planning on Grids: The Effect of Vertex Placement on Path Length
Video-game designers often tessellate continuous 2dimensional terrain into a grid of blocked and unblocked square cells. The three main ways to calculate short paths on such a grid are to determine truly shortest paths, shortest vertex paths and shortest grid paths, listed here in decreasing order of computation time and increasing order of resulting path length. We show that, for both vertex a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018