Method for dynamically maintaining multiple structural interpretations in graphics system

Abstract: An object oriented graphic input and display system for graphical abstract objects, responsive to user selected manipulation functions, having a data structure (70; Fig. 3A) including input means, display means and function selection means, the input means being user manipulable for entering graphical objects onto the display and for selecting functions on the function selection means for manipulating the graphical objects, a lattice data structure (100) responsive to data signals from the data structure representing objects entered on the display for decomposing the abstract objects into elemental objects, means (108,110) for organizing elemental objects into groups of elemental objects, and means for re-organizing the groups of elemental objects into a further group of elemental objects, the graphical data structure and function selection means coordinating the reorganization in accordance with user selection of functions to be performed on all or on portions of the objects.

Description: This invention pertains generally to computer graphics, and particularly to a system and method enabling users to create and edit graphical images using a mouse, stylus, the hand of the operator or other form of pointing device. Typically, computer graphics operations with a pointing device are of two types; drawing operations and control operations. Drawing operations describe loci for the placement of visible marks on the image, analogous to drawing on a piece of paper by making a motion with a pen in contact with the surface. Control operations are used to initiate and guide the execution of computer functions leading to modification of the visible marks. Control operations are especially important to the performance of editing functions such as erasing, moving, or changing the visual qualities (e.g. line width) of visible marks in the image. Underlying such an interactive computer-assisted graphical editing tool is means for maintaining information about the graphic elements of the image that may be selected and modified under user control. The various extant computer-assisted drawing tools may be classified along a spectrum defined by the granularity of the manipulable graphical elements. On the one hand, so-called paint programs manipulate the visual content of images at the level of individual pixels, each of whose lightness and/or color properties is modifiable independently from the other pixels. While paint style programs permit detailed refinement of an image, their inability to define and geometrically transform whole groups of pixels makes many operations extremely tedious to perform. On the other hand, structured-graphics editing programs operate at the level of larger abstract objects such as lines, circles, and polygons whose rendition on the imaging surface includes many pixels, all of which are modified in unison when objects are moved, deleted, or otherwise modified. The rationale for structured-graphics editing programs lies in an assumption that the sorts of image modifications that users will usually want to perform will be ones that preserve the geometric structures reflected in the abstract level objects. The article "An object-oriented knowledge representation for spatial information" by Mohan et al., IEEE Transactions on Software Engineering, 14(5), 1998, pages 675-681, discloses an object-oriented model for presenting abstract level objects and their spatial interrelationship in a lattice type of structure. The present invention offers a new point in the spectrum of computer assisted drawing tools, one that incorporates advantages from both the paint and structured-graphics extremes of graphical image editors. The object of the invention is to enable the more flexible manipulation of graphical elements at an abstract level. This object is solved by the system according to claim 1 and the method of claim 4. Preferred embodiments are the subject matter of the dependent claims. More specifically, the foregoing object is achieved in accordance with the invention by virtue of a graphical editing tool for maintaining a rich and overlapping set of abstract objects which the user may access individually or in groups, and moreover, to dynamically update and reconfigure this set of abstract objects as the user makes modifications to a drawing. These background functions are performed by the editing tool automatically and without the users knowledge or attention; covertly, they maintain a constant, fresh, resource of abstract objects which the user may access quickly and conveniently to manipulate the visible marks in the image in perceptually natural "chunks." In contrast to that of structured-graphics style editors, the rationale behind the present invention is that the larger, abstract image structures that users will most often want to manipulate will be those that result from human perceptual processes that tend to organize local, pixel level, light and dark patterns into small, intermediate, and large scale perceptual chunks resembling lines, curves, regions, and other "Gestalt" entities. It will be understood that graphical objects as employed herein is intended to refer to alpha numeric text as well as the forgoing entities. The manipulable objects maintained by this invention reflect the flexible and sometimes ambiguous nature of human perceptual processes by permitting multiple and overlapping abstract object level interpretations of the visible image elements. These natural units of image organization and manipulation are emergent from the spatial relationships among sets of marks present in the image and cannot be derived solely from the properties attributed to graphical objects at the time of their creation. Consequently, the core technologies contributing to this invention derive not only from the tradition of computer graphics, but crucially from computer vision and image analysis. The invention further provides a method of manupulating all or a portion of a graphical abstract object entered on a display device, according to claim 4 of the appended claims. The invention further provides a method of editing graphical data accordinging to claim 6 of the appended claims. Embodiments of the present invention will now be described, by way of example, with reference to the accompanying drawings, in which: Figs. 1a-d illustrates an object analysis of a displayed image; Figs. 2a and 2b show an electronic display of manipulated images; Fig. 3a is a routine diagram illustrating the system operation of the invention; Fig. 3b is an organizational diagram of the principal sequence of operation for grouping objects. Fig. 4 is a flow chart showing the sequence of operations for object manipulation; Fig. 5 is a flow chart illustrating object transformation and updating; Fig. 6a-d diagrammatically showing the relationship between image objects and sub objects; Figs. 7a-e illustrates stroke analysis; Figs. 8a-f show sub object selection. Fig. 9 shows the routine for the Object Lattice operation; Fig. 10 shows the routine for the Graphical Data Structure operation; Fig. 10 shows the routine for the Graphical Data Structure operation; Fig. 11 shows the routine for the Utility Bitmap operation; Fig. 12 shows the routine for Spatial Analysis operation; Fig. 13 shows the routine for the Grouping Operations; Fig. 14 shows the routine for the Add Object to Image operation; Fig. 15 shows the routine for the Remove Object from Image operation; and Fig. 16a-c show a multiple role for share boundary objects. Figs. 1a-d each illustrate the functionality made possible by this invention. A prototypical drawing creation and editing session with a graphical editing application tool embodying this invention preferably proceeds as follows: Referring to Fig. 1a, using a pointing device in DRAW mode, the user draws an "L"-shaped curve 10 which appears on an imaging surface 12. Running in the background, the computer program creates an abstract object 14 corresponding to the "L"-shaped curve. It also detects the presence of a salient sharp corner 16 in this curve; consequently, it creates abstract objects 18 and 20 corresponding to the vertical and horizontal segments of this curve. At any time the user may press a button on the pointing device or type keystrokes to toggle into a COMMAND mode. A gesture made on the imaging surface in COMMAND mode serves to identify one or more of the abstract objects that the program has created. EP-A 637795, filed on the same day as the present application by the same applicant, describes object selection using simple and natural gestures of a pointing device. The user may now issue further instructions using the pointing device and/or the keyboard in order to delete, move, copy-move, rotate, change thickness, scale in size, or otherwise modify the object(s) selected. Referring to Fig. 1b, using the pointing device in DRAW mode, the user elects to draw an inverted "L" 24. The program detects the corner in this stroke, as well as additional significant spatial structures emergent from the proximity of this stroke and the previous one. These structures include the corner formed at the bottom right of the figure, and the crossing junction at the upper left. The program creates abstract objects corresponding to (i) each of individual short relatively straight segments 26; (ii) curve segments bounded by crossing or Tjunctions 28; (iii) curve segments bounded by corners 30; (iv) curve segments that continue through junctions and corners 32; (v) curve segments created by tracing certain salient convex paths 34. As shown in Fig. 1c, using the pointing device in COMMAND mode, the user selects the short line segment 40 corresponding to the top of the rectangle 42, and executes a "move" operation to translate the segment to a position midway down the sides of the rectangle. The program notices that certain abstract level graphical objects, dependent upon the previous position of this segment in relation to other segments, are now rendered obsolete by the move operation, and these objects are removed from the set of selectable objects. The program also notices new salient spatial events, in particular the new T-junctions created by the new placement of the segment. Appropriate new abstract level objects are created, including new short segments 44,46, 48, 50 and a new convex path object reflecting the identifiable rectangle 52. As shown in Fig. 1d, using the pointing device in COMMAND mode, the user selects the rectangle 60 and moves it away. The program notices the several abstract level objects that are made obsolete by this change in the image, leaving objects 62 and 64, and it removes them from the set of objects available for manipulation by the user. No new abstract objects are created by this particular user action. This brief user-interactive session illustrates that the present invention permits users to select and manipulate objects according to a multiplicity of ways in which they may interpret, perceptually, the elemental pixel values present on the imaging device. Further, it illustrates the importance of dynamically updating the set of manipulable objects as emergent spatial properties are created and obliterated. To duplicate the same sequence of visible changes to the image as performed in the above session using a paint style or a structured graphics style image editing tool would require a much greater number of significantly more difficult and more cumbersome user actions. Figs. 2a and 2b presents two scenarios under which this invention adds power to a freehand line drawing editor or any geometric editor. In Fig. 2a, an electrical engineer at a graphic input station accurately constructs the result when an analog input signal is gated by a clock signal. In Fig. 2b, the missing row in a table is filled by moving aside-but not erasing and rewriting-the portions of the table already completed. More specifically, in Fig. 2a, an electrical engineer at an electronic data entry and display device 70 such as a digitizing display sketchpad or "whiteboard" has drawn an analog input signal 72 and a clock signal 74, and wishes to see what the analog signal looks like 76 when it is gated by the clock signal. He accomplishes this by executing the following steps: (1) Perform a "copymove" 78 of the drawing of the analog signal to the result location. (2) Perform a "copy-move" 80 of the clock signal to the result location, overlapping the analog signal. (3) Select and delete extraneous segments, leaving behind the result 82 shown. In Fig. 2b, another example of the object selection system is shown, wherein at a group brainstorming session, a meeting facilitator constructs a table of entries at an electronic data entry device 84. The group decides that another row belongs at area 86 in the middle of the table 90. Instead of having to erase and redraw part of the table in order to make room for the new row, the facilitator can select and move the appropriate portion 92 of the table 90 down, and draw in only the new entries 94. The graphical input and display component 70 is an electronic input device such as an electronic sketchpad, or "live board" or "white board" which employs a working surface and a plurality of accessible functions, such as is generally illustrated in Figs. 2a and 2b. The working surface area 110 is the upper area of the component 70 and the function access positioned along the bottom area 112. Typical functions are delete, move, shrink, enlarge, and so on. These functions are optional in designation, their principal objects being to define operations which are inherent in the operation of the invention. A suitable user manipulable control such as a stylus or light pen or the like 114 is employed to both draw input symbols and select functions. Obviously, other variants within the skill of the art may be employed. For example, proximity sensors can be used near the display board, and can sense hand or other types of pointer movements to enter. Also, data input may be by means of a scanning device for inputting graphical data from hard copy. An example of "live board" construction is found in EP-A-566293 and EP-A-566294. In these devices, the entire upper surface area 110 is an interactive display, that is, the image is generated from within in response to inputted data such as from the user manipulated control. Re-imaging results from user manipulation of defined objects and is displayed on the same surface, as indicated by the examples shown in Figs. 2a and 2b. Referring to Fig. 3a, a system for implementing the invention is shown wherein a graphical input and display component 70, including input, function select and display areas as described in conjunction with Fig. 2a, is coupled to a microprocessor CPU 96. The CPU 96 receives and processes signals from the component 70 in accordance with instructions received from the program memory 98. Data is organized in accordance with program operations and stored in data memory 100. The present invention provides a novel and unique method and apparatus for configuration of data structures and operations permitting an open-ended set of functionally specified perceptual grouping rules to be applied dynamically by the CPU 96 as a graphical image data is input and edited. Referring to Fig. 3b, constituent operational components required to be applied to input and edit data are: (1) a hierarchical lattice data structure 100 plus associated operations for accessing primary and secondary objects or sets of objects; (2) a spatially and scale indexed blackboard data structure 102 plus associated operations for accessing tokens; (3) a bitmap data structure 104 plus associated operations for accessing the values of pixels therein; (4) a spatial image analyzer 106; and (5) a collecting device 108 for grouping objects into sets of object. The input display component 70 provides data to the CPU 96 which in turn operates to coordinate and implement the grouping rules to be applied in the data structures 100, 102, 104, 106 and 108, as well as in any additional data structures 110. These components are organized under a class of control architectures which apply basic operations at appropriate times to maintain a correct, consistent and perceptually significant set of abstract objects for the user's access. Section 1 below discusses the issue of control architecture; Sections 2.1 through 2.5 describe the enabling component data structures and their functions; finally Sections 2.6 and 2.7 detail how the components are employed to support the crucial control-level basic operations. For the purposes of the present invention, the invention is described in the context of a freehand line drawing editor. However, the principles and techniques of this invention apply equally well to in other graphic environments, such as a structured graphics style image editors in which the user initiates the drawing of an object by selecting from a predetermined class of structured object types (e.g. circles, rectangles, polygons), to paint style image editors in which the user manipulates spatially extended (in two dimensions) regions of an image an opposed to objects consisting of one-dimensional plane curves, and to text editors where text is entered with a keyboard and selected and arranged with appropriate gestures. 1. Control Architecture and Basic Operations A line drawing editor application may incorporate the present invention by making use of the following basic operations illustrated in Fig. 4 wherein is shown a prototypical control structure for a computer-assisted graphical editing tool incorporating the invention. User actions are shown as encircled by rounded bases, and computer implemented functions are shown in rectangular basis. The basic sequence of operational functions are: 1. Draw Stroke or Curve, 120 2. Detect Corners on a Stroke or Curve, 122 3. Select Object(s), 124 4. Add Object(s) to Image, 126 5. Remove Object(s) from Image, 130 6. Specify Desired Transformation, 132 7. Transform Object(s), 128 8. Add transformed object to Image, 134 9. Store and/or Display, 136 These operations may be applied under any of a class of control architectures governing the dynamics of the user/machine interaction/interpretation cycle. In this structure, the user participates in a cycle in which either new curves are repeatedly drawn into the image, or else existing curves are selected and modified and then added to the image. The rectangular boxes in this diagram identify basic operations necessary to maintain correct and consistent information as to the appearance and organization of the marks in the image, as well as the abstract level constructs available for the user to manipulate graphic objects in terms of perceptually natural units. Under the above control structure, user DRAW mode or COMMAND mode instructions alternate with system drawing modification and structure interpretation operations. More complex control structures are also supported by this invention, such as the one shown in Fig. 5, which shows an advanced control structure for a computer-assisted graphical editing tool incorporating this invention. The structure shown in Fig. 5 has rounded boxes as user defined operations and rectangular boxes as computer-implemented functions. This control structure permits the tractable application of very large structure interpretation rule sets by two means. First, only a reduced set of "core" structure interpretation rules are automatically applied after each user gesture or instruction, and the remaining, more advanced rules, intended to identify more complex structure, operate in the background on a "cyclesavailable" basis. Abstract objects explicitly representing this structure are added to the hierarchal lattice data structure 100 (Fig. 3b) and graphical data structures as it is discovered. Second, the advanced rules are applied in a spatially focused manner so that complex structure will be sought at image regions most likely to be of interest to the user. The loci of user interest are determined on a heuristic basis, that is, locations where the user has most recently performed draw or move commands, regions where the user has recently directed a pointing device, or regions where a set of proximity sensors near the physical imaging surface has determined that the user has gestured toward with his hand. Referring to Fig 5, data entered in display component 138 is presented as an inputted object to function block 146. Upon completion of drawing of an object, sensed by a period of inactive indecision block 140, the region of interest is inferred, routine 141, by the computer based on the area thus defined heuristically by the user. This is effected through a basic routine which simply stores the location of inputted data on a time line basis, with the last data in being the first data out. The computer then applies complex structure interpretation rules, routine 142, to the objects retrieved in the inferred spatially focussed area. The resulting defined objects are stored for display, routine 144. The user then interacts with the defined objects by drawing objects, routine 146, or removing objects, beginning with object selection, routine 148. The drawn objects are then broken down or decomposed into Prime Objects, hereinafter defined, routine 150. These decomposed or Prime Objects are then employed to update the Prime Object structure, as well as the Components Object structure, routine 152. Basic structural interpretation rules are then applied to the updated Prime Object structure, routine 154, to update the Composite Object structure 144. When removing objects, the user first selects an object in the image, routine 148. The computer then acts to remove the object, routine 156. The desired transformation, such as movement, deletion, shape change or the like is then selected, routine 158. The computer then carries out the desired transformation, routine 160, and accordingly updates the Prime-Object structure, routine 152, and applies the basic structure interpretation rules, 154. The operations Remove Object(s) from Image routine 130, routine 156 and Add Object(s) to Image routine 126 are described below in further detail. The Draw Object routine 146 implemented by tracking the position of the pointing device. Many methods for performing the operation Detect Corners, routine 122, can be found in the computer vision literature. The operation, Select Object(s) routine 160 is described in more detail in EP-A-637795, filed on the same day as the present application by the same applicant. Finally, the Transform Object(s) routine 160 is implemented by a simple affine or other transformation to a curve. 2. Data Structures and Basic Operations 2.1 Object Lattice Referring to Fig. 3b and in conjunction with the chart of Fig. 6a-d, the Object Lattice data structure 100 maintains the relationship between elemental objects at the level of pixels in the image, and image objects that may be selected and operated on by the user. Two types of objects are defined: PRIME-OBJECTS and COMPOSITE OBJECTS. A PRIME-OBJECT (PO) is the smallest graphical element out of which larger graphical structures may be composed. In a freehand drawing editor, POs are associated with simple unbroken and non-crossing curve segments that describe the appearance of chains of "black" or "on" pixels in the image. A PO is not immutable however (such as a pixel is); a PO may in general be destroyed by being broken into a set of smaller POs that cover the same image space, or by merging with other POs. A COMPOSITE OBJECT (CO) is associated with a set of PRIME-OBJECTs and thereby refers to individual or combinations of elementary graphical entities (e.g. curves in a freehand drawing editor). Under this interpretation, PRIME-OBJECTs are directly associated with the rendered appearance of pixels in the image; COMPOSITEOBJECTs refer to the physical appearance of the image only through the POs upon which they are constructed. The set of COs associated with an image constitutes the set of abstract objects by which the user gains access to perceptually coherent collections of image marks. Both types of object are attributed with the properties of spatial location, rough orientation, size, plus miscellaneous other properties. The relationships among POs and COs are maintained by pointers; each CO maintains a list of supporting POs to which it refers, each PO maintains a list of COs which it supports. Figure 6a-d depicts the Object Lattice for a simple image Fig. 6a shows a displayed image or object. Fig. 6b shows a break down of the Fig. 6a object into PRIME OBJECTS. Fig. 6c shows how the PRIME OBJECTS is further defined as a series of Composite Objects. Fig. 6d shows the relationship between PRIME OBJECTS and COMPOSITE OBJECTS. Note that the mapping between POS and COs is in general many-to-many. This property achieves the flexibility of multiple perceptual interpretations of a given pattern of "on" image pixels. In addition, each PRIME-OBJECT maintains bi-directional pointers STROKE-END (SE) with a pair of objects, which describe explicitly the locations and orientations of each end of the curve described by the PO. The sequence of operations shown in Fig. 9 defining the routines employed in the Object Lattice is as follows: 1. Store Image data, 202 2. Store Pixel identification from the image data, 204 3. Identify POs, 206 4. Identify COs, 208 5. Create a list of POs 210 6. Create a list of COs 212 7. Create a list of POs corresponding to COs, 214 8. Create a list of COs corresponding to POs, 216 and 9. Create a series of pairs of SEs corresponding to POs, 218. 2.2 Indexed Graphical Data Structure PRIME-OBJECTs, COMPOSITE-OBJECTs, and STROKE-ENDs are graphic entities which have characteristic locations, orientations, and sizes in the image. For example, the location of a PO is conveniently defined as the centroid of the plane curve it is associated with. Many important operations of this invention rely on fast access to subsets of objects that lie in a given neighborhood of the image, and/or have a size within a given range. For this reason with reference to Fig. 10, a spatial/scale indexed graphical data structure 102 organizes objects, or tokens, according to their locations and sizes routine 220. The data structure 102 resembles a stack of twodimensional arrays holding successively larger size objects. Each elemental one of these arrays maintains a list of objects lying within a restricted spatial neighborhood whose size depends upon the size-range, or scale, of that slice of the data structure 102. Objects are indexed according to spatial location and size by accessing the appropriate array bin(s). A typical operation taking advantage of the data structure 102 is, "Return all tokens within distance d of either end of PO-N." The data structure 102, termed a Scale-Space Blackboard is described in the open literature, for example,in "Symbolic Construction of 2D Scalespace Images", Eric Saund, IEEE Transactions on PAMI, vol 12, no.8, 1990, pp 817-830. The steps to put objects in the scale-space blackboard shown in Fig. 10, are as follows. 1. Organize objects by size, 220 2. Create lists of objects by size, 222 3. Organize objects by location, 224 4. Create lists of objects by location, 226 5. Define spatial neighborhood for groups of objects, 228 6. Assign a token to each object, 230 and 7. Array respective tokens in data structure array by groups, 232 2.3 Utility Bitmap Among the criteria identified in this invention for partitioning a freehand line drawing into manipulable units is that significant perceptual events occur at intersections of curves. Consequently, it is necessary to identify crossings and junctions of curve segments, as described by POs, quickly and efficiently. To facilitate this function, a Utility Bitmap data structure 104 contains the midline path of all curves present in the image. When a new curve is introduced, either by the user making a stroke in DRAW mode, or else by the user moving an existing stroke in COMMAND mode, the path of the newly placed curve is traced in the Utility Bitmap, and any intersection with an existing curve is detected by the presence of an already-on pixel. The identity of the PO associated with the already-present curve is readily established by collecting from the Scale-Space Blackboard 102 all POs in the neighborhood of the intersection pixel, and testing each in turn. The sequence of operations, i.e. the rules, defining the routines employed in the Utility Bitmap is as follows. 1. Data input, 250 2. Trace path, 252 3. Select intersection with existing curve, 254 4. Collect all POs in neighborhood of the intersection pixel, 256 and 5. Identify PO associated with existing curve, 258 2.4 Spatial Analysis Operations Because the objective of this invention is to provide users with explicit access to "chunks" of the image reflecting their low-level internal visual percepts, a spatial image analysis component 106 is necessary for assessing and interpreting spatial relationships among the graphic objects maintained in the abovementioned data structures. For example, when two PRIME-OBJECTs are brought into such proximity that two of their associated STROKE-ENDs are very near to one another and are oriented at approximately a 90? angle with respect to one another, then the visual appearance is created that these curves meet at a corner. See Fig. 7b. This geometrical property must be detected and recorded by the program so that appropriate abstract graphic objects (COs) can be made available to the user encompassing both of the POs that participate in forming this corner. This invention makes use of the following spatial analysis operations as illustrated in figure 7a-e: detect corner on a single curve drawn by the user. Fig. 7a detect corner configuration between two POs. Fig. 7b detect isolated join configuration between two POS. Fig. 7c detect alignment of POs across a T-junction. Fig. 7d detect alignment of POs across a crossing junction. Fig. 7e Program routines for performing these functions are straight forward and will be apparent to those skilled in the art. The terminology, to "resolve" a junction, refers to the application of these spatial analysis operations to a set of POs whose mutual spatial relationships are suspected to have been changed by a user action. The sequence of operations defining the routines employed in the Spatial Analysis is as follows. 1. Detect corners on a single curve, 270 2. Detect corners between 2 POs, 272 3. Detect isolated join configurations between 2 POs, 274 4. Detect alignment of POs across a T junction, 276 and 5. Detect alignment of POs across an X junctions, 278 2.5 Grouping Operations The user accesses and modifies graphic objects at the level of COMPOSITE-OBJECTs, each of which maintains pointers to its constituent Prime-OBJECTs in routine 108. When an image is modified by drawing, erasing, or moving lines, the description of the locations of "on" pixels changes at the level of POs. These changes must propagate upward to the CO level so that the useraccessible objects always reflect valid and perceptually salient collections of curve segments. The responsibility for maintaining an accurate and consistent relationship among POs and the COs they support falls to a set of token grouping operations. These operations implement rules for what COs should be constructed in the Object Lattice 100 for given collections of POs. Under the design architecture of this invention, the rule set is extensible, and specialized rules may be accumulated so as to make available particular sorts of structure characteristic of particular drawing application domains. Specifically, the following basic rules are appropriate to freehand and structured curve editing applications. See Fig. 8a-f. The basic object, Fig. 8a, is decomposed as follows: 1. One CO is uniquely associated with every PO. Fig. 8b 2. A CO is asserted for every path joining POs through corners but stopping at isolated ends and junctions Fig. 8c 3. A CO is asserted for every path joining POs that align across junctions, but stopping at corners. Fig. 8d 4. A CO is asserted for every path joining POs that align across junctions or are joined at corners. Fig. 8e 5. One CO is asserted for every set of POs joining along a convex path. Fig. 8f. These rules are implemented primarily by tracing paths through sets of POs, where the corner and alignment links between POs are maintained in their associated STROKE-END tokens. Care is taken in the implementation of these rules that paths or sets of POs satisfying more than one rule become associated with one and only one CO. The sequence of operations shown in Fig. 13 and defining the routines employed in the Grouping Operations is as follows. 1. Define manipulation, 302 2. Change POs to encompass new pixels, 304 3. Change COs to correspond to new POs, 306 and 4. Store results in object lattice, 308 2.6. Basic Control-Level Operation: Add Object(s) to Image The routine for adding one or more curve segments to an image are outlined in Fig. 14. Each curve segment is assumed to be described as a PRIME-OBJECT, including associated STROKE-END tokens. 1. Detect locations where the added POs form new crossing junctions with pre-existing POs, routine 310. This is done using the Utility Bitmap data structure 104 as described in Section 2.3. Crossing locations associated with each PO are recorded as breakpoints for that PO. 2. Detect locations where added POs form T-junctions with pre-existing POs, routine 312. It is desired that T-junctions be detected with some distance tolerance, that is, where the curve segments do not actually touch. Conversely, T-junctions formed with pre-existing POs forming the "horizontal bar" of the T are detected using the Utility Bitmap (into which has been already colored the paths of the pre-existing POs) and tracing a path beyond each end of each added PO for some tolerance distance. Tjunctions formed with added POS forming the horizontal bar of the T are detected using a scratch Utility Bitmap into which are colored all added POs. Then, pre-existing POs that are near to any of the added POs are found using the Scale-Space Blackboard 102. Each of these is traced onto the scratch Utility Bitmap beyond its endpoints, looking for pixels already colored by one of the added POs. If any such T-crossing is detected, the identity of the added PO forming the horizontal bar of the T is found by writing all added POs into a scratch Scale-Space Blackboard, collecting added POs in the neighborhood of the crossing, and testing these in turn to see which PO's chain code curve passes through that point. Breakpoints are asserted for Tjunctions as they are for crossing junctions found in Step 1. 3. Each pre-existing and added POs that has at least one breakpoint formed by a crossing or T-junction now becomes obsolete, routine 314; each is subdivided into a new set of POs, routine 316 according to the breakpoints. The bi-directional pointers of the Object Lattice data structure 100 are updated, routine 318 so that COs previously supported by the now-obsolete PO now become supported by the set of new POs into which the obsolete PO was subdivided. However, the CO uniquely associated with each obsolete PO becomes itself obsolete, and is removed, routine 320 from the Object Lattice 100. All SEs associated with obsolete POs are removed routine 322 from the Scale-Space Blackboard 102, and all newly created SEs written onto it routine 324. Every SE associated with POs created or otherwise affected by this procedure are marked as "affected SEs" routine 326. 4. The set of affected SEs is passed to 104 the "resolve junctions" procedure, routine 326, and the spatial relationships among affected SEs and their associated POs is analyzed as discussed in Section 2.4. Each SE is labeled according to which, if any, SEs in its vicinity form an isolated join, alignment junction or a corner junction with it. All newly established SEs, plus the set of SEs whose spatial relationship status is found by the resolve procedure to have been affected by the image modification are marked as "changed SEs." 5. All pairs of changed SEs forming an isolated join type junction are detected and their respective POs are merged together, routine 328. These now-obsolete POs are removed from the Object Lattice data structure, routine 330, as are the COs that previously were uniquely associated with them, routine 332. These are replaced by single new POs routine 334 plus uniquely associated single new COs, routine 336. 6. The POs associated with changed SEs are extracted, routine 338 and these are stored and used as seeds, routine 340, for updating the paths through spatially related POs giving rise to user-accessible COs according to the rules described in Section 2.5. The sequence of operations of Fig 14 defining the routines employed in the Add Object to Image is as follows. 1. Detect intersection locations of new POs with Old POs, 310 2. Detect T functions of J added POs with existing POs, 312 3. Delete pre-existing and added POs formed by crossing or T, 314 4. Create new PO set, 316 5. Update bi-directional pointers, 318 6. Remove COs associated with obsolete POs, 320 7. Remove SEs associated with obsolete POs, 322 8. Write new SEs into data structures and mark, 324 9. Resolve marked SEs as changed SEs, 326 10. Detect changed SEs and merge with associated POs, 328 11. Delete obsolete POs, 330 12. Delete obsolete COs, 332 13. Replace obsolete POs with new POs, 334 14. Replace obsolete COs with new POs, 336 15. Extract POs associated with changed SEs, 338 16. Store extracted POs, 340 2.7 Basic Control-Level Operation: Remove Object(s) from Image The routine for removing one or more curve segments from an image is outlined in Fig. 15. Each curve segment is assumed to be described as a PRIME-OBJECT, including associated STROKE-END tokens. The human user interacts with the image at the level of COMPOSITE-OBJECTS, but the POs associated with the COs to be removed are readily deducible using the parent/child relationships in the Object Lattice data structure. 1. Delete every to-be-removed PO from the Scale-Space data structure and from the Object Lattice data structure, routine 352. 2. Delete every CO whose support includes any of the to-beremoved POs from the Object Lattice, routine 354. 3. Delete the SEs routine 356 associated with every to-be removed PO from the Scale-Space data structure. Note whether any of these to-be-removed SEs forms an alignment or corner junction with any SE that is not to be removed, or, whether any not-to-be-removed SE falls within a threshold distance from any to-be-removed SE. These are marked as "affected SEs", routine 358. 4. Perform routine 360, the "resolve junctions" operation on all affected SEs. Note which affected SE is assigned a different alignment or corner spatial relationship with other SEs as a result of the removal of the to-be-removed POs. These are marked as "changed SES", routine 362. 5. All pairs of changed SEs forming an isolated join type junction are detected and their respective POs are merged together, routine 364. The now-obsolete POs are removed from the Object Lattice data structure, routine 366 as are the COs that previously were uniquely associated with them, routine 368. These are replaced, routine 368 by single new POs plus uniquely associated single new COs. 6. The POs associated with changed SEs are extracted, routine 370, and these are used as seeds for updating the paths through spatially related POs giving rise to useraccessible COs according to the rules described in Section 2.5. The sequence of operations in Fig. 19 defining the routines employed in the Remove Object From Image is as follows. 1. Delete obsolete POs from data structure, 352 2. Delete obsolete POs from object lattice, 354 3. Delete SEs associated with obsolete POs from data structure, 356 4. Mark junction SEs as affected, 358 5. Perform resolve junctions on affected SEs, 360 6. Mark affected SEs which are changed by removed POs as changed SEs, 362 7. Detect pairs of changed SEs and merge with POs, 364 8. Remove and replace obsolete POs, 366 9. Remove and replace obsolete COs, 368 10. Extract POs associated with changed SEs, 370. In accordance with the invention, some objects play multiple roles (i.e. when they have multiple parents in the lattice). After some operations, such as a move, the objects can be duplicated in order to preserve these multiple roles. A multiple role example is shown in Fig. 16a-c. Here, an object 380 such as a rectangle is shown with a dividing center line 382 which is intended to form a shared boundary between positions A and B of the rectangle. The intent may be user defined or context defined. In a move operation, Fig. 16b, portion A is detached from portion B. The line 382 is maintained on the fixed portion B, while the portion A is shown in dotted boundary 384 during the move. After completion of the move, the boundary 384, which is a duplicate of 382, is made a permanent part of the object. The grouping rules defining the multiple role concept provides the data base for the new boundary, as described above with other operations. Some elements are needed only for purposes of efficiency. Thus, the blackboard and bitmap data structures described with reference to Fig. 3b are not essential to the broad aspects of the invention. An image analyzer can use any data structure that allows spatial relations to be computed.

Claims: An object orientated graphic input and display system for manipulating all or a portion of a graphical object and responsive to user selected manipulation functions, said system comprising: input means, display means and function selection means (70); said input means being user manipulable for a entering graphical object onto said display and for selecting a function on said function selection means for manipulating said graphical object; means for decomposing said graphical object into elemental objects; means (106) for organizing elemental objects into a plurality of groups of possibly overlapping objects according to their spatial relationship; a lattice data structure (100) for storing said elemental objects, groups of objects and their dependence on each other and said elemental objects; means (108) for selecting a group of objects; means for executing said selected function on said selected group of objects to generate a new graphical object; means for decomposing said new graphical object into new elemental objects and new groups of objects; wherein said lattice data structure is stored automatically; said means for decomposing an image operate automatically; and said means for organizing elemental objects into a plurality of objects operate automatically; said means for decomposing said new image operate automatically; and by means for automatically deleting obsolete elemental objects and obsolete groups of objects. The system according to claim 1, said system further comprising: a second data structure (104) for storing the pixel position value of the midline of said graphical objects; a spatial image analyzer (106) for automatically operating on values stored in said second data structure to determine geometric properties, such as intersections and corners, of said graphical objects, said geometric properties being used by said means for decomposing. The system of claim 1 or 2 wherein said lattice data structure comprises a spatial and scale indexed graphical data structure. A method for use in a computer system comprising input means, display means and function selection means, for manipulating all or a portion of a graphical object, said method comprising the steps of: entering (134) a graphical object onto said display means; decomposing (150) said graphical object into elemental objects; organizing said elemental objects into a plurality of groups of possibly overlapping objects according to their spatial relationships; storing (136, 138) said elemental objects, groups of objects and their dependence on each other and said elemental objects in a lattice data structure; selecting (158) a function from said function selection means for manipulating a group of objects; manipulating (160) said group of objects with said selected function to generate a new graphical object and displaying said new graphical object; wherein said step of decomposing said graphical objects is executed automatically, said new image being automatically decomposed into new elemental objects; said new elemental objects being automatically organized into new multiple and possibly overlapping groups of elemental objects according to their spatial relationship; new elemental objects, new groups of objects and their dependence on each other are automatically stored (144, 152) in a lattice data structure; and in that obsolete elemental objects and obsolete groups of objects are deleted (330, 332) automatically from said lattice data structure. The method of claim 4 wherein an image includes a first and a second object having a shared boundary (382), said method comprising the further steps of: assigning a multiple role to said shared boundary, and redefining said first and second objects into separate objects, one of said objects having a boundary duplicating said shared boundary. The method of claim 4 wherein Prime Objects are elemental objects consisting of lines or line fragments, said Prime Objects are grouped into Composite Objects, said method comprising the further steps of: deriving two Stroke Ends for each Prime Object (218), each of said Stroke Ends describing the location and orientation of one end of a Prime Object; creating (214) a list of Prime Objects corresponding to Composite Objects; creating (216) a list of Composite Objects corresponding to Prime Objects; and identifying objects in accordance with items selected from each of said lists. The method of claim 6, comprising the further step of creating a list of series of pairs of Stroke Ends corresponding to Prime Objects. The method of claim 7, comprising the further steps of: organizing (220) objects by size and creating (222) lists of objects by size; organizing (224) objects by location and creating (226) lists of objects by location; defining (228) spatial neighborhoods for groups of objects; assigning (230) a token to each object; and arraying (232) respective tokens in a data structure array by groups within a predetermined range of scaled space. The method of claim 8, comprising the further steps of: determining new Prime Objects, detecting (310) intersection locations of new Prime Objects with Old Prime Objects, detecting (312) T junctions of added Prime Objects with existing Prime Objects, creating (316) a new set of Prime Object, updating (318) Stroke Ends associated with each Composite Object, removing (320) Composite Objects associated with obsolete Prime Objects, removing (322) Stroke Ends associated with obsolete Prime Objects, writing (324) new Stroke Ends into data structures and mark, resolving (326) marked Stroke Ends as changed Stroke Ends, detecting (328) changed Stroke Ends and merging same with associated Prime Objects, replacing (334) obsolete Prime Objects with new Prime Objects, replacing (336) obsolete Composite Objects with new Composite Objects, extracting (338) Prime Objects associated with changed Stroke Ends, and storing (340) extracted Prime Objects. The method of claim 8, comprising the further steps of: deleting (356) Stroke Ends associated with obsolete Prime Objects from said lattice data structure, marking (358) junction Stroke Ends as affected, performing (360) resolve junctions on affected Stroke Ends, marking (362) affected Stroke Ends which are changed by removed Prime Objects as changed Stroke Ends, detecting (364) pairs of changed Stroke Ends and merging with Prime Objects, removing (366) and replacing obsolete Prime Objects, removing (368) and replacing obsolete Composite Objects, and extracting (370) Prime Objects associated with changed Stroke Ends.

Inventors: BECKER CRAIG DAVID, MORAN THOMAS PATRICK, SAUND ERIC, BECKER, CRAIG DAVID, MORAN, THOMAS PATRICK, SAUND, ERIC
Applicants: XEROX CORP, XEROX CORPORATION
Application year: 1994
Main classification: G06T11
IPC codes: G06F9, G06F3, G06T11, G09G5