Algorithm for approximation transitional developable surfaces between two polygons
Апстракт
The paper describes and explains the computational geometry method that simulates the physical model of transitional pipeline parts whose cross sections have polygonal form and are made of materials that cannot be wrinkled or stretched. This geometrical concept is taken from the classical line geometry and can be directly applied to the creation of computer algorithm that generates the transitional surfaces between two polygons. Mathematical concept of the solution for this problem is based on approximation of the boundary surface triangulation and is presented in MATLAB program. Solutions are given in the form of three-dimensional surface models from which the necessary technical documentation can quickly be made using standard CAD/CAM tools thus shortening the time necessary to prepare the construction and production. In particular, the paper presents the basic computer graphics theory of ruled and developable surfaces, the concept of a geometrical solution for the problem, and the a...lgorithm for generation of transitional surface between two polygons.
Кључне речи:
transitional developable surfaces / computational geometryИзвор:
Technics Technologies Education Management, 2012, 7, 4, 1907-1913Колекције
Институција/група
Mašinski fakultetTY - JOUR AU - Obradović, Ratko AU - Popkonstantinović, Branislav AU - Beljin, Branislav PY - 2012 UR - https://machinery.mas.bg.ac.rs/handle/123456789/1466 AB - The paper describes and explains the computational geometry method that simulates the physical model of transitional pipeline parts whose cross sections have polygonal form and are made of materials that cannot be wrinkled or stretched. This geometrical concept is taken from the classical line geometry and can be directly applied to the creation of computer algorithm that generates the transitional surfaces between two polygons. Mathematical concept of the solution for this problem is based on approximation of the boundary surface triangulation and is presented in MATLAB program. Solutions are given in the form of three-dimensional surface models from which the necessary technical documentation can quickly be made using standard CAD/CAM tools thus shortening the time necessary to prepare the construction and production. In particular, the paper presents the basic computer graphics theory of ruled and developable surfaces, the concept of a geometrical solution for the problem, and the algorithm for generation of transitional surface between two polygons. T2 - Technics Technologies Education Management T1 - Algorithm for approximation transitional developable surfaces between two polygons EP - 1913 IS - 4 SP - 1907 VL - 7 UR - https://hdl.handle.net/21.15107/rcub_machinery_1466 ER -
@article{ author = "Obradović, Ratko and Popkonstantinović, Branislav and Beljin, Branislav", year = "2012", abstract = "The paper describes and explains the computational geometry method that simulates the physical model of transitional pipeline parts whose cross sections have polygonal form and are made of materials that cannot be wrinkled or stretched. This geometrical concept is taken from the classical line geometry and can be directly applied to the creation of computer algorithm that generates the transitional surfaces between two polygons. Mathematical concept of the solution for this problem is based on approximation of the boundary surface triangulation and is presented in MATLAB program. Solutions are given in the form of three-dimensional surface models from which the necessary technical documentation can quickly be made using standard CAD/CAM tools thus shortening the time necessary to prepare the construction and production. In particular, the paper presents the basic computer graphics theory of ruled and developable surfaces, the concept of a geometrical solution for the problem, and the algorithm for generation of transitional surface between two polygons.", journal = "Technics Technologies Education Management", title = "Algorithm for approximation transitional developable surfaces between two polygons", pages = "1913-1907", number = "4", volume = "7", url = "https://hdl.handle.net/21.15107/rcub_machinery_1466" }
Obradović, R., Popkonstantinović, B.,& Beljin, B.. (2012). Algorithm for approximation transitional developable surfaces between two polygons. in Technics Technologies Education Management, 7(4), 1907-1913. https://hdl.handle.net/21.15107/rcub_machinery_1466
Obradović R, Popkonstantinović B, Beljin B. Algorithm for approximation transitional developable surfaces between two polygons. in Technics Technologies Education Management. 2012;7(4):1907-1913. https://hdl.handle.net/21.15107/rcub_machinery_1466 .
Obradović, Ratko, Popkonstantinović, Branislav, Beljin, Branislav, "Algorithm for approximation transitional developable surfaces between two polygons" in Technics Technologies Education Management, 7, no. 4 (2012):1907-1913, https://hdl.handle.net/21.15107/rcub_machinery_1466 .