Cell based EUI methods & apparatuses

[0001] This application is a continuation of prior application Ser. No. 10/136,638, filed Apr. 30, 2002, now U.S. Pat. No. 7,013,431, priority from the date of which is hereby claimed under 35 U.S.C. §120.

[0002] 1. Field of the Invention

[0003] The present invention relates to the field of data processing. More specifically, the present invention relates to end user interfaces.

[0004] 2. Background Information

[0005] With advances in integrated circuit, microprocessor, networking and communication technologies, an end user of a properly equipped television set or a computing device may receive and consume a variety of multi-media contents or programming via a number of different delivery channels. The end user may e.g. receive and consume television programming delivered through conventional network broadcast, cable or satellite. The end user may also receive and consume various multi-media contents or programming delivered from various recorded media players, such as VCR tape players, CDROM or DVD players. Alternatively, the end user may also receive and consume various streaming multi-media contents or programming delivered through the Internet or other high-speed digital channel.

[0006] The end user interfaces (EUI) employed in these multi-media content or programming deliveries are typically limited in their functionalities and ease-of-use. In particular, they are typically fixed or inflexible, i.e. non-responsive or lack interactivity with the user. For example, in the case of television programming, typically only a single view of a program (chosen by a director) is provided to the end user (even though multiple views are available from the multitude of cameras employed to cover an event or performance). Even at times, when multiple views of a program are provided, the user is unable to change the size, and/or placements of the different display windows within which the views are displayed. Where modifications of the size and/or placement of the display windows are supported (hereinafter, simply windows), typically, automatic relative re-sizing and/or placement of the windows are not supported. That is, expansion of a window will often result in the blocking of another window (unless the expanding window is a “transparent” window), and contraction of a window will often result in excess unconsumed space (unless the end user takes overt action to enlarge another window). Similar limitations exist in the delivery of multi-media contents or programming from recorded media or streaming through the Internet.

[0007] Further, the different windows (whether it is of the same program or of different programs) are usually not easily interchangeable. In particular, associated controls, such as “minimize”, “maximize”, or task bars, are typically not relocatable from one window associated with one application to another window associated with another application. For example, in the case of television programming, different views of the same program delivered through multiple windows are generally not interchangeable, whereas different programs delivered through different windows, such as a primary view and a “picture-in-picture” (PIP) view, are swappable, provided the end user separately changes the channels associated with the two windows. In the case of windowed applications, control facilities associated with windows of an application, such as “minimize”, “maximize” or task bars, are typically fixed with the corresponding windows and/or the application, and may not be moved and be associated with another window and/or another application.

[0008] Thus, an improved end user interface for content or programming delivery is desired.

[0025] The present invention includes a hierarchical cell based end user interface, having hierarchically organized display cells (hereinafter, simply cells). The present invention also includes processes for the end users to interact with the interface, having particular application to the delivery of multi-media programming and/or content, as well as processes for automatically re-sizing and/or repositioning cells of the EUI.

[0026] In the following description, various aspects of the present invention will be described. However, the present invention may be practiced with only some or all aspects of the present invention. For purposes of explanation, specific numbers, materials and configurations are set forth in order to provide a thorough understanding of the present invention. However, the present invention may be practiced without the specific details. In other instances, well-known features are omitted or simplified in order not to obscure the present invention.

[0027] Parts of the description will be presented in data processing terms, such as data, variables, methods, requests, returns, and so forth, consistent with the manner commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. As well understood by those skilled in the art, these quantities take the form of electrical, magnetic, or optical signals capable of being stored, transferred, combined, and otherwise manipulated through mechanical, electrical and/or optical components of a computer system.

[0028] The term “display cell” (or “cell” for short) as used herein refers to the logical elements or items employed to collectively implement the various aspects of the EUI. The logical elements/items or cells, as will be described more fully below, are typed and include attributes defining them, including their manifestation and behaviors. Visually, cells may be “nested” within one another. Organizationally, cells may be hierarchically related to each other.

[0029] The term “computer system” as used herein includes general purpose as well as special purpose data processing machines, systems, and the like, that are standalone, adjunct or embedded.

[0030] Section headings are merely employed to improve readability, and they are not to be construed to restrict or narrow the present invention.

[0031] Various operations will be described as multiple discrete steps in turn, in a manner that is most helpful in understanding the present invention, however, the order of description should not be construed as to imply that these operations are necessarily order dependent. In particular, these operations need not be performed in the order of presentation.

[0032] The phrase “in one embodiment” is used repeatedly. The phrase generally does not refer to the same embodiment, however, it may.

[0033] FIG. 1 illustrates an external end user view of an exemplary end user interface 102, implemented in accordance with one embodiment of the present invention. As illustrated, exemplary end user interface (EUI) 102, from the end user's perspective, includes multiple display windows 104a-104k, control facilities 106a-106b and icons 108a-108j. EUI 102 may be employed to facilitate delivery of multi-media contents or programming for an end user. An example of such content/programming includes, but are not limited to, presentation of one or more performance or live events, such as sporting events, where the multiple windows are employed to present different views of each performance or event to the end user.

