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.

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
Atherton
P.
, “
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
.
6.
Hornung
C.
, “
A Method for Solving the Visibility Problem
,”
IEEE CG&A
, Vol.
4
, No.
7
,
1984
, pp.
26
33
.
7.
Hornung, C., “An Approach to a Calculation-Minimized Hidden Line Algorithm,” Comput. & Graphics, Gordon & Breach Science Pub., Vol. 6, No. 3, 1982, pp. 121–126.
8.
Sechrest
S.
, and
Greenberg
D. P.
, “
A Visible Polygon Reconstruction Algorithm
,”
Computer Graphics
(Proc. SIGGRAPH 81), Vol.
15
, No.
3
,
1981
, pp.
17
27
.
9.
Bronsvort
W. F.
, and
Garnaat
H.
, “
Incremental Display of CSG Models using Local Updating
,”
Computer-Aided Design
, Vol.
21
, No.
4
, May
1989
, pp.
221
232
.
10.
Blinn
J. F.
, and
Newell
M. E.
, “
Clipping Using Homogeneous Coordinates
,”
Computer Graphics
(Proc. SIGGRAPH 78), Vol.
12
,
1978
, pp.
245
251
.
11.
Sutherland
I. E.
,
Sproull
R. F.
, and
Schumacker
R. A.
, “
A Characterization of Ten Hidden-Surface Algorithms
,”
Computer Surveys
, Vol.
6
, No.
1
,
1974
, pp.
1
55
.
12.
Mantyla
M.
, “
Topological Analysis of Polygon Meshes
,”
Computer Aided Design
, Vol.
15
, No.
4
,
1983
, pp.
228
234
.
13.
Tanimoto, S. L., The Elements of Artificial Intelligence, Computer Science Press, 1987, pp. 112–115.
This content is only available via PDF.
You do not currently have access to this content.