 ...ASC9318163.
 Supported in part by
the Natural Sciences and Engineering Research Council of Canada under
a 1967 Science and Engineering Scholarship and by
the National Science Foundation
under Grant ASC9318163.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
 ...pointers.

Both the quadedge and triangle data structures must store not only
pointers to their neighbors, but also the orientations of their
neighbors, to make clear how they are connected. For instance,
each pointer from a triangle to a neighboring triangle has an
associated orientation (a number between zero and two) that indicates
which edge of the neighboring triangle is contacted. An important
space optimization is to store the orientation of each quadedge or triangle
in the bottom two bits of the corresponding pointer. Thus,
each record must be aligned on a fourbyte boundary.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
 ...manner.

I imagine computational geometers replying, ``Of course,''
engineers responding, ``Hmm,'' and solid modeling specialists recoiling
in horror.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.