Appeal No. 2006-1618
Application No. 10/046,797
the specification. For example, the instant specification states that "[i]n Step 804,
post-processing and node editing of the closed boundary may be performed
utilizing additional user interaction. In Step 805, an object description data
structure (e.g. boundary definition, support map, and/or the like) is created to
define the object selected by the user" [see specification, Para. 0068; Fig. 8].
See also brief, page 2 (noting that exemplary data structures are described at
Step 804 of Fig. 8). Such a data structure can reasonably be considered an
organizational scheme applied to data so that it can be interpreted and
operations performed thereon and is therefore consistent with the definition
above.
Turning to the prior art, Kim stores vertex information in buffer 110. After
storing all vertices in buffer 110, the contour approximation process commences.
In this process, buffer 110 provides segment data representing the positions of
the two vertices of a given line segment to sampling circuit 115 [Kim, col. 3, lines
35-45; Fig. 1].
We find that Kim's storage of vertex information in the buffer fully meets a
"data structure" as claimed and fully comports with the definition cited above.
That is, the stored vertex information in Kim reasonably constitutes an
organizational scheme applied to the data so that it can be interpreted and
operations performed thereon, particularly since that same information is
interpreted and utilized subsequently in a contour approximation algorithm.
Furthermore, we find that the buffer's providing segment data representing the
13
Page: Previous 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Next
Last modified: November 3, 2007