[0034] For ease of understanding, only a couple of control facilities 106a-106b and a handful of icons 108a-108j are illustrated with windows 104a-104k. As will be readily apparent to those skilled in the art, based on the descriptions to follow, the present invention may be practiced with more or less of these elements.

[0035] More importantly, as will be described in more detail below, EUI 102 is implemented internally via a hierarchy of display cells (or cells for short). The cells are typed and nested. Further, they have attributes, and certain attributes may be inherited in one direction, while others in the other direction, i.e. from a higher level cell or from a lower level cell. The cells are implemented as data objects with associated methods to facilitate manipulation of their data.

[0036] Resultantly, one of the benefits is that the views or windows 104a-104k are readily controllable by the end user. An end user may select any one of windows 104a-104k, express a desired modification or change to the size, placement, and/or other related aspects of the windows (such as sound). In response, the implementation logic of the present invention, e.g. a cell manager, or alternatively, a window manager or an application itself (not shown), will resize, re-position or otherwise modify the selected windows, as well as all other impacted elements (cells) of EUI 102 accordingly and automatically.

[0037] Resizing may be expansion of a selected element or cell of EUI 102, or contraction of a selected element or cell of EUI 102. Repositioning of a cell may be within the existing immediately higher-level cell or to another cell of EUI 102. In various embodiments, control facilities 106a-106b are provided for the various windows 104* to facilitate a user in resizing, re-positioning or otherwise modifying the various aspects of the windows 104*.

[0038] In one embodiment, as the selected and/or impacted windows 104* are re-sized, the content of each window 104* may be automatically scaled, preserving “full” visibility of the contents. That is, the contents of the various windows 104* remain in full view, scaled, but not truncated or otherwise eclipsed. However, in alternate embodiments, one or more windows 104* may have their contents truncated or eclipsed instead.

[0039] In one embodiment, in addition to being employed for the delivery of multi-media content or programming, one or more of “windows” 104a-104k may be employed to present a “pool” of icons, each corresponding to an additional displayable or launch-able cell having contents, and/or action that may be performed on the content or the attributes of an associated cell. The former is referred to as an “image icon”, and the cell implementing the “image icon” is an image-icon cell, whereas the latter is referred to as a “button icon”, and the cell implementing the “button-icon” is a button-icon cell.

[0040] These and other aspects of the present invention will be described more fully below. The asterisk at the end of a reference number denotes a “wild card”, representing any of the trailing suffixes of the reference numbers employed in a figure. For example, 104* stands for 104a, 104b or any one of the other 104 references of FIG. 1.

[0041] FIGS. 2-3 illustrate the relevant aspects of the internal hierarchical cell based implementation of EUI 102 to provide the desired improved features and behaviors, in accordance with one embodiment. As illustrated, in accordance with the present invention, end user interface 102 is cell based, and the constituting cells are nested (FIG. 2), and the data objects implementing the cells are hierarchically organized (FIG. 3).

[0042] As alluded to earlier, cells are typed, and have attributes defining their manifestation and behaviors. Visually, cells may be “nested” within each other. Organizationally, cells may be hierarchically related to each other. The attributes may be inherited in either direction, from the higher level cells or from the lower level cells (organizationally speaking).

[0043] More specifically, for the embodiment, each EUI 102 is comprised of a number of nested “container” cells and a number “action” cells. For ease of understanding, the “outer most” (from a nesting perspective) or the highest-level (from a hierarchy perspective) “container” cell, that is the cell corresponding to the totality of display space available, within which all other cells are nested, is referred to as the universal or root region cell 202. Nested within universal region 202 may be one or more nested “container” cells. In particular, at the next highest-level, for the embodiment, for ease of operation, the “container” cells all have visual manifestations that are rectangular in shape, and share borders. These “container” cells are referred to as regions cells 204a-204c.

[0044] Selected one or ones of the region “container” cells may further include one or more nested “container” cells. For ease of understanding, these nested “container” cells, except for ones disposed at the “inner most” nesting or “lowest” level (counting only “container” cells), are referred to as sub-region “container” cells 205a-205b. The “container” cells disposed at the “inner most” nesting or “lowest” level (counting only “container” cells) are referred to as zone “container” cells 206a-206k. A zone “container” cell 206* dedicated to the holding of icon “action” cells (to be described more fully later), such as zone “container” cell 206i, is also referred to as an “icon pool”.

[0045] “Action” cells, such as those implementing control facilities 208a-208b, and icons 210a-210j, whether they are representing other displayable or launch-able cells or merely representing actions to be performed, i.e. image icons or button icons, may be nested within (visually speaking) or descend from (organizationally speaking)) any of the “container” cells, i.e. the universal region cell 202, such as control facilities cells 208a-208b and icon cells 210a-210d, region and sub-region cells 204a-204c and 205a-205b, none shown, or zone “container” cells, such as icon cells 210e-210j.

