Titlebook: Computer Graphics 1987; Proceedings of CG In Tosiyasu L. Kunii (Professor and Director) Conference proceedings 1987 Springer-Verlag Tokyo 1

连系

苍白

物质

commute

single

Fast Hidden Surface Removal Through Structural Analysis and Representation of Objects and Their Contces of objects and represent them by isolated polygons, the more advanced algorithms have analysed the surfaces more thoroughly and represented them as connected polygons bounded by contour edges. In this paper, a hidden surface algorithm which applies a further enhanced surface representation is su

独轮车

Fast Algorithms for Computing the Diameter of a Finite Planar Setexpected-complexity analysis shows that, under a reasonable probability model, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit

Scleroderma

Vertebra