Last Updated：2025/12/31
Sentence
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?
Quizzes for review
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?
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
