| US 7,586,500 B2 | ||
| Dynamic render algorithm selection | ||
| Marija Herceg, Lindfield (Australia); Julian Benjamin Kelsey, Newtown (Australia); and Michael Anthony Martin, Macquarie Park (Australia) | ||
| Assigned to Canon Kabushiki Kaisha, Tokyo (Japan) | ||
| Filed on Sep. 20, 2005, as Appl. No. 11/229,800. | ||
| Claims priority of application No. 2004905560 (AU), filed on Sep. 24, 2004. | ||
| Prior Publication US 2006/0066621 A1, Mar. 30, 2006 | ||
| Int. Cl. G09G 5/00 (2006.01); G06F 15/16 (2006.01) | ||
| U.S. Cl. 345—619 [345/502] | 29 Claims |

| 1. A method of rendering a sequence of graphical objects where two or more different renderers are available and one of the
renderers is designated as a currently-used renderer, said method comprising the steps of:
receiving a current object in the sequence of graphical objects;
adding the current object to a set of recently-received objects;
checking whether any one of a predetermined group of patterns of objects is present in the set, each pattern having an associated
indication of the suitability of the available renderers for the pattern, the suitability being dependent on a time taken
to render the pattern;
determining a suitable renderer from the available renderers using a pattern and associated indication identified in said
checking step;
switching from the currently-used renderer to the suitable renderer if the suitable renderer is different to the currently-used
renderer; and
rendering the current object using the determined renderer to at least one of a memory and an output device, wherein
the steps are performed on a computer.
|