Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Approximating shortest paths in weighted square and hexagonal meshes (2404.07562v1)

Published 11 Apr 2024 in cs.CG

Abstract: Continuous 2-dimensional space is often discretized by considering a mesh of weighted cells. In this work we study how well a weighted mesh approximates the space, with respect to shortest paths. We consider a shortest path $ \mathit{SP_w}(s,t) $ from $ s $ to $ t $ in the continuous 2-dimensional space, a shortest vertex path $ \mathit{SVP_w}(s,t) $ (or any-angle path), which is a shortest path where the vertices of the path are vertices of the mesh, and a shortest grid path $ \mathit{SGP_w}(s,t) $, which is a shortest path in a graph associated to the weighted mesh. We provide upper and lower bounds on the ratios $ \frac{\lVert \mathit{SGP_w}(s,t)\rVert}{\lVert \mathit{SP_w}(s,t)\rVert} $, $ \frac{\lVert \mathit{SVP_w}(s,t)\rVert}{\lVert \mathit{SP_w}(s,t)\rVert} $, $ \frac{\lVert \mathit{SGP_w}(s,t)\rVert}{\lVert \mathit{SVP_w}(s,t)\rVert} $ in square and hexagonal meshes, extending previous results for triangular grids. These ratios determine the effectiveness of existing algorithms that compute shortest paths on the graphs obtained from the grids. Our main results are that the ratio $ \frac{\lVert \mathit{SGP_w}(s,t)\rVert}{\lVert \mathit{SP_w}(s,t)\rVert} $ is at most $ \frac{2}{\sqrt{2+\sqrt{2}}} \approx 1.08 $ and $ \frac{2}{\sqrt{2+\sqrt{3}}} \approx 1.04 $ in a square and a hexagonal mesh, respectively.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (58)
  1. An ε𝜀\varepsilonitalic_ε-approximation algorithm for weighted shortest paths on polyhedral surfaces. In Scandinavian Workshop on Algorithm Theory, pages 11–22. Springer, 1998.
  2. Approximation algorithms for geometric shortest path problems. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 286–295, 2000.
  3. Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM, 52(1):25–53, 2005.
  4. Anisotropic polygonal remeshing. In ACM SIGGRAPH 2003 Papers, pages 485–493. 2003.
  5. Relaxed Dijkstra and A*superscript𝐴{A}^{*}italic_A start_POSTSUPERSCRIPT * end_POSTSUPERSCRIPT with linear complexity for robot path planning problems in large-scale grid environments. Soft Computing, 20(10):4149–4171, 2016.
  6. ArcGIS Pro 3.0. Why hexagons? https://pro.arcgis.com/en/pro-app/latest/tool-reference/spatial-statistics/h-whyhexagons.htm. Accessed: 2022-11-15.
  7. Path-length analysis for grid-based path planning. Artificial Intelligence, 301:103560, 2021.
  8. Path planning on grids: The effect of vertex placement on path length. In Eleventh Artificial Intelligence and Interactive Digital Entertainment Conference, 2015.
  9. Comparison of different grid abstractions for pathfinding on maps. In IJCAI, pages 1511–1512. Citeseer, 2003.
  10. On approximating shortest paths in weighted triangular tessellations. Artificial Intelligence, 318:103898, 2023.
  11. Eikonal-based region growing for efficient clustering. Image and Vision Computing, 32(12):1045–1054, 2014.
  12. Global planning on the Mars exploration rovers: Software integration and surface testing. Journal of Field Robotics, 26(4):337–357, 2009.
  13. Shortest path queries among weighted obstacles in the rectilinear plane. SIAM J. Comput., 29(4):1223–1246, 2000.
  14. Triangulation refinement and approximate shortest paths in weighted regions. In P. Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1626–1640. SIAM, 2015.
  15. Pseudolinearity and efficiency. Mathematical Programming, 28(2):226–239, 1984.
  16. Trekking in the Alps without freezing or getting tired. Algorithmica, 18(3):306–323, 1997.
  17. A note on the unsolvability of the weighted region shortest path problem. Computational Geometry, 47(7):724–727, 2014.
  18. Applications of computational geometry to geographic information systems. Handbook of computational geometry, 7:333–388, 2000.
  19. Y. Fu and B. Zhou. Direct sampling on surfaces for high quality remeshing. Computer Aided Geometric Design, 26(6):711–723, 2009.
  20. Procedural generation of roads. In Computer Graphics Forum, volume 29, pages 429–438. Wiley Online Library, 2010.
  21. D. Gaw and A. Meystel. Minimum-time navigation of an unmanned mobile robot in a 2-1/2D world with obstacles. In Proceedings of the 1986 IEEE International Conference on Robotics and Automation, volume 3, pages 1670–1677. IEEE, 1986.
  22. Path planning in 0/1/∞\infty∞ weighted regions with applications. INFORMS J. Comput., 2(3):253–272, 1990.
  23. Path planning with obstacle avoidance by G1superscript𝐺1G^{1}italic_G start_POSTSUPERSCRIPT 1 end_POSTSUPERSCRIPT PH quintic splines. Computer-Aided Design, 75:47–60, 2016.
  24. N. S. Jaklin. On Weighted Regions and Social Crowds: Autonomous-agent Navigation in Virtual Worlds. PhD thesis, Utrecht University, 2016.
  25. Interpolatory quad/triangle subdivision schemes for surface design. Computer Aided Geometric Design, 26(8):904–922, 2009.
  26. Notice of retraction: Practical algorithm for shortest path on large networks with time-dependent edge-length. In 2010 2nd International Conference on Computer Engineering and Technology, volume 2, pages V2–57. IEEE, 2010.
  27. Tactical path finding in urban environments. In First International Workshop on Crowd Simulation. Citeseer, 2005.
  28. An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete & Computational Geometry, 18(4):377–383, 1997.
  29. Coons BVH for freeform geometric models. ACM Transactions on Graphics (TOG), 30(6):1–8, 2011.
  30. Anisotropic quadrangulation. Computer Aided Geometric Design, 28(8):449–462, 2011.
  31. V. Kvachev. Colossal Citadels. http://colossalcitadels.com. Accessed: 2022-04-05.
  32. V. Kvachev. Triangle Grids. https://kvachev.com/blog/posts/triangular-grid/. Accessed: 2022-11-15.
  33. Shortest anisotropic paths on terrains. In International Colloquium on Automata, Languages, and Programming, pages 524–533. Springer, 1999.
  34. Shortest rectilinear paths among weighted obstacles. In Proceedings of the sixth annual symposium on Computational geometry, pages 301–310, 1990.
  35. Simulating water and smoke with an octree data structure. In ACM SIGGRAPH 2004 Papers, pages 457–462. 2004.
  36. J. S. B. Mitchell. Shortest paths and networks. In J. E. Goodman, J. O’Rourke, and C. D. Toth, editors, Handbook of Discrete and Computational Geometry, Second Edition, pages 811–848. Chapman and Hall/CRC, 2017.
  37. J. S. B. Mitchell and C. Papadimitrou. The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38(1):18–73, 1991.
  38. Structure-aware shape processing. In ACM SIGGRAPH 2014 Courses, pages 1–21. 2014.
  39. Mojang Studios. Minecraft. PC, Nintendo, Xbox One, Playstation 4, 2009.
  40. B. N. Nagy. Shortest paths in triangular grids with neighbourhood sequences. Journal of Computing and Information Technology, 11(2):111–122, 2003.
  41. A. Nash. Any-Angle Path Planning. PhD thesis, University of Southern California, 2012.
  42. Non-rigid registration using distance functions. Computer Vision and Image Understanding, 89(2-3):142–165, 2003.
  43. A generalization of dijkstra’s shortest path algorithm with applications to vlsi routing. Journal of Discrete Algorithms, 7(4):377–390, 2009.
  44. S. B. Ram and M. Ramanathan. Shortest path in a multiply-connected domain having curved boundaries. Computer-Aided Design, 45(3):723–732, 2013.
  45. T. Rapcsák. On pseudolinear functions. European Journal of Operational Research, 50(3):353–360, 1991.
  46. Laplace–Beltrami spectra as ‘Shape-DNA’ of surfaces and solids. Computer-Aided Design, 38(4):342–366, 2006.
  47. Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects. IEEE Transactions on Robotics and Automation, 6(5):540–553, 1990.
  48. M. Sharir and S. Sifrony. Coordinated motion planning for two independent robots. Annals of Mathematics and Artificial Intelligence, 3(1):107–130, 1991.
  49. Efficient MRF deformation model for non-rigid image matching. Computer Vision and Image Understanding, 112(1):91–99, 2008.
  50. Converting a CAD model into a non-uniform subdivision surface. Computer Aided Geometric Design, 48:17–35, 2016.
  51. Pathfinding and abstraction with dynamic terrain costs. In Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, volume 15, pages 80–86, 2019.
  52. Z. Sun and J. H. Reif. On finding approximate optimal paths in weighted regions. Journal of Algorithms, 58(1):1–32, 2006.
  53. A comparative study of navigation meshes. In Proceedings of the 9th International Conference on Motion in Games, pages 91–100, 2016.
  54. Superpixel segmentation: A benchmark. Signal Processing: Image Communication, 56:28–39, 2017.
  55. Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces. Computer Aided Geometric Design, 52:262–284, 2017.
  56. A parallel algorithm for improving the maximal property of Poisson disk sampling. Computer-Aided Design, 46:37–44, 2014.
  57. Real-time editing of man-made mesh models under geometric constraints. Computers & Graphics, 82:174–182, 2019.
  58. Synthesis of progressively-variant textures on arbitrary surfaces. In ACM SIGGRAPH 2003 Papers, pages 295–302. 2003.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets