Computer aided development of surfaces for intersecting cylinders and cones
TL;DR: In this article, an algorithm has been presented to obtain the developed view of intersection joints when the geometries and the position of the axes of the intersecting pieces are known.
About: This article is published in Computers & Structures.The article was published on 2014-09-01. It has received 1 citations till now. The article focuses on the topics: Intersection curve.
Citations
More filters
TL;DR: In this paper, a simple method has been presented to obtain the developed surface of the transition piece when the geometries and the position of the axes of the two cross-sections are known.
References
More filters
Book•
01 Mar 1979
TL;DR: In this paper, the mathematical techniques for the representation, analysis and synthesis of shape information by computers are discussed, and splines and related means for defining composite curves and "patched" surfaces are discussed.
Abstract: Focusing on the mathematical techniques for the representation, analysis and synthesis of 'shape information' by computers. There is a discussion of splines and related means for defining composite curves and 'patched' surfaces, and coverage of both parametric and non-parametric techniques. The book is primarily concerned with the mathematics of the various methods. A good introductory text to surface modeling
1,310 citations
31 citations
7 citations
TL;DR: An algorithm has been developed so as to obtain the development view of a transition section defined in terms of the geometry of its boundary curves defined by means of the optimal encasing rectangle of the polygon.
Abstract: Transition sections are the ducting surfaces used to connect two pipes of dissimilar shapes and sizes. The two pipes to be connected may not be coaxial. In the present paper, an algorithm has been developed so as to obtain the development view of a transition section defined in terms of the geometry of its boundary curves. Also presented in the paper is an algorithm for specifying the coordinates of the vertices of the developed polygon with reference to a coordinate system defined by means of the optimal encasing rectangle of the polygon. Based on the algorithms discussed, two computer programs using a graphics package have been developed. Results of two illustrative examples have been presented and discussed.
6 citations