On Finding Spherical Geodesic Paths and Circles in ℤ3
A discrete spherical geodesic path between two voxels s and t lying on a discrete sphere is a/the 1-connected shortest path from s to t, comprising voxels of the discrete sphere intersected by the real plane passing through s, t, and the center of the sphere. We show that the set of sphere voxels intersected by the aforesaid real plane always contains a 1-connected cycle passing through s and t, and each voxel in this set lies within an isothetic distance of \(\frac32\) from the concerned plane. Hence, to compute the path, the algorithm starts from s, and iteratively computes each voxel p of the path from the predecessor of p. A novel number-theoretic property and the 48-symmetry of discrete sphere are used for searching the 1-connected voxels comprising the path. The algorithm is output-sensitive, having its time and space complexities both linear in the length of the path. It can be extended for constructing 1-connected discrete 3D circles of arbitrary orientations, specified by a few appropriate input parameters. Experimental results and related analysis demonstrate its efficiency and versatility.
KeywordsDiscrete sphere geodesic path geometry of numbers discrete 3D circles
Unable to display preview. Download preview PDF.
- 4.Chen, J., Han, Y.: Shortest paths on a polyhedron. In: Proc. SoCG, pp. 360–369 (1990)Google Scholar
- 6.Cohen-Or, D., Kaufman, A.: Fundamentals of surface voxelization. GMIP 57, 453–461 (1995)Google Scholar
- 7.Coxeter, H.S.M.: Regular Polytopes. Dover Pub. (1973)Google Scholar
- 8.Kimmel, R., Sethian, J.A.: Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci. USA, 8431–8435 (1998)Google Scholar
- 9.Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)Google Scholar
- 13.Polthier, K., Schmies, M.: Straightest geodesics on polyhedral surfaces. In: ACM SIGGRAPH 2006 Courses, pp. 30–38 (2006)Google Scholar
- 16.Xin, S.Q., Wang, G.J.: Improving Chen and Han’s algorithm on the discrete geodesic problem. ACM TOG 28, Art. 104 (2009)Google Scholar
- 17.Xin, S.Q., Ying, X., He, Y.: Constant-time all-pairs geodesic distance query on triangle meshes. In: Proc. I3D 2012, pp. 31–38 (2012)Google Scholar
- 18.Ying, X., Wang, X., He, Y.: Saddle vertex graph (SVG): A novel solution to the discrete geodesic problem. ACM TOG 32, Art. 170 (2013)Google Scholar
- 19.Ying, X., Xin, S.Q., He, Y.: Parallel Chen-Han (PCH) algorithm for discrete geodesics. ACM TOG 33, Art. 9 (2014)Google Scholar