Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Balasubramanian, M., Polimeni, J.R., Schwartz, E.L.: Exact geodesics and shortest paths on polyhedral surfaces. IEEE TPAMI 31, 1006–1016 (2009)
Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity—A review. Discrete Appl. Math. 155, 468–495 (2007)
Bülow, T., Klette, R.: Digital curves in 3D space and a linear-time length estimation algorithm. IEEE TPAMI 24, 962–970 (2002)
Chen, J., Han, Y.: Shortest paths on a polyhedron. In: Proc. SoCG, pp. 360–369 (1990)
Coeurjolly, D., Miguet, S., Tougne, L.: 2D and 3D visibility in discrete geometry: An application to discrete geodesic paths. PRL 25, 561–570 (2004)
Cohen-Or, D., Kaufman, A.: Fundamentals of surface voxelization. GMIP 57, 453–461 (1995)
Coxeter, H.S.M.: Regular Polytopes. Dover Pub. (1973)
Kimmel, R., Sethian, J.A.: Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci. USA, 8431–8435 (1998)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Li, F., Klette, R.: Analysis of the rubberband algorithm. Image Vision Comput. 25, 1588–1598 (2007)
Martínez, D., Velho, L., Carvalho, P.C.: Computing geodesics on triangular meshes. Computers & Graphics 29, 667–675 (2005)
Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16, 647–668 (1987)
Polthier, K., Schmies, M.: Straightest geodesics on polyhedral surfaces. In: ACM SIGGRAPH 2006 Courses, pp. 30–38 (2006)
Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S.J., Hoppe, H.: Fast exact and approximate geodesics on meshes. ACM TOG 24, 553–560 (2005)
Toutant, J.L., Andres, E., Roussillon, T.: Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties. Discrete Appl. Math. 161, 2662–2677 (2013)
Xin, S.Q., Wang, G.J.: Improving Chen and Han’s algorithm on the discrete geodesic problem. ACM TOG 28, Art. 104 (2009)
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)
Ying, X., Wang, X., He, Y.: Saddle vertex graph (SVG): A novel solution to the discrete geodesic problem. ACM TOG 32, Art. 170 (2013)
Ying, X., Xin, S.Q., He, Y.: Parallel Chen-Han (PCH) algorithm for discrete geodesics. ACM TOG 33, Art. 9 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Biswas, R., Bhowmick, P. (2014). On Finding Spherical Geodesic Paths and Circles in ℤ3 . In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)