Numerical solution of geodesic through two given points on a simple surface
- 42 Downloads
The algorithm for the approximate solution of a geodesic connecting two given points on a simple surface is discussed in this paper. It arises from practical demands of the filament winding technique. Geodesic is the shortest path connecting two given points on a surface and it can also be regarded as the extremal curve of the arc length functional. The nonlinear equation system of the geodesic on some discrete points by means of the direct variation method is explored. By employing Newton’s iterative method, this nonlinear system is transformed into a linear one. And the approximate solution to the geodesic is obtained by solving the resultant linear system. This paper also proves that the iteration is convergent under certain circumstance. Moreover, the result is illustrated with three examples and an appropriate comparison between the analytical solution and the approximate solution to the geodesic is described on the cone surface.
Key wordsGeodesic Filament winding Functional of arc length
Unable to display preview. Download preview PDF.
- Heath, M.T., 2002. Scientific Computing: An Introductory Survey (2nd Ed.). McGraw-Hill Co., p.430–432.Google Scholar
- Hsiung, C.C., 1981. A First Course of Differential Geometry. John Wiley & Son, p.299–300.Google Scholar
- Hu, H.C., Hu, R.M., 1987. Variation. Architecture Publishing Company China, Beijing, p.7 (in Chinese).Google Scholar
- Leek, C., 1998. Filament winding breathes life into gas bottles. Reinforce Plastics, 9:52–53.Google Scholar
- Ghasemi Nejhad, M.N., Chandramouli, M.V., Yousefpour, A., 2001. Processing and Performance of continuous fiber ceramic composites by preceramic polymer pyrolysis: I—filament winding. Journal of Composite Materials, 35(24):2207–2237. [doi:10.1106/X6MK-AJBB-UHUH-KTBB]Google Scholar