Patent Grant
9489104
This disclosure relates generally to techniques to display a group of media items in an optimal media arrangement. More particularly, the disclosure relates to techniques to efficiently identify a set of frames (and corresponding media items) within a visible display area of a displayed media arrangement.
With the rapid increase in the number of devices capable of capturing digital media and the number of repositories for such media, there exists a need for an interface that is capable of aggregating, sorting, and displaying all of the media to which a user has access in a visually pleasing manner. Unlike traditional media item displays which generally include display frames having a common size and repetitive spacing, a visually pleasing display of media items may include a more natural and random arrangement of media items in display frames having varying sizes and positioning. Due to the randomness in size and positioning of the display frames that contain media items in a visually pleasing arrangement, the identification of the display frames that appear within a viewable area may require a more complex operation than that required for traditional, ordered displays. In addition, because many of the devices capable of capturing and displaying media items in a more visually pleasing arrangement have relatively limited memory and processing capabilities (e.g., mobile devices such as phones, tablet computer systems, and personal digital assistants or PDAs), it would be desirable to optimize the operations to identify display frames that appear within a viewable area in order to improve a user's experience in viewing the media items.
In one embodiment, a method is provided for associating each media item in a set of media items with a frame in a media arrangement and identifying one or more media items that are within a viewable area of the media arrangement. The method includes dividing a list of media items from the set of media items into two portions, one portion on either side of a middle item in the list and determining whether any part of a frame with which the middle item is associated is within an extended spatial area that extends beyond the viewable area of the media arrangement. The method also includes eliminating from the list the middle item and the portion that does not include any media items that are associated with frames that are within the extended area, when it is determined that no part of the frame with which the middle item is associated is within the extended area; repeating the dividing, determining, and eliminating until it is determined that a part of a frame with which the middle item is associated is within the extended area, and identifying one or more media items on either side of the middle item in the list that are associated with frames that are at least partially within the viewable area of the media arrangement.
In another embodiment, a non-transitory program storage device is provided which is readable by a processor and includes instructions that cause one or more processors to associate each media item in a set of media items with a frame in a media arrangement, divide a group of media items from the set of media items into two portions, one portion on either side of a middle item in the group, determine whether any part of a frame with which the middle item is associated is within a first spatial area of the media arrangement, modify the group of media items to include only the one of the two portions that includes one or more media items that are associated with frames within the first spatial area when it is determined that no part of the frame with which the middle item is associated is within the first spatial area, continue performing the instructions to divide, determine, and modify until it is determined that a part of a frame with which the middle item is associated is within the first spatial area, and identify one or more media items on either side of the middle item that are associated with frames that are at least partially within a second spatial area of the media arrangement.
This disclosure pertains to systems, methods, and computer readable media for displaying user-selected media items in a manner that optimizes the user experience. In general, a set of media items may be matched to, and displayed in accordance with, one of a number of predefined media arrangements as described in co-pending applications entitled “Semi-Automatic Organic Layout for Media Streams” and “Multi-Source Media Aggregation”, both of which are being filed concurrently with this application and the contents of which are incorporated herein by reference. More specifically, different portions of a set of media items may be matched to different sub-media arrangements and the sub-media arrangements may be appended together in order to create the appearance of a single media arrangement (hereinafter referred to as the media arrangement) to display all of the media items in the set. Because the set of media items may include a large number of media items, it will be understood that only a subset of the media items will appear within a viewable portion of the media arrangement at any given time. As the user interacts with the display of the media items in the media arrangement (e.g., scrolls through the media items), it may be necessary to identify which portion of the media arrangement, and consequently which media items, are viewable at any given time. It may further be necessary that this identification occur in an efficient manner in order to maintain the interactive feel of the display interface.
In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the inventive concept. As part of this description, some of this disclosure's drawings represent structures and devices in block diagram form in order to avoid obscuring the invention. In the interest of clarity, not all features of an actual implementation are described in this specification. Moreover, the language used in this disclosure has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter, resort to the claims being necessary to determine such inventive subject matter. Reference in this disclosure to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention, and multiple references to “one embodiment” or “an embodiment” should not be understood as necessarily all referring to the same embodiment.
It will be appreciated that in the development of any actual implementation (as in any development project), numerous decisions must be made to achieve the developers' specific goals (e.g., compliance with system- and business-related constraints), and that these goals will vary from one implementation to another. It will also be appreciated that such development efforts might be complex and time-consuming, but would nevertheless be a routine undertaking for those of ordinary skill in the art of media item processing having the benefit of this disclosure.
Referring to
Referring to
For a given offset 215 (i.e., the offset from a reference point for the initial display of media arrangement 205), the viewable area may be defined in terms of offset 215, display region size in the adjustment dimension 220 (i.e., the dimension of the media arrangement in which user adjustments of the viewable area are capable of being made), and display region size in the non-adjustment dimension 225. For example, for a display region size of 1024 pixels by 768 pixels and an offset of 4200 pixels, all or a portion of frames 40-54 of media arrangement 205 appear within viewable area 230. However, because the size and spacing of media frames varies within any particular region of media arrangement 205, the identification of media frames that appear within a viewable area corresponding to any particular offset is a more complex operation than for a display of media items in an ordered media arrangement.
Referring to
Because there is a relationship between the position of a media item within media item set 210 and the location of the corresponding frame of media arrangement 205 within which the media item is displayed (i.e., media items having a similar position in media item set 210 have a similar location in media arrangement 205), it may be possible to proceed through media item set 210 one item at a time to identify a group of media items that appear within a particular region without evaluating each and every media item in media item set 210. However, because consecutive media items in media item set 210 may not have adjacent locations within media arrangement 205, it may be necessary to account for the largest positional difference in the adjustment dimension between consecutive media items in media item set 210. For example, a particular viewable area may include at least a portion of media item 36 but none of media items 34 or 35. In order to ensure that the iterative process can be concluded (i.e., that all media items that appear within a particular region have been identified), it may be necessary to expand the region against which each media item's corresponding frame coordinates are evaluated to include the largest positional difference in the adjustment dimension between consecutive media items in media item set 210. In the illustrated embodiment, display region 220 is expanded in each direction by an amount (Δ) 310 that is equal to the maximum positional difference in the adjustment dimension between consecutive media items in media item set 210 to obtain expanded region 320. In one embodiment, viewable area 230 and the expanded area defined by expanded region 320 may be labeled as R1 and R2, respectively. R1 and R2 may be defined by the coordinate location of a corner of each respective area as well as the length and width of the area. For example, for an offset 215 of 4200 pixels and a display region size of 1024 pixels by 768 pixels, R1 may be defined as [(4200, 0), (1024, 768)] and R2 may be defined as [(4200−Δ, 0), (1024+Δ, 768)]. In an alternate embodiment, R1 and R2 may be defined in any manner that allows the areas to be compared to the locations of frames in media arrangement 205.
The maximum distance Δ may differ based on the placement of media items within media arrangement 205. If frames are positioned in media arrangement 205 such that the display of consecutive media items in media item set 210 is at least partially overlapping in the adjustment dimension, the maximum distance (Δ) 310 may be equal to the adjustment dimension size of the largest frame in media arrangement 205. If frames are positioned in media arrangement 205 such that the frames within any particular sub-media arrangement (e.g., media arrangements 205A, 205B, and 205C) have no positional ordering (e.g., ordered based on importance), the maximum distance Δ may be equal to the adjustment dimension size of the largest sub-media arrangement. Alternatively, if frames are strictly ordered by position in the adjustment dimension (e.g., left to right with top to bottom priority for identical abscissa), the maximum distance Δ may be equal to zero.
Iterative operation 300 to identify the media items that are assigned to frames that appear within viewable area 230 (R1) may include sequentially evaluating the media items in media item set 210 to identify the first media item assigned to a frame having coordinates that intersect expanded area R2 (330). Upon identification of the first media item assigned to a frame that intersects R2 (335), each media item may be sequentially evaluated (340) for its assignment to a frame that intersects with both R1 and R2. Upon identification of the first media item that does not intersect with R2 (345), the iterative process may end and the media items assigned to frames that intersect with R1 (e.g., frames 40-54) may be determined to be at least partially within viewable area 230.
While iterative operation 300 may allow the media items that at least partially appear within viewable area 230 to be identified without evaluating every media item, the complexity of the operation increases linearly with increasing offset (i.e., O(n)). As the offset increases, the number of media items that need to be evaluated also increases and the performance suffers.
In one embodiment, in order to ensure a smooth user scrolling experience, it may be desired to maintain a relatively high frame rate (e.g., 60 frames per second) for displaying the media items in a media arrangement. In such an embodiment, it will obviously be necessary for operations to determine the media items that appear within a viewable area to be performed with at least the same frequency. Because the media items appearing within a visible area may need to be recalculated each time the display offset is adjusted (e.g., by a user scroll input) by even a single pixel, iterative operation 300 may not provide the necessary performance as the number of media items and the display offset increases. Accordingly, the efficiency of an operation to identify the media items that appear within a viewable area may need to be increased in order to attain the desired performance.
Referring to
In response to a detection of a position adjustment, the display offset may be obtained (block 410). In one embodiment, the offset may represent a distance between a known reference point and a corresponding reference point of a current viewable portion of the media arrangement. For example, as described above, the identified offset may represent the number of pixels between the left edge of the initial viewable portion (e.g., the viewable portion upon a first display of the media arrangement) and the left edge of the current viewable portion of the media arrangement. In another embodiment, the known reference point may be adjusted according to position adjustments. For example, the known reference point may be adjusted to correspond to a reference point of a prior viewable area (e.g., the left edge of the viewable area immediately prior to the user position adjustment). In response to a position adjustment, the current reference point may be compared to the known reference point to obtain the offset.
For a given offset, the coordinates of a viewable area may be determined based on the characteristics of the display (block 415). For example, the viewable area may be described by the coordinates of a rectangle having a height and width equal to the known properties of the display area at the determined offset. In one embodiment, the viewable area (R1) may be defined by a set of coordinates that represent the location of a corner of the viewable area (e.g., in a coordinate system defined with respect to the media arrangement) and a set of values that represent the height and width of the display area. In another embodiment, the viewable area (R1) may be defined in any manner that allows for the identification of frames that intersect the viewable area.
In addition to the determination of the coordinates of the viewable area (R1), the coordinates of an expanded area (R2) may also be determined (block 420). The expanded area (R2) may account for the potential positional differences between consecutive media items in a media item set by expanding the viewable area (R1) in each direction in the adjustment dimension by an amount (Δ) equal to the largest possible positional difference in the adjustment dimension between consecutive media items. The amount (Δ) by which the viewable area (R1) is expanded to obtain the expanded area (R2) may vary based on the positional ordering of media frames within the media arrangement as described above. Similar to operation 300, comparison of media frame locations to the expanded area (R2) may ensure that process 400 does not conclude without identifying one or more media items that are assigned to frames that should properly be identified as appearing within the viewable area (R1).
After the coordinates of the viewable area (R1) and the expanded area (R2) have been determined, the middle item in a list of media items that are included in the media arrangement may be identified (block 425). For a first iteration, the list of media items may include all of the media items in the media item set (ordered in the same manner as the media item set) that was matched with the media arrangement. As will be described below, for subsequent iterations, the list of media items may include less than all of the media items in the media item set. The middle item in the list of media items is determined based on the ordering of media items in the media item set used to populate the media arrangement. For example, for a list of media items having 37 media items, the 19th media item may be identified as the middle item in the list. In one embodiment, the middle item in the list may be identified by dividing the number of items in the list by two, rounding the result if necessary (e.g., if the result is a non-integer value), and selecting the media item having an order in the list that corresponds to the result. However, the middle item may be identified in any manner that divides the media item list into portions having substantially similar numbers of media items.
After the middle media item in the list has been identified, it may be determined if the middle media item is assigned to a frame in the media arrangement that intersects with the expanded area (R2) (block 430). When each item in the media item set has been assigned to a frame in the media arrangement, the location properties of the frame to which each media item is assigned may be associated with the media items. In one embodiment, the location of the frame to which a media item is assigned may be expressed in terms of the same coordinate system used to define the location of the viewable area (R1) and the expanded area (R2). In such an embodiment, determining whether the media item is assigned to a frame that intersects with the expanded area (R2) may simply involve a comparison of the coordinates of the frame and the expanded area (R2) to identify an overlap.
If it is determined that the middle item in the list does not intersect with the expanded area (R2) (the “No” prong of block 430), the portion of the list that may be eliminated may be determined (block 435). Based on the comparison of the location of the frame to which the middle item is assigned and the location of the expanded area (R2) to determine whether there is an intersection, the portion of the list of media items that can be eliminated may also be determined. For example, because the list of media items substantially corresponds to the location of the media items within the media arrangement, if the middle item does not intersect with the expanded area (R2) then each of the media items in one of the two portions of the list will also not intersect with the expanded area (R2) and can therefore be eliminated from the list. If the comparison of the location of the frame to which the middle item is assigned and the location of the expanded area (R2) indicates that the media item is assigned to a frame located left of the expanded area, then all of the other items located left of the middle item will also be located left of the expanded area (R2). Therefore, for a list of media items having a substantially left to right positioning by order, the middle item and all of the items preceding the middle item in the list can be eliminated from the list. Conversely, if the middle item is determined to be located right of the expanded area (R2), for a list of media items having a substantially left to right positioning by order, the middle item and all of the media items after the middle item in the list can be eliminated from the list. Stated differently, the middle item divides the list of media items into two portions, and, if it is determined that the middle item is assigned to a frame that has a location that does not intersect with the location of the expanded area (R2), the middle item and all of the media items in one of the portions can be eliminated from the list. Based on the determination, the appropriate portion of the list may be eliminated (block 440), and the middle item in the modified list may be identified. It is important to note that, although a portion of the media items in the list may be eliminated, the remaining items maintain the initial ordering. The process of identifying a middle item in a list of media items, determining whether the media item is assigned to a frame having a location that intersects with the expanded region, and eliminating the appropriate media items from the list (i.e., blocks 425-440) may continue until it is determined that the identified middle item in the list is assigned to a frame that intersects with the expanded area (R2).
When it is determined that an identified middle item in the list intersects with the expanded area (the “Yes” prong of block 430), the set of media items around the identified middle media item that are also assigned to frames that intersect with the expanded area (R2) may be identified (block 445). In one embodiment, identifying the set of media items that are also assigned to frames that intersect with the expanded area (R2) may include proceeding through the list of media items sequentially in each direction from the middle media item until the first media item in each direction from the middle media item that is assigned to a frame that does not intersect with the expanded area (R2) is identified. The media items between these two items (i.e., between the first item in each direction of the middle media item that is assigned to a frame that does not intersect with the expanded area), may be identified as the complete set of media items that are assigned to frames that intersect with the expanded area.
From the set of media items assigned to frames that intersect with the expanded region, it may be determined which media items are assigned to frames that also intersect with the viewable area (R1) (block 450). While the identification of media items assigned to frames that intersect with the viewable area (R1) is illustrated as being performed after the identification of media items assigned to frames that intersect with the expanded area (R2), in one embodiment, these operations may actually be performed simultaneously. For example, when the frame locations of the media items in each direction of the middle media item are compared to the expanded area (R2), they may also be compared to the viewable area (R1). The set of media items assigned to frames that intersect with the viewable area (R1) may be identified as the complete set of media items that are at least partially contained within the viewable area.
Operation 400 has a complexity that is a logarithmic function of the number of items in the media item set (i.e., O(log2n)). Whereas doubling the offset in operation 300 results in doubling the number of media items that must be evaluated, doubling the number of media items (for any given offset) only adds a single comparison measure in accordance with operation 400.
Referring to
Using the modified list of media items (that includes 32 media items), the 16th item in the modified list (the 49th item in media item set 210) may be identified as the middle item (515). It may then be determined that middle item 515 is assigned to a frame that does intersect with the expanded area. The set of media items that are assigned to frames that intersect with the expanded area (520) may then be identified by sequentially evaluating the media items on either side of middle item 515 for assignment to a frame that intersects with the expanded area until the first media item in each direction of middle item 515 that is assigned to a frame that does not intersect with the expanded area is identified (i.e., media items 525 and 530). From within the set of media items 520, the media items 535 that are assigned to frames that intersect with the viewable area are identified. These media items represent the complete set of media items that are at least partially visible within the viewable area and for which media item data is required for a current display.
Referring to
Processor 605 may execute instructions necessary to carry out or control the operation of many functions performed by device 600. Processor 605 may, for instance, drive display 610 and receive user input from user interface 615. User interface 615 can take a variety of forms, such as a button, keypad, dial, a click wheel, keyboard, display screen and/or a touch screen. Processor 605 may also, for example, be a system-on-chip such as those found in mobile devices and include a dedicated graphics processing unit (GPU). Processor 605 may be based on reduced instruction-set computer (RISC) or complex instruction-set computer (CISC) architectures or any other suitable architecture and may include one or more processing cores. Graphics hardware 620 may be special purpose computational hardware for processing graphics and/or assisting processor 605 to process graphics information. In one embodiment, graphics hardware 620 may include a programmable graphics processing unit (GPU).
Sensor and camera circuitry 650 may capture still and video images that may be processed, at least in part, in accordance with the disclosed techniques by video codec(s) 655 and/or processor 605 and/or graphics hardware 620, and/or a dedicated image processing unit incorporated within circuitry 650. Images so captured may be stored in memory 660 and/or storage 665. Memory 660 may include one or more different types of media used by processor 605 and graphics hardware 620 to perform device functions. For example, memory 660 may include memory cache, read-only memory (ROM), and/or random access memory (RAM). Storage 665 may store media (e.g., audio, image and video files), computer program instructions or software, preference information, device profile information, and any other suitable data. Storage 665 may include one or more non-transitory storage mediums including, for example, magnetic disks (fixed, floppy, and removable) and tape, optical media such as CD-ROMs and digital video disks (DVDs), and semiconductor memory devices such as Electrically Programmable Read-Only Memory (EPROM), and Electrically Erasable Programmable Read-Only Memory (EEPROM). Memory 660 and storage 665 may also be used to tangibly retain computer program instructions or code organized into one or more modules and written in any desired computer programming language. When executed by, for example, processor 605 such computer program code may implement one or more of the operations described herein.
It is to be understood that the above description is intended to be illustrative, and not restrictive. The material has been presented to enable any person skilled in the art to make and use the inventive concepts described herein, and is provided in the context of particular embodiments, variations of which will be readily apparent to those skilled in the art (e.g., some of the disclosed embodiments may be used in combination with each other). Many other embodiments will be apparent to those of skill in the art upon reviewing the above description. The scope of the invention therefore should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled. In the appended claims, the terms “including” and “in which” are used as the plain-English equivalents of the respective terms “comprising” and “wherein.”
| Number | Name | Date | Kind |
|---|---|---|---|
| 4969204 | Jones | Nov 1990 | A |
| 5263136 | DeAguiar | Nov 1993 | A |
| 5532716 | Sano | Jul 1996 | A |
| 5880739 | Collins | Mar 1999 | A |
| 6141446 | Boliek | Oct 2000 | A |
| 6208762 | Garland | Mar 2001 | B1 |
| 6307559 | Hancock | Oct 2001 | B1 |
| 6411302 | Chiraz | Jun 2002 | B1 |
| 6496980 | Tillman | Dec 2002 | B1 |
| 6636215 | Greene | Oct 2003 | B1 |
| 6741864 | Wilcock | May 2004 | B2 |
| 6924814 | Ephanov | Aug 2005 | B1 |
| 7426696 | Hwang | Sep 2008 | B1 |
| 7751596 | Rhoads | Jul 2010 | B2 |
| 7808514 | Yu | Oct 2010 | B2 |
| 8001143 | Gupta | Aug 2011 | B1 |
| 8234558 | Swift | Jul 2012 | B2 |
| 8577911 | Stepinski | Nov 2013 | B1 |
| 8655885 | Scott | Feb 2014 | B1 |
| 8713530 | Waite | Apr 2014 | B2 |
| 8867849 | Kirkham | Oct 2014 | B1 |
| 20020026507 | Sears | Feb 2002 | A1 |
| 20020107973 | Lennon | Aug 2002 | A1 |
| 20020152226 | Burnett | Oct 2002 | A1 |
| 20030018607 | Lennon | Jan 2003 | A1 |
| 20030128210 | Muffler | Jul 2003 | A1 |
| 20030147097 | Kotani | Aug 2003 | A1 |
| 20030167257 | deBonet | Sep 2003 | A1 |
| 20030177197 | deBonet | Sep 2003 | A1 |
| 20030188016 | Agarwalla | Oct 2003 | A1 |
| 20030188021 | Challenger | Oct 2003 | A1 |
| 20040172495 | Gut | Sep 2004 | A1 |
| 20040240746 | Aliaga | Dec 2004 | A1 |
| 20050050043 | Pyhalammi | Mar 2005 | A1 |
| 20050071781 | Atkins | Mar 2005 | A1 |
| 20050102473 | Sakata | May 2005 | A1 |
| 20050175251 | Taketa | Aug 2005 | A1 |
| 20050193083 | Han | Sep 2005 | A1 |
| 20050206658 | Fagans | Sep 2005 | A1 |
| 20060028659 | Nishikawa | Feb 2006 | A1 |
| 20060064630 | Balinsky | Mar 2006 | A1 |
| 20060109343 | Watanabe | May 2006 | A1 |
| 20070050467 | Borrett | Mar 2007 | A1 |
| 20070074110 | Miksovsky | Mar 2007 | A1 |
| 20070222865 | Levien | Sep 2007 | A1 |
| 20070223887 | Kanamori | Sep 2007 | A1 |
| 20070253479 | Mukherjee | Nov 2007 | A1 |
| 20080091526 | Shoemaker | Apr 2008 | A1 |
| 20080147974 | Madison | Jun 2008 | A1 |
| 20080162485 | Long | Jul 2008 | A1 |
| 20080181498 | Swenson | Jul 2008 | A1 |
| 20080292265 | Worthen | Nov 2008 | A1 |
| 20080313405 | Sakata | Dec 2008 | A1 |
| 20090083279 | Hasek | Mar 2009 | A1 |
| 20090244079 | Carson | Oct 2009 | A1 |
| 20090274366 | Iourcha | Nov 2009 | A1 |
| 20100046842 | Conwell | Feb 2010 | A1 |
| 20100095340 | Ei | Apr 2010 | A1 |
| 20100161582 | Spohr | Jun 2010 | A1 |
| 20100180234 | Szuszczewicz | Jul 2010 | A1 |
| 20100274674 | Roberts | Oct 2010 | A1 |
| 20100329588 | Cheatle | Dec 2010 | A1 |
| 20110026593 | New | Feb 2011 | A1 |
| 20110026835 | Ptucha | Feb 2011 | A1 |
| 20110064301 | Sun | Mar 2011 | A1 |
| 20110179075 | Kikuchi | Jul 2011 | A1 |
| 20110202847 | Dimitrov | Aug 2011 | A1 |
| 20110212717 | Rhoads | Sep 2011 | A1 |
| 20110314202 | Iyigun | Dec 2011 | A1 |
| 20120072656 | Archak | Mar 2012 | A1 |
| 20120084276 | Heimendinger | Apr 2012 | A1 |
| 20120084343 | Mir | Apr 2012 | A1 |
| 20120092997 | Mihaly | Apr 2012 | A1 |
| 20120150651 | Hoffberg | Jun 2012 | A1 |
| 20120159558 | Whyte | Jun 2012 | A1 |
| 20120173824 | Iyigun | Jul 2012 | A1 |
| 20120191716 | Omoigui | Jul 2012 | A1 |
| 20120206498 | Kai | Aug 2012 | A1 |
| 20120210068 | Joshi | Aug 2012 | A1 |
| 20120233221 | Katari | Sep 2012 | A1 |
| 20120303575 | Crolene | Nov 2012 | A1 |
| 20130007667 | Sauve | Jan 2013 | A1 |
| 20130018875 | Qiao | Jan 2013 | A1 |
| 20130028508 | Perronnin | Jan 2013 | A1 |
| 20130050254 | Tran | Feb 2013 | A1 |
| 20130055081 | Limbasia | Feb 2013 | A1 |
| 20130159328 | McConnell | Jun 2013 | A1 |
| 20130173853 | Ungureanu | Jul 2013 | A1 |
| 20130194438 | Sweet | Aug 2013 | A1 |
| 20130218721 | Borhan | Aug 2013 | A1 |
| 20130311329 | Knudson | Nov 2013 | A1 |
| 20140015873 | Kasai | Jan 2014 | A1 |
| 20140063031 | Brasnett | Mar 2014 | A1 |
| 20140111545 | Damola | Apr 2014 | A1 |
| 20140112394 | Sullivan | Apr 2014 | A1 |
| 20140125685 | Yeh | May 2014 | A1 |
| 20140126841 | Wang | May 2014 | A1 |
| 20140140589 | Klotzer | May 2014 | A1 |
| 20140189487 | Kwan | Jul 2014 | A1 |
| 20140222560 | Kota | Aug 2014 | A1 |
| 20140270407 | Balakrishnan | Sep 2014 | A1 |
| 20140344705 | Dimitrov | Nov 2014 | A1 |
| 20140365905 | Chedeau | Dec 2014 | A1 |
| 20150019545 | Chedeau | Jan 2015 | A1 |
| 20150135069 | Circlaeys | May 2015 | A1 |
| 20150135134 | Circlaeys | May 2015 | A1 |
| 20150189107 | Murata | Jul 2015 | A1 |
| 20150254806 | Circlaeys | Sep 2015 | A1 |
| 20160034559 | Feyereisl | Feb 2016 | A1 |
| Entry |
|---|
| Bechtolsheim et al., “High-Performance Raster Graphics for Microcomputer Systems,” 1980, Computer Systems Laboratory, Stanford University, ACM. |
| Guthe et al., “Advanced Techniques for High-Quality Multi-Resolution Volume Rendering,” 2004, Computers & Graphics 28, Elsevier. |
| Lindstrom et al., “On-the-Fly Decompression and Rendering of Multiresolution Terrain,” 2010, Association for Computing Machinery, ACM. |
| Rauschenbach et al., “Demand-Driven Image Transmission with Levels of Detail and Regions of Interest,” 1999, Computers & Graphics 23, Elsevier. |
| Number | Date | Country | |
|---|---|---|---|
| 20150135134 A1 | May 2015 | US |
