Aming at water conservancy project visualization, a hidden-removal method of dam perspective drawings is realized by building a hidden-removal mathematical model for overlapping points location to set up the hidden re...Aming at water conservancy project visualization, a hidden-removal method of dam perspective drawings is realized by building a hidden-removal mathematical model for overlapping points location to set up the hidden relationship among point and plane, plane and plane in space. On this basis, as an example of panel rockfill dam, a dam hidden-removal perspective drawing is generated in different directions and different visual angles through adapting VC＋＋ and OpenGL visualizing technology. The results show that the data construction of the model is simple which can overcome the disadvantages of considerable and complicated calculation. This method also provides the new means to draw hidden-removal perspective drawings for those landforms and ground objects.展开更多
This paper supplies a generation method of mechanical assembly drawing in CAD. By means of the programs of Auto Lisp, the method which based on AutoCAD may complete profiling the parts, forming parts graphic base, cal...This paper supplies a generation method of mechanical assembly drawing in CAD. By means of the programs of Auto Lisp, the method which based on AutoCAD may complete profiling the parts, forming parts graphic base, calculation of removing hidden line, and establishing assembly drawing.展开更多
Extracting silhouette curves is a key part of hidden curve removal algorithms. It relates directly to the quality of graphics generated by the algorithm, and to the speed and space efficiency of the algorithm. This pa...Extracting silhouette curves is a key part of hidden curve removal algorithms. It relates directly to the quality of graphics generated by the algorithm, and to the speed and space efficiency of the algorithm. This paper proposes an algorithm for extracting silhouette curves that numerically determines the starting and ending silhouette points, then traces each starting point to obtain the whole silhouette curve. Silhouette loops are obtained by tracing silhouette points on isoparametric lines. This algorithm is suitable for extracting silhouette curves at any given tolerance without surface subdivision.The algorithm is fast and requires minimal storage space.展开更多
基金Supported by National Natural Science Foundation of China (50779005)
文摘Aming at water conservancy project visualization, a hidden-removal method of dam perspective drawings is realized by building a hidden-removal mathematical model for overlapping points location to set up the hidden relationship among point and plane, plane and plane in space. On this basis, as an example of panel rockfill dam, a dam hidden-removal perspective drawing is generated in different directions and different visual angles through adapting VC＋＋ and OpenGL visualizing technology. The results show that the data construction of the model is simple which can overcome the disadvantages of considerable and complicated calculation. This method also provides the new means to draw hidden-removal perspective drawings for those landforms and ground objects.
文摘This paper supplies a generation method of mechanical assembly drawing in CAD. By means of the programs of Auto Lisp, the method which based on AutoCAD may complete profiling the parts, forming parts graphic base, calculation of removing hidden line, and establishing assembly drawing.
文摘Extracting silhouette curves is a key part of hidden curve removal algorithms. It relates directly to the quality of graphics generated by the algorithm, and to the speed and space efficiency of the algorithm. This paper proposes an algorithm for extracting silhouette curves that numerically determines the starting and ending silhouette points, then traces each starting point to obtain the whole silhouette curve. Silhouette loops are obtained by tracing silhouette points on isoparametric lines. This algorithm is suitable for extracting silhouette curves at any given tolerance without surface subdivision.The algorithm is fast and requires minimal storage space.
