Polygon-to-Object Boundary Clipping in Object Space for Hidden Surface Removal in Computer-Aided Design-Reference-Cited by-同舟云学术

Polygon-to-Object Boundary Clipping in Object Space for Hidden Surface Removal in Computer-Aided Design

Published:1995-09-01 Issue:3 Volume:117 Page:374-389
ISSN:1050-0472
Container-title:Journal of Mechanical Design
language:en
Short-container-title:

Author:

Chieng Wei-Hua¹,Hoeltzel D. A.²

Affiliation:

1. Department of Mechanical Engineering, National Chiao Tung University, Taiwan 30049

2. Laboratory for Intelligent Design, Department of Mechanical Engineering, Columbia University, New York, NY 10027

Abstract

Since techniques for both polygon-to-polygon clipping and polygon-to-object boundary (contour) clipping have been developed, it appears that the visibility problem may exhibit potential for improvement in its time complexity. This paper provides some insight and results concerning the performance of an object-space hidden surface removal algorithm based on polygon-to-object boundary (contour) clipping. The applicability of these results to the graphic rendering of partially visible objects in an incremental computer-aided geometric design system, such as that used in mechanical design, is demonstrated. The polygon-to-object boundary clipping algorithm is compared with the more conventional polygon-to-polygon approach to clipping for hidden surface removal. Examples are included which demonstrate the potential for improving the performance of software-based hidden surface removal algorithms used in computer-aided geometric design applications.

Publisher

ASME International

Subject

Computer Graphics and Computer-Aided Design,Computer Science Applications,Mechanical Engineering,Mechanics of Materials

Link

http://asmedigitalcollection.asme.org/mechanicaldesign/article-pdf/117/3/374/5672196/374_1.pdf

Reference13 articles.

1. Newman, W. M., and Sproull, R. F., Principles of Interactive Computer Graphics, McGraw-Hill Book Co., New York, 1979.

2. Brassard, G., Bratley, P., Algorithmics: Theory and Practice, Prentice-Hall Publishers, 1988.

3. Forrest, A. R., “Recent Work on Geometric Algorithms,” Mathematical Methods in Computer Graphics and Design, K. W. Brodlie, ed., Academic Press, 1980, pp. 105–121.

4. Weiler K. , and AthertonP., “Hidden Surface Removal Using Polygon Area Sorting,” Computer Graphics (Proc. SIGGRAGH 77), Vol. 11, 1977, pp. 214–222.

5. Weiler K. , “Polygon Comparison Using Graph Representation,” Computer Graphics (Proc. SIGGRAPH 80), Vol. 14, 1980, pp. 10–18.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. P-Buffer: A hidden-line algorithm in image-space;Computers & Graphics;1997-05