Computing Reviews

Classification of edges and its application in determining visibility
Kripac J. Computer-Aided Design17(1):30-36,1985.Type:Article
Date Reviewed: 07/01/86

Computer-Aided Design publishes papers mostly on the practical side. Papers in this journal have more to do with implementation-level graphics than with computational geometry. The paper under review is no exception. I have to confess that this is a clearly written paper and has some nice (but by no means impressive) pictures. But the fact remains that it tells the story of a naive, hidden-line elimination algorithm which is not unlike Loutrel’s now 16-year-old algorithm [1].

The algorithm basically classifies the edges and the faces in a given scene into contoural and noncontoural. It relies on the assumption that it will be used to display large objects with many noncontoural edges.

I couldn’t understand the omission of a standard reference on hidden surface elimination, namely, the celebrated paper by Sutherland et al. [2]. Nor could I explain the lack of references to recent important work done by (among others) Franklin [3], and Sechrest and Greenberg [4]. There are better places to learn about graphics and computational geometry than in Computer-Aided Design.


1)

Loutrel, P. P.A solution to the hidden-line problem for computer-drawn polyhedra, IEEE Trans. Comput. 19 (1970), 205–213.


2)

Sutherland, I. E.; Sproull, R. F.; and Schumaker, R. A.A characterization of ten hidden-surface algorithms, ACM Comput. Surv. 6 (1974), 1–55.


3)

Franklin, W. R.A linear time exact hidden surface algorithm, ACM Comput. Graph. 14 (1980), 117–123.


4)

Sechrest, S.; and Greenberg, D. P.A visible polygon reconstruction algorithm, ACM Trans. Graph. 1 (1982), 25–42.

Reviewer:  V. Akman Review #: CR110473

Reproduction in whole or in part without permission is prohibited.   Copyright 2024 ComputingReviews.com™
Terms of Use
| Privacy Policy