最終更新日:2022/12/24
Also, since part of a polygon (facet) of one object might be obscured by that of another intersecting object, I would assume that the standard Z-sort alogrithms would not be enough. Does this mean that I would have to use Z-buffering, or tessellate (sp?) the resultant (possibly nonconvex) polygon into triangles and draw them in Z-order? If not, what is a fast way of doing spacecuts?
編集履歴(0)
元となった例文
Also,
since
part
of
a
polygon
(facet)
of
one
object
might
be
obscured
by
that
of
another
intersecting
object,
I
would
assume
that
the
standard
Z-sort
alogrithms
would
not
be
enough.
Does
this
mean
that
I
would
have
to
use
Z-buffering,
or
tessellate
(sp?)
the
resultant
(possibly
nonconvex)
polygon
into
triangles
and
draw
them
in
Z-order?
If
not,
what
is
a
fast
way
of
doing
spacecuts?