| |
Browse All Reviews > Computing Methodologies (I) > Computer Graphics (I.3) > Three-Dimensional Graphics And Realism (I.3.7) > Visible Line/Surface Algorithms (I.3.7...)
|
|
 |
|
|
| |
|
|
| |
1-8 of 8
Reviews about "Visible Line/Surface Algorithms (I.3.7...)":
|
Date Reviewed |
| |
Visibility-ordering meshed polyhedra
Williams P. ACM Transactions on Graphics (TOG) 11(2): 103-126, 1992. Type: Article
In this research paper, the author describes an algorithm for visibility-ordering the cells of any acyclic convex set of meshed convex polyhedra. Organized in 12 sections, the paper presents the theory and implementation of the meshed ...
|
Jul 1 1993 |
| |
Octrees for faster isosurface generation
Wilhelms J., Van Gelder A. ACM Transactions on Graphics (TOG) 11(3): 201-227, 1992. Type: Article
A new hierarchical data structure--branch-on-need octrees (BONO)--is presented together with a caching method that essentially passes information between octree neighbors, which prevents useless exploration of regions...
|
Jun 1 1993 |
| |
A framework for functional specification and transformation of hidden surface elimination algorithms
Lakshminarasimhan A., Srivas M. Computer Graphics Forum 8(2): 75-98, 1989. Type: Article
Hidden surface removal (HSR) is a key problem in computer graphics. Only a few attempts have been made to classify HSR algorithms and even less effort has been devoted to formalizing them. The authors show how various HSR algorithms ca...
|
Jul 1 1990 |
| |
Visibility problems for polyhedral terrains
Cole R., Sharir M. Journal of Symbolic Computation 7(1): 11-30, 1989. Type: Article
In this paper the authors consider some visibility problems for polyhedral terrains (polyhedral surfaces that have exactly one intersection with each vertical line); these problems are three-dimensional generalizations of planar visibi...
|
Jan 1 1990 |
| |
Computing the visibility polygon from an edge
Lee D., Lin A. Computer Vision, Graphics, and Image Processing 34(1): 1-19, 1986. Type: Article
Open up a paper on computational geometry and it usually says something along the lines, “Mumble, therefore the required time bound follows. . . .” This has both good and bad sides. On one hand, keeping the paper on...
|
Sep 1 1987 |
| |
A fast line-sweep algorithm for hidden line elimination
Nurmi O. BIT 25(3): 466-472, 1985. Type: Article
Nurmi contributes to the theoretical study of the complexity of hidden line elimination by reducing the previous best result by a factor of log n. He offers an algorithm, based on recent data structure advances, that has a worst...
|
Jul 1 1986 |
| |
Classification of edges and its application in determining visibility
Kripac J. Computer-Aided Design 17(1): 30-36, 1985. Type: Article
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 c...
|
Jul 1 1986 |
| |
Three-dimensional hidden-surface removal for signal-return modelling: experimental results
Duncan R. Image and Vision Computing 3(1): 24-28, 1985. Type: Article
This work describes a method for hidden surface removal and reports results obtained from an implementation of the method. The method was originally designed for the purpose of modeling radar cross-sections. Objects are modeled as a se...
|
Sep 1 1985 |
| |
|
|
| |
|
|
