TY - GEN

T1 - A fast wireframe display algorithm for hidden surface removal in constructive solid geometry

AU - Jeng, Shyr Long

AU - Chieng, Wei-Hua

AU - Hoeltzel, D. A.

N1 - Publisher Copyright:
© 1991 American Society of Mechanical Engineers (ASME). All rights reserved.

PY - 1991/9

Y1 - 1991/9

N2 - A fast algorithm for rendering three dimensional geometry as wireframes is developed. The algorithm employs a constructive solid geometry (CSG) model as its underlying geometric representation scheme, set membership classification for the removal of non-boundary lines, and a finite-point backward ray tracing method for hidden line removal. By eliminating conventional polygon surface approximation and its associated surface topology representation, requiring high information overhead, the algorithm demonstrates speed and simplicity. The primary purpose of the algorithm is for expeditious real-time graphical simulation, particularly for interactive design. The algorithm demonstrates overall time complexity of O(n2 h * 2 ), where n denotes the total number of geometric primitives, and h denotes the total number of boundary edge segments. Desirable side effects associated with the use of set membership classification include the ability to generate NC machine instructions and the detection of object interference for collision avoidance during the simulation of manufacturing processes. Examples demonstrating the visualization of 3-D mechanical components are included.

AB - A fast algorithm for rendering three dimensional geometry as wireframes is developed. The algorithm employs a constructive solid geometry (CSG) model as its underlying geometric representation scheme, set membership classification for the removal of non-boundary lines, and a finite-point backward ray tracing method for hidden line removal. By eliminating conventional polygon surface approximation and its associated surface topology representation, requiring high information overhead, the algorithm demonstrates speed and simplicity. The primary purpose of the algorithm is for expeditious real-time graphical simulation, particularly for interactive design. The algorithm demonstrates overall time complexity of O(n2 h * 2 ), where n denotes the total number of geometric primitives, and h denotes the total number of boundary edge segments. Desirable side effects associated with the use of set membership classification include the ability to generate NC machine instructions and the detection of object interference for collision avoidance during the simulation of manufacturing processes. Examples demonstrating the visualization of 3-D mechanical components are included.

UR - http://www.scopus.com/inward/record.url?scp=85104854466&partnerID=8YFLogxK

U2 - 10.1115/DETC1991-0106

DO - 10.1115/DETC1991-0106

M3 - Conference contribution

AN - SCOPUS:0026395742

T3 - Proceedings of the ASME Design Engineering Technical Conference

SP - 69

EP - 80

BT - Finite Elements/Computational Geometry; Computers in Education; Robotics and Controls

PB - American Society of Mechanical Engineers (ASME)

T2 - ASME 1991 Design Technical Conferences, DETC 1991

Y2 - 22 September 1991 through 25 September 1991

ER -