[0046] As described earlier, control facilities may include facilities for facilitating minimizing or maximizing an “action” cell, and an icon “action” cell may be an image or a button icon “action” cell. The “container” cell within which another “container” or “action” cell is nested or from which the other “container” or “action” cell is descended, is also referred to as a “host” cell.

[0047] Hereinafter, the description will be given with the relationship between the various cells simply be referred to as either being “nested” in another cell or “descended” from another cell, depending on which characterization is more meaningful in view of the context. However, the reference expressed from one perspective (visual or organizational) is an expression in both perspectives, even expression in the other perspective is not explicitly stated.

[0048] Continuing now with the description and referring in particular to FIG. 3, for the embodiment, the data, such as attribute data (described more fully below), associated with each cell, 202 and 204*-210*, whether “container” or “action”, are organized and implemented as an hierarchy of data objects 302 and 304*-306*, with data object 302 corresponding to universal region cell 202 being the root object of the hierarchy, data objects 304* corresponding to region cells 204* being descendant data objects of root object 302, data objects 305* corresponding to sub-region cells 205* being descendant data objects of the data objects 304*-305* of their “host” region/sub-region cells 204*/205*, and data objects 306* corresponding to zones cells 206* being descendant data objects of the data objects 302 and 304*-305* of their host universal/region/sub-region cells 202 and 204-205.

[0049] Contents to be presented in various windows 104*, such as video 308a-308e, graphics 310a-310b and texts 312a-312c are effectuated by associating the data objects of these contents with data objects 306* of the zone “container” cells 206* corresponding to windows 104*. Data objects 314a-314h and 316a-316b implementing icons 210a-210j and control facilities 208a-208b are descendant data objects of the data objects of their respective host universal/regions/sub-regions/zones 202 and 204*-206*.

[0050] Resultantly, the novel architecture and data organization enable contents provided through different display windows 104* to be easily swappable, by swapping the association of the contents' data objects with the “host” zone cell 206*. Similarly, the associations of “action” cells 208* and 210* with the different cells 202 and 204*-206* may also be easily changed, by changing the association between data objects 314*-316* with data objects 302 and 304*-306* of cells 202 and 204*-206*.

[0051] For ease of understanding, only one zone “container” cell 206a and limited number of “action” cells 208a and 210a-210b are illustrated as being directly nested in universal region 202, only one region “container” cell 304b as having sub-region-“container” cells 254*, and only one zone “container” cell 206i is deployed as an icon pool in FIG. 2-3. However, the present invention contemplates multiple nesting of multiple “container” and “action” cells, e.g. more region/zone “container” cells as well as “action” cells may be nested in universal region 202, more third level sub-region “container” cells and/or “action” cells may be nested within region “container” cells of the second level. From the description thus far and the ones to follow, those skilled in the art will be able to practice the present invention in such multi-level manner, should that be desired.

[0052] FIGS. 4-5 illustrate the composition of “container” cells, in particular, a region “container” cell and a zone “container” cell, in accordance with one embodiment. From the processing or computation perspective, the earlier described universal region cell 202, region “container” cell 204*, and sub-region “container” cells 205* are merely different variants the region “container” cell to be described. Accordingly, the composition descriptions to follow apply equally to universal region-cell 202, region “container” cell 204*, and sub-region “container” cells 205*.

[0053] As illustrated, for the embodiment, associated with the definition of each region/zone “container” cell 202 and 204*-206*, and stored inside corresponding data objects 302 and 304*-306* are attributes defining whether a “container” cell 204*-206* is dynamic or fixed (i.e. created on an as needed basis, or always present), whether the “container” cell's position is movable or stationery, its relative priority to other “container” cells 204*-206*, a center position, a base, a height and a maximum size of the region/zone “container” cells 204*-206*:

[0054]

	region “container” cell	zone “container” cell
	region_type = [dynamic, fixed]	zone_type = [dynamic, fixed]
	region_position = [stationary,	zone_position = [stationary,
	movable]	movable]
	region_priority = [1, 2, 3 . . .]	zone_priority = [1, 2, 3 . . .]
	region_center_position	zone_center_position
	region_base	zone_base
	region_height	zone_height
	region_maximum_size	zone_maximum_size

[0055] Additionally, for the embodiment, associated with the definition of each region/zone “container” cell 202 and 204*-206*, and stored inside corresponding data objects 302 and 304*-306* are attributes defining a kernel 402/502 of the region/zone “container” cell 204*-206*. A kernel of a region/zone “container” cell 204*-206* refers to the smallest manifestation of the region/zone “container” cell 204*-206*. That is, when the available space within a host “container” cell 202-205* falls below the space required by the kernel of a region/zone “container” cell 204*-206*, the “container” cell 204*-206* is to be “reduced” to an icon cell.

[0056] For the embodiment, the kernel related attributes include attributes defining a region/zone “container” cell's kernel's size, base and height.

[0057]

	region-cell	zone-cell
	region_kernel_area	zone_kernel_area
	region_kernel_base	zone_kernel_base
	region_kernel_height	zone_kernel_height

[0058] Further, for the embodiment, associated with the definition of each region/zone “container” cell 202 and 204*-206*, and stored inside corresponding data objects 302 and 304*-306* are attributes defining a boundary 406/506 of the region/zone “container” cell 204*-206*. The boundary related attributes include attributes defining a thickness and a color of the boundary of the region/zone “container” cell 204*-206*.

[0059]

	region-cell	zone-cell
	region_boundary_thickness	zone_boundary_thickness
	region_boundary_color	zone_boundary_color

[0060] In one embodiment, if the “boundary” attributes are not specified for a region/zone “container” cell, the region/zone “container” cell automatically inherits the “boundary” attributes of the nearest “ancestor” region “container” cells, where such attributes are specified. In other words, an inheriting region/zone “container” cell takes on the characteristics of the bequeathing “ancestor” region “container” cell.

[0061] Associated with the definition of each region/zone “container” cell 202 and 204*-206*, and stored inside corresponding data objects 302 and 304*-306* are also attributes defining a border 404/504 of the region/zone “container” cell 204*-206*. The border related attributes include attributes defining a thickness, a color, a texture, a shading, a blinking and a transparency attribute of the border of the region/zone “container” cell 204*-206*.

[0062]

	region-cell	zone-cell
	region_border_thickness	zone_border_thickness
	region_border_color	zone_border_color
	region_border_texture	zone_border_texture
	region_border_shading	zone_border_shading
	region_border_blinking	zone_border_blinking
	region_border_transparent	zone_border_transparent

[0063] In one embodiment, if the “border” attributes are not specified for a region/zone “container” cell, the region/zone “container” cell also automatically inherits the “border” attributes of the nearest “ancestor” region “container” cell, where such attributes are specified.

[0064] In various embodiments, for a region “container” cell 204*-205*, the attributes may further include attributes defining how many zone “container” cells it may have, their names and their default alignments (e.g. center, top, bottom, right, left and so forth), whereas for a zone “container” cell 206*, the attributes may further include an attribute defining its “host” region “container” cell 202 and 204*/205*. For a zone “container” cell 206*, the attributes may further include attributes defining its content types, video, data, image, text, and so forth, and an external buffer 508. External buffer 508 defines the minimum inter-zone “container” cell spacing between immediately adjacent zone “container” cells 206*.

[0065]

	region-cell	zone-cell
	region_zone_list = [zone-cell	zone_region_association
	names]
	region_zone_alignment = [center,	zone_video, zone_data,
	top, bottom, right, left]	zone_image, zone_text
	region_max_allowable_zones =
	[number]

[0066] The above described attributes for region/zone “container” cells are merely illustrative. In alternate embodiments, the present invention may be practiced with more or less region/zone “container” cell attributes. For example, the present invention may be practiced with additional attributes defining

[0067] a) the control facilities associated with the region/zone “container” attributes,

[0068] b) the behavior when certain areas of a region/zone “container” cell is “mouse over”, and

[0069] c) forced bequeathing of certain attributes to the more inner or lower level region/zone “container” cells.

[0070] Anatomy of an “Action” Cell

[0071] FIG. 6 illustrates the composition of an “action” cell, more specifically, an image icon “action” cell in further detail, in accordance with one embodiment. As described earlier, an image icon “action” cell is an iconic representation of another displayable or launch-able cell with content, control facilities and so forth. Further, “action” cells may also include cells defining control facilities, and cells defining “button” icon, which provide control facilities for a region/zone “container” cell and action to be performed within a region/zone “container” cell respectively. The description to follow for an image icon “action” cell may be likewise adopted to implement button icon “action” cells and/or control facilities cells.

[0072] As illustrated, for the embodiment, associated with the definition of each image icon “action” cell 208*-210* and stored inside a corresponding data object 314*-316* are attributes defining the bit map of the image icon “action” cell, the center position of the image icon “action” cell, a region/zone “container” cell with which the image icon “action” cell is associated, and a buffer 602. Buffer 602 defines the minimum space required to display the image icon “action” cell.

[0073]

Icon-cell
	image_icon_association = [region/zone-cell name]
	image_icon_center_position = [x, y]
	image_icon_actual = [bit_map_name]
	image_icon_buffer_base = [ ]
	image_icon_buffer_height = [ ]
	image_icon_upper_left_vertex_position = [x, y]

[0074] Similarly, in alternate embodiments, the present invention may be practiced with more or less attributes defining the various “action” cells, as well as the contents to be rendered (i.e. video, graphics, texts, and so forth). In particular, for button icon “action” cells and control facility “action” cells, each of the respective “action” cells may include one or more attributes in identifying the binaries to be executed responsive to various types of user actions, e.g. “mouse over”, “single click”, “double clicks”, and so forth.

[0075] Implementation Methods of “Container” and “Action” Cells

[0076] Referring briefly to FIG. 3 again, as described earlier, for the illustrated embodiment, region/zone “container” cells, “action” cells, and data (include video, graphics, text and so forth) are implemented in an object oriented manner, with corresponding data objects 302 and 304*-316*. In one embodiment, as illustrated in FIG. 7, various methods 700 are associated with the data objects 302 and 304*-316*. For the embodiment, these methods include in particular a clear, a contract, an expand, a remove, and a set attribute method, 702-710, associated with the root data object 302, and inherited by the descendant data objects 304*-316* of the nested region/zone “container” cells 204*-206*, as well as the descendant data objects 314*-318* of the nested “action” cells 208*-210*.

[0077] Clear method 702, when invoked against universal region “container” cell's data object 302 clears the EUI 102, i.e. removing all nested region/zone “container” cells 204*-206*, including their contents, as well as any nested “action” cells 208*-210*. In one embodiment, the universal region “container” cell clearing is efficiently achieved by clearing or deleting all descendant data objects 304*-316*. Inner invocation against a region/zone “container” cell 204*-206* clears the nested regions/zones “container” cells 204*/206* within the target region/zone “container” cell 204* including their contents, and any nested “action” cells 208*-210*. In like manner, the clearing is efficiently achieved by clearing or deleting the applicable descendant data objects 304*-316*.

[0078] Expand and contract methods 704-706 are employed to expand and contract a region/zone “container” cell 204*-206* respectively. Remove method 708 facilitates removal of individual cells of the EUI 102, i.e. one or more regions/zone “container” cells 204*-206* or “action” cells 208*-210* without clearing all cells. Removal is achieved in like manner as clear method 702, except the operation is applied to selected ones of the descendant data objects, as opposed to all descendant data objects. Set Attribute method 710 facilitates setting of the earlier described region/zone “container” cell and “action” cell attributes associated with region/zone “container” cells 202 and 204*-206*, and “action” cells respectively.

[0079] For region/zone cells 204*-206* and “action” cells 208*-210*, their corresponding data objects 304*-306* and 314*-316* further include the association of a create, and a delete, a move and a place method 712-718. Create and delete methods 712-714, as their names suggest, facilitate creation and delete of the various descendant data objects 304*-306* and 314*-316* for the nested region/zone “container” cells and “action” cells 204*-206* and 208*-210*. Move and place methods 716-718, as their names suggest, facilitate movement and relocation of the various region/zone “container” cells and “action” cells 204*-206* by modifying e.g. the position attributes of the corresponding data objects 304*-306* and 314*-316*.

[0080] For the embodiment, data objects 314*-316* for “action” cells 208*-210* further include the association of a launch method 720 for launching a displayable region/zone cell 204*-206* represented by image icon “action” cells 210*.

[0081] With the exception of the handling of the impact that flows from the creation, deletion, expansion and contraction of a region/zone “container” cell 204*-206*, implementation of the above described methods are within the ability of those ordinarily skilled in the art, accordingly will not be further described. Handling of the impact that flows from the creation, deletion, expansion and contraction of a region/zone “container” cell 204*-206* will be described in more detail below, referencing FIGS. 11-16.

[0082] Interacting with EUI

[0083] FIGS. 8-9 illustrate two novel interactions with EUI 102, otherwise not available under the prior art, and the relevant operation flow of an implementor, such as an application, a cell manager or a window manager, incorporated with the teachings of the present invention. As illustrated, by virtue of the earlier described novel architecture and data organization, contents presented through two different zone “container” cells 206* may be easily interchanged or swapped, as denoted by arrow 802. The swapping operation may be initiated through any one of a number of user key sequences, e.g. user key sequences similar to a conventional drag and drop operation. The swapping may be efficiently accomplished by switching association of the applicable data objects 308*-316* and their region/zone “container” cells 204*-206*. Further, “action” cells 314*-316* may be easily relocated to any region/zone “container” cell 204*-206* as denoted by arrow 804.

[0084] As illustrated in FIG. 9, in response to a non-region/zone “container” cell impacted user interaction, an implementor (such as an application, a cell manager or a window manager incorporated with the teachings of the present invention) determines if the sequence of user inputs denotes a drag and drop of content from one region/zone “container” cell 204*-206* to another, block 902. If so, the implementor effectuates the content swapping, by switching the data objects' association with their region/zone “container” cells 204*-206*, as earlier described, block 904.

[0085] If the sequence of user inputs does not denote a drag and drop of content, for the embodiment, the implementor further determines if the sequence of user inputs denotes an “action” cell drag and drop, block 906. If so, the implementor effectuates the “action” cell movement and placement by similarly switching the “action” cell's association with region/zone “container” cells 204*-206*, optionally launching the represented region/zone “container” cell 204*-206* and its contents (if so requested by the sequence of user inputs), block 908.

[0086] If the sequence of user inputs does not denote either one of these novel interactions supported, the denoted prior art request may then be processed as in the prior art.

[0087] The sequence of user inputs denoting the earlier described content and “action” cell drag and drop may be practiced through any key sequences, e.g. by clicking on the content or icon, using a cursor control device, and keeping the applicable click button of the cursor control device held down, until the target region/zone “container” cell 206* is reached. At such time, the click button of the cursor control device may be returned to its normal position. In alternate embodiments, the present invention may be practiced with other key sequences instead.

[0088] Transition from a Current View to a Next View

[0089] FIG. 10 illustrates an overview of the operation of EUI 102. The current state of EUI 102 as defined by the current states of the corresponding data objects 302-316* of the constituting cells 202-210* of EUI 102, as illustrated, is referred to as the current view of EUI 102. In response to user interactions, such as a request to add or remove a region/zone “container” cell 204*-206*, or a request to expand or contract a region/zone “container” cell 204*-206*, the implementor of the present invention, e.g. an application, a cell manager or a window manager, performs a series of responsive calculations, and generate the next view of EUI 102.

[0090] The operational flow of the relevant aspects of the implementor, in response to the various user interactions of interest, will be described in turn below.

[0091] Addition/Expansion of a Region/Zone “Container” Cell

[0092] FIG. 11 illustrates the operational flow of the relevant aspects of an implementor, e.g. an application, a cell manager or a window manager, for responding to a request to add a region/zone “container” cell or an “action” cell to a region/zone “container” cell, or expand a region/zone “container” cell (hereinafter, for the description of FIG. 11, simply the “add/expand” request), in accordance with one embodiment. As illustrated, for the embodiment, the implementor first determines if the requested addition or expansion fits in the current available space of the host region/zone “container” cell, block 1102. The required space to accommodate the requested addition/expansion may e.g. be determined from the attribute values of the “new” or expanded region/zone “container” cell. If the requested addition or expansion fits in the current available space of the host region “container” cell, the requested addition or expansion is performed accordingly, block 1104.

[0093] However, if the requested addition or expansion does not fit in the current available space of the host region/zone “container” cell, the implementor successively undertakes one or more space creation actions, until either sufficient amount of available space has been created or until all possible space creation actions have been exhausted, blocks 1102-1108. As soon as sufficient available space has been created, operation continues at block 1104 as earlier described.

[0094] However, if all possible space creation actions have been exhausted and the amount of space required to accommodate the requested addition or expansion remains insufficient, the implementor successively undertakes one or more space requirement reduction actions, until either the required space has been reduced below the amount of available space or until all possible space reduction actions have been exhausted, blocks 1110-1112. Similarly, as soon as the required space to satisfy the addition or expansion request is reduced below the available space, operation continues at block 1104 as earlier described.

[0095] If likewise, all possible required space reduction actions are exhausted, and the amount of space required to accommodate the add/expand request remains above the available space, an “error”, such as “unable to add/expand”, is returned in response to the request.

[0096] In one embodiment, available space creation actions include shifting existing region/zone “container” cells within the host region/zone “container” cell the add/expand request is to be performed, and reducing the existing region/zone “container” cells if necessary. In one embodiment, shifting of existing region/zone “container” cells includes shifting the existing regions/zone “container” cells to a predetermined corner of the host region/zone “container” cell, e.g. the lower left corner, the upper left corner, the upper right corner or the lower right corner. In one embodiment, shifting of existing region/zone “container” cell to a corner is performed by aligning the region/zone “container” cells along one or the other boundary forming the corner. In another embodiment, shifting of existing region/zone “container” cells to a corner is performed by alternating in aligning the regions/zone “container” cells along the boundaries forming the corner.

[0097] In one embodiment, reducing the existing region/zone “container” cells is performed in an incremental manner. In another embodiment, reducing the existing region/zone “container” cells is performed in accordance with the relative priorities of the existing region/zone “container” cells. In one embodiment, reduction is performed in an incremental manner as well as in view of the relative priorities of the existing region/zone “container” cells. In one embodiment, the lowest priority region/zone “container” cell is first successively reduced to its kernel before the next higher priority region/zone “container” cell is successively reduced towards its kernel. In another embodiment, the reduction is successively performed in a round robin manner. In yet another embodiment, reduction of existing region or zone “container” cells further includes reducing one or more of the existing region/zone “container” cells to their icon “action” cell representations. Again, in one embodiment, the reduction to iconic representation is performed in view of the relative priorities of the existing region/zone “container” cells.

[0098] In one embodiment, reduction of required space action includes successively reducing the size of the region/zone “container” cell to be added, or to be expanded to.

[0099] Still referring to FIG. 11, back at block 1104, upon performing the requested addition/expansion, the implementor determines if any post addition/expansion operations need to be performed. If so, the post addition/expansion operations are performed, block 1118. If not, the process terminates.

[0100] Post addition/expansion operations may be required, as existing region/zone “container” cells may have been shifted to one corner of the host region/zone “container” cell or reduced, even to their kernel, in the course of accommodating the addition/expansion request. Accordingly, for the embodiment, upon accommodating the addition/expansion, attempts are made to at least partially restore the shifted and/or reduced region/zone “container” cells back to the pre-request state. Similarly, the post addition/expansion operations may include successively expanding reduced existing region/zone “container” cells, which may also be performed in view of the relative priorities, re-shifting shifted region/zone “container” cells (e.g. out from the coalesce corner) to achieve a more balance alignment of the nested region/zone “container” cells within the host region “container” cell. “Balance” may be measured e.g. by the average space gap between the boundaries of the various region/zone “container” cells.

[0101] FIG. 13 illustrates an exemplary addition of a new region/zone “container” cell into a region “container” cell having two existing region/zone “container” cells, in accordance with the above described process. As illustrated, the two existing region/zone “container” cells are first shifted to the lower left corner, with the two existing region/zone “container” cells aligned along the left boundary forming the lower left corner (illustrations A & B). Since there isn't enough available space to add the requested new region/zone “container” cell, the two existing region/zone “container” cells are successively reduced, eventually to their kernels, first the lower priority region/zone “container” cell, then the higher priority region/zone “container” cell (illustrations C-D). The new region/zone “container” cell is then added to the newly created space in the opposite upper right corner (Illustration E). Further, the reduced region/zone “container” cells are shifted back out from the lower right corner and aligned in the bottom portion of the host region/zone “container” cell (illustration F & G).

[0102] FIG. 14 illustrates another exemplary addition of a new region/zone “container” cell into a region/zone “container” cell having three existing region/zone “container” cells, in accordance with the above described process. Except in this illustration, the existing region/zone “container” cells are first shifted to the upper left corner, and then shifted out along the top portion of the host region/zone “container” cell instead. Further, the new region/zone “container” cell is reduced to reduce its space requirement before it is added to the host region/zone “container” cell.

[0103] Removal/Contraction of a Region/Zone “Container” Cell

[0104] FIG. 12 illustrates the operational flow of the relevant aspects of an implementor, e.g. an application, a cell-cell manager or a window manager, for responding to a request to remove a region/zone “container” cell from a region “container” cell, or an “action” cell from a region/zone “container” cell (hereinafter, for the description of FIG. 12, simply the “remove/contract” request), in accordance with one embodiment. As illustrated, for the embodiment, the implementor removes or contracts the region/zone “container” cell, or the “action” cell as requested, block 1202. Thereafter, the implementor determines if the there are iconized region/zone “container” cells of the host region/zone “container” cell that can be restored into the newly increased available space of the host region/zone “container” cell, block 1204. If so, the implementor restores one or more of the eligible iconized region/zone “container” cells, subject to the available space, block 1206. In one embodiment, the restoration is performed in accordance with the relative priorities of the iconized region/zone “container” cells.

[0105] Upon exhausting the possibility of restoring iconized region/zone “container” cells (either because there are none left or there isn't enough space), the implementor determines if there are any reduced region/zone “container” cells that can be grown towards their maximum sizes, block 1208. If so, the implementor successively grows one or more of the reduced region/zone “container” cells, subject to the available space, block 1210. In one embodiment, the successive growth is also performed in accordance with the relative priorities of the reduced region/zone “container” cells.

[0106] Next, similar to the process of adding or expanding a region/zone “container” cell, upon restoring or growing the iconized or reduced region/zone “container” cells, the implementor determines if any post restoration or growth actions need to be performed, block 1212. If so, the implementor performs the post restoration or growth actions, such as shifting and aligning to “re-balance” the region/zone “container” cells of the host region/zone “container” cell, block 1214. As before, “balance” may be measured e.g. by the average space gap between the boundaries of the various region/zone “container” cells

[0107] Alternate Embodiment—Extended Boundary Method

[0108] FIG. 15 illustrates the operational flow of the relevant aspects of an implementor, e.g. an application, a cell manager or a window manager for responding to a request to expand a region “container” cell (hereinafter, for the description of FIG. 15, simply the “add/expand” request), in accordance with another embodiment. In this embodiment, for efficiency of operation, region “container” cells are nested within a host region “container” cell in a contiguous manner, i.e. without available space gap between their boundaries.

[0109] As illustrated, in response to a request to grow a region “container” cell by an amount, the implementor first generates extended boundaries for the growth region “container” cell (see FIG. 16), block 1502. Next, the implementor determines growth impact for up to n levels removed in all directions, using the extended boundaries.

[0110] For example, for the exemplary growth request illustrated in FIG. 16, growth impact of the center region “container” cell may be determined using its extended boundaries, based on their intersections with other boundaries. The impacts on region “container” cells up to 2 degrees removed from the center region “container” cell may be summarized as follows:

[0111]

	up	down	left	right
	Neighbor region	A, B	F, E	H, G	C, D
	“container” cell
	affected
	Second level	none	none	special case	L, K, J
	region
	“container” cell
	affected
	Side Effects	H, C	D	F	none

[0112] Thereafter, for the embodiment, the implementor iteratively expands the region “container” cell in the various directions, adjusting the impacted region “container” cell to accommodate the growth, block 1506. The process continues until the desired amount of growth is achieved. If the desired growth is not achievable, for the embodiment, an “error”, such as “growth unachievable”, is returned, block 1508.

[0113] Implementor

[0114] As alluded to earlier, the present invention may be practiced e.g. by endowing an application itself, a cell manager or a window manager with the teachings of the present invention. In the latter cases, a cell/window manager implementor may be effectuated in at least two manners, FIG. 17a and FIG. 17b. In the embodiment of FIG. 17a, cell manager 1704 is equipped with teachings of the present invention interfaces and interacts with applications 1702 using its services, and display device driver 1706 as in the prior art. Accordingly, under this embodiment, typically, the universal region “container” cell 202 is the entire display space of a display device.

[0115] In the alternate embodiment of FIG. 17b, the cell manager implementor operates as an “auxiliary” cell manager 1703 to a conventional window manager 1704. Applications 1702 may interact with conventional window manager 1704 directly or indirectly through auxiliary cell manager 1703 (equipped with the teachings of the present invention). Accordingly, universal region “container” cell 202 may be a window of a conventional window approach, except within that window, the EUI is implemented and practiced as earlier described, in accordance with the present invention.

[0116] In yet other alternate embodiments, auxiliary cell manager 1703 may be integrally incorporated as part of window manager 1704.

[0117] Example Computer System

[0118] FIG. 18 illustrates an exemplary computer system or device suitable for practicing the present invention, in accordance with one embodiment. As shown, computer system/device 1800 (hereinafter simply “device”) includes one or more processors 1802 and system memory 1804. Additionally, device 1800 includes mass storage devices 1806 (such as diskette, hard drive, CDROM and so forth), input/output devices 1808 (such as keyboard, cursor control and so forth) and communication interfaces 1810 (such as network interface cards, modems and so forth). The elements are coupled to each other via system bus 1812, which represents one or more buses. In the case of multiple buses, they are bridged by one or more bus bridges (not shown). Each of these elements performs its conventional functions known in the art. In particular, system memory 1804 and mass storage 1806 are employed to store a working copy and a permanent copy of the programming instructions implementing the implementor of the present invention, e.g. an application, a cell manager or a window manager. The permanent copy of the programming instructions may be loaded into mass storage 1806 in the factory, or in the field, through a distribution medium (not shown) or through communication interface 1810 (from a distribution server (not shown)). The constitution of these elements 1802-1812 are known, and accordingly will not be further described.

[0119] Example Network Environment

[0120] FIG. 19 shows an exemplary network environment suitable for practicing the present invention, in accordance with one embodiment. In this embodiment, contents are presented for user of client device 1902 to enjoy, employing the hierarchical cell based EUI 102 of the present invention. In one embodiment, display device 1904a on which EUI 102 is rendered, is an integral of client device 1902. In another embodiment, display device 1904b on which EUI 102 is rendered, is an separate and distinct “peripheral” of client device 1902.

[0121] In various embodiments, the implementor of the present invention, e.g. an application, a cell manager or a window manager, may be executing on client device 1902 itself. In other embodiments, the implementor may be executing on server 1906 instead. Examples of the former case may be a personal computer, an enhanced integrated television set, and a set-top box. Examples of the latter case may be a content streaming server or a cable programming broadcasting device.

[0122] Client device 1902 and server 1906 are coupled to each other via one or more private and/or public networks, including e.g. the Internet, employing Digital Subscriber Lines (DSL) (or other variants xDSL), Cable Network, Integrated Digital Service Network (ISDN), Asynchronous Transfer Mode (ATM), Frame Relay, or other high performance communication links/connections of like kind. Communications between client device 1902 and server 1906 may be accomplished via any one of a number of communication protocols known in the art, including but are not limited to the TCP/IP protocol.

[0123] Examples of content may include one or more of the following content or program types:

[0124]

	Special
	Events	News	TV	Sports
	Concerts	Live	Reality	Golf
	Olympics	Produced	Network	Football
	Political	Shows	Syndication	Racing
	Rallies		Children's TV	Football
	Amusement		Treasure Hunts	Soccer
	Plays

[0125] Thus, a novel EUI method and apparatus has been described. While the present invention has been described with the foregoing embodiments, the present invention is not so limited. The present invention may be practiced with modifications and extensions to the earlier described embodiments. The full scope of the present invention is defined by the claims to follow.