I wonder if we can solve the shortest-path with a space filling curve or is there a better solution? How good would be the approximation compared to an exact solver? The graph doesn't need to satisfy the triangle inequality.
Can we solve the shortest-path with a space filling curve?
278 Views Asked by Micromega At
1
There are 1 best solutions below
Related Questions in SHORTEST-PATH
- Algorithm for path in an undirected graph between 2 points
- How to get vertices in shortest path using python igraph?
- Pacman java Game runs very slow almost freezes when smart ghost is moving (DIjkstra algorithm shortest path)
- Airport travels using graph
- How to find a survivable shortest-path tree in a directed graph
- Difference between Neo4j Dijkstra and shortestPath performance?
- Modify C igraph shortest.path "weights" argument
- Shortest path in a directed graph with incorporating global path weight
- Graph shortest path confusion
- Dynamic programming and Dijkstra
- Graph shortest path infinite cycle
- TLE using DP for Timus Online Judge
- Prolog: Shortest Path for Knight
- How can I determine the best data structure/implementation for my dataset?
- No negative cycles when determining path between two nodes
Related Questions in SPACE-FILLING-CURVE
- How to create a generator with recursion?
- Calculating Hilbert Curve by iteration for a Coordinated List (COO) Sparse Matrix
- Range search with Hilbert Curve Index
- How to find the neighbours around a Hilbert Curve cell
- Space filling curve for nodes ordering
- How to calculate the Snake Index in N dimensions?
- Plotly 3D filling under the line
- When calculating Z Order, how does one implement BIGMIN and LITMAX for more than 2 dimensions?
- Interleave float coordinates without error
- 2D cache-friendly data structures and space-filling curves
- Hilbert Curve: Implementing for N-Dimensions
- What is a fast n-dimensional Z-order curve algorithm?
- What is the Pseudo-Hillbert curve equivalent for hexogonal and triangular tesselations?
- Generating a 3D space filling Hilbert curve using turtle graphics
- CUDA / OpenCL cache coherence, locality and space-filling curves
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
A* with good heuristic function is generally the best solution (in terms of speed and finding shortest path).
I'm not sure what do you want to achieve with space-filling curve. I suppose it could give you interesting path in areas where costs are equal.