Touring a sequence of spheres in R3
*Chang-Chien ChouCorresponding authorsamuelchou7@yahoo.com.twDepartment of Information Management Lunghwa University of Science and TechnologyWanshou Rd., Guishan District, Taoyuan City, 33360, Taiwan, R.O.C.View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 14 Nov 2023
- Published Online:
- 30 Nov 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2002
- Pages:
- 1615–1636
Abstract
Keywords
Subject Classifications
References
[1] K. Agrawal and P. Khetarpal, “Computational intelligence in edge and cloud computing,” J. Inf. Optim. Sci., vol. 43, no. 3, pp. 607–613 (2022).
[2] T. Amgoth and P. K. Jana, “Coverage hole detection and restoration algorithm for wireless sensor networks,” Peer-to-Peer Netw. Appl., vol. 10, no. 1, pp. 66–78 (2017).
[3] A. M. Aragón and J. F. Molinari, “A hierarchical detection framework for computational contact mechanics,” Comput. Methods Appl. Mech. Eng., vol. 268, pp. 574–588 (2014).
[4] C. Bai, S. Greenhalgh, and B. Zhou, “3D ray tracing using a modified shortest-path method,” Geophysics, vol. 72, no. 4, pp. T27–T36 (2007).
[5] H. Chen, X. Wang, B. Ge, T. Zhang, and Z. Zhu, “A multi-strategy improved sparrow search algorithm for coverage optimization in a WSN,” Sensors, vol. 23, no. 8, p. 4124 (2023).
[6] C. C. Chou, “An efficient algorithm for relay placement in a ring sensor networks,” Expert Syst. Appl., vol. 37, no. 7, pp. 4830–4841 (2010).
[7] C. C. Chou, “On the shortest path touring n circles,” Int. J. Adv. Comput. Technol., vol. 4, no. 10, pp. 356–364 (2012).
[8] C. C. Chou, Y. K. Chen, and S. Y. Chou, “A fundamental tool path planning problem for circles in layered manufacturing,” Integr. Comput.-Aided Eng., vol. 15, no. 1, pp. 37–52 (2008).
[9] S. Y. Chou, C. C. Chou, and Y. K. Chen, “A base function for generating contour traversal paths in stereolithography apparatus applications,” Expert Syst. Appl., vol. 35, no. 1–2, pp. 235–244 (2008).
[10] K. C. Ciesielski, R. Strand, F. Malmberg, and P. K. Saha, “Efficient algorithm for finding the exact minimum barrier distance,” Comput. Vis. Image Understand., vol. 123, pp. 53–64 (2014).
[11] A. F. Cook IV and C. Wenk, “Shortest path problems on a polyhedral surface,” Algorithmica, vol. 69, no. 1, pp. 58–77 (2014).
[12] M. Dror, A. Efrat, A. Lubiw, and J. S. B. Mitchell, “Touring a sequence of polygons,” in Proc. 35th ACM Symp. Theory of Comput., San Diego, CA, USA, pp. 473–482 (2003).
[13] A. Efrat, S. P. Fekete, P. R. Gaddehosur, J. S. B. Mitchell, V. Polishchuk, and J. Suomela, “Improved approximation algorithms for relay placement,” in Lecture Notes Comput. Sci., vol. 5193, pp. 356–367 (2008).
[14] S. M. Feeman, L. B. Wright, J. L. Salmon, and H. Dodziuk, “Exploration and evaluation of CAD modeling in virtual reality,” Comput.-Aided Design Appl., vol. 15, no. 6, pp. 892–904 (2018).
[15] B. Giroux and B. Larouche, “Task-parallel implementation of 3D shortest path raytracing for geophysical applications,” Comput. Geosci., vol. 54, pp. 130–141 (2013).
[16] D. Hall, S. Li, K. Yamashita, R. Azuma, J. A. Carver, and D. M. Standley, “A novel protein distance matrix based on the minimum arc-length between two amino-acid residues on the surface of a globular protein,” Biophys. Chem., vol. 190–191, pp. 50–55 (2014).
[17] I. S. Kim, “An algorithm for finding the distance between two ellipses,” Commun. Korean Math. Soc., vol. 21, no. 3, pp. 559–567 (2006).
[18] K. Lee, J. K. Seong, K. J. Kim, and S. J. Hong, “Minimum distance between two sphere-swept surfaces,” Comput.-Aided Des., vol. 39, pp. 452–459 (2007).
[19] L. Liberti, C. Lavor, N. Maculan, and A. Mucherino, “Euclidean distance geometry and applications,” SIAM Rev., vol. 56, no. 1, pp. 3–69 (2014).
[20] Y. Ma, C. Tu, and W. Wang, “Distance computation for canal surfaces using cone-sphere bounding volumes,” Comput. Aided Geom. Des., vol. 29, no. 5, pp. 255–264 (2012).
[21] C. A. Neff, “Finding the distance between two circles in three-dimensional space,” IBM J. Res. Dev., vol. 34, no. 5, pp. 770–775 (1990).
[22] J. T. Schwartz, “Finding the minimum distance between two convex polygons,” Inf. Process. Lett., vol. 13, no. 4–5, pp. 168–170 (1981).
[23] N. Singh and D. Virmani, “Computational method to prove efficacy of datasets,” J. Inf. Optim. Sci., vol. 42, no. 1, pp. 211–233 (2021).
[24] B. R. Sundar, A. Chunduru, R. Tiwari, A. Gupta, and R. Muthuganapathy, “Footpoint distance as a measure of distance computation between curves and surfaces,” Comput. Graph., vol. 38, pp. 300–309 (2014).
[25] M. A. F. Vicente, A. Goncalves, and J. Vitoria, “Euclidean distance between two linear varieties,” Appl. Math. Sci., vol. 8, no. 21, pp. 1039–1043 (2014).
[26] X. Wang, T. Nie, and D. Zhu, “Indoor robot path planning assisted by wireless network,” EURASIP J. Wireless Commun. Netw., vol. 2019, p. 123 (2019).
[27] Y. Wang, S. Wu, X. Gao, F. Wu, and G. Chen, “Minimizing mobile sensor movements to form a line K-coverage,” Peer-to-Peer Netw. Appl., vol. 10, no. 4, pp. 1063–1078 (2017).
[28] X. Wei and A. Joneja, “On computing the shortest path in a multiply-connected domain having curved boundaries,” Comput.-Aided Des., vol. 48, pp. 39–41 (2014).
[29] S. Wolff and C. Bucher, “Distance fields on unstructured grids: Stable interpolation, assumed gradients, collision detection and gap function,” Comput. Methods Appl. Mech. Eng., vol. 259, pp. 77–92 (2013).
[30] H. Xu, B. Wang, J. Song, H. Hong, and X. Zhang, “An algorithm for calculating coverage rate of WSNs based on geometry decomposition approach,” Peer-to-Peer Netw. Appl., vol. 12, pp. 568–576 (2019).
[31] R. Xu, “Path planning of mobile robot based on multi-sensor information fusion,” EURASIP J. Wireless Commun. Netw., vol. 2019, p. 44 (2019).
[32] L. Zhu, H. Ding, and Y. Xiong, “Simultaneous optimization of tool path and shape for five-axis flank milling,” Comput.-Aided Des., vol. 44, no. 12, pp. 1229–1234 (2012).
