| Summary: | 碩士 === 國立臺灣大學 === 機械工程學系 === 85 === To increase the efficiency of the current Hidden-Surface
Removal algorithms is very helpful for these
algorithms to simulate 3-D objects in static and dynamic
environments. A new approach is proposed in this paper to
speed up the existing Hidden-Surface Removal algorithms for a
frequently moving niew vecotr or viewpoint.
A pre-processing phase, in which a one-way priority table is
established for all cuboids by which th given objects are
wrapped, and a post-processing phase, in which a rendering
list of cuboids is searched with the remove-
empty-first method from the feudal priority table for a new view
vector or viewpoint, are included in our approach. If any
higher-order cycle exists among the cuboids, the rendering
list of cuboids can not be obtained and a cutting-process
phase must be executed to cut all cycles to this new view
vector or viewpoint.
The new concept of "cuboid" is proposed in this paper to
separate the objects into different groups with cuboids.
The one-way priority relations between two polygons are
not necessary to be computed if these two polygons belong
to different groups. The polygon splittings between any two
polygons are not happened. So the output points and faces of
the objects are much reduced with the important concept of
"separating before splitting" . The efficiency if the Hidden-
Surface Removal algorithms are highly increased if the algorithm
is combined with our new approach.
|
|---|
