Abstract: A method and system for enabling a user to import a user-defined graphics edit into at least one template, the method including the steps of selecting, by the user, at least one first editable object, editing, by the user, at least part of the at least one first editable object, thereby producing a user-defined graphics edit, saving the user-defined graphics edit, selecting, by the user, a template containing at least one second editable object; and applying at least part of the user-defined graphics edit to at least part of the at least one second editable object within the template.

Abstract: A system and method for processing a graphics primitive for display in a display area defined by a scissoring window. The graphics primitive is part of an object in view space which also includes a near and a far plane and possibly one or more user-defined clipping planes. These planes may affect the portion of the graphics primitive to be rendered in the display area. The graphics primitive is enclosed by a bounding box, which is then reduced, if possible, based on the Znear clipping plane intersecting the graphics primitive. The reduced bounding box is then subjected to the scissoring window if a portion of the bounding box lies outside the window. The final bounding box determines how much of the graphics primitive should be rendered in the display area. This reduces the amount of rendering that is required of the graphics system, and increases the performance of the system.

Abstract: A method is disclosed for culling an object database in a graphics processing system. In one embodiment, the method comprises encoding per-object parameters and culling parameters. The per-object parameters are encoded in texture format thereby creating at least one per-object texture containing the encoded per-object parameters. Next, a fragment program used in a fragment processor of the GPU is optionally updated. The updated fragment program embodies a culling operation. A polygon is then rendered, wherein the rendering step includes per-fragment operations. During the per-fragment operations, the updated fragment program is executed. The culling operation embodied therein (i) accesses the culling parameter, (ii) samples the per-object textures, and (iii) produces cull results for a set of database objects. In this fashion, the fragment processor in the GPU is leveraged to perform computationally intensive culling operations.

Abstract: By selecting a template, a crop boundary (98a) is displayed on an image on a screen. The crop boundary has a corresponding shape to that of a frame of the selected template, and is variable in size while keeping the same shape and being centered on a reference point (98e). Upper and lower horizontal lines (98b, 98c) are also displayed inside the crop boundary to define an internal zone (98d), and the center point on the upper horizontal line is defined as the reference point. By placing the reference point on the top of the head of a human subject contained in the displayed image and then moving the lower horizontal line to align it with the chin, the internal zone is adjusted to the head of the human subject. In cooperation with the movement of the lower reference line, the crop boundary is automatically enlarged or reduced so as to keep the internal zone in a predetermined proportion and position relative to the crop boundary.

Abstract: Disclosed is a method for generating progressive solid models based on a cellular topology. A cellular model generating section 10, if a specific feature-based model is inputted, performs a mapping operation on the input feature-based model with reference to an internal feature library, thereby generating cellular topology models based on feature models. A progressive model initializing section 20 composes cells by use of volume attributes of the cells according to a relationship between the input feature-based model and the cells obtained from the cellular topology model to generate an initial cellular model SM0 which is simplified to generate a progressive solid model, and then searches n delta volumes DVi transiting the initial cellular topology model SM0 by composing and decomposing the cells so as to progressively complement the difference between the initial cellular topology model SM0 and the input feature-based model.

Abstract: The present invention provides a technology that enables related portions of multiple pages of images to be displayed simultaneously. A projection display apparatus comprises: an image extraction section that extracts at least a portion of given first image data as an extraction image; an extraction image memory for storing extraction image data representing the extraction image; an image overlay section that generates overlaid image data by superimposing the extraction image on an original image represented by given second image data; a light modulation unit that is driven responsive to the overlaid image data pixel by pixel; and an optical system for projecting onto the screen the overlaid image obtained by the light modulation unit. A projection display apparatus can display related portions of multiple pages of images simultaneously.

Abstract: A method and apparatus for processing a primitive (for potential display as a part of a graphical image on a display device) cause attribute data to be received by a graphics processor as a function of whether the primitive is capable of being viewable in the graphical image on the display device. Before taking that action, however, the method and apparatus assemble the primitive as a function of its positional data, and then determine if the primitive is capable of being viewable in the graphical image on the display device.

Abstract: A geometric model comparator is provided, which includes processing circuitry, memory, and comparison circuitry. The processing circuitry is configured to generate a target model from a source model. The memory is configured to store the source model and the target model. The comparison circuitry is configured to identify selected points from the source model, create corresponding selected points in a target model, and compare the selected points from the source model with the selected points from the target model to identify one or more selected points from the target model that fall outside of a predetermined tolerance range with the respective one or more points from the source model. A method is also provided.

Abstract: A collision detection method for polygonal objects using OpenGL is provided, comprising dividing a surface of each object into a set of axis aligned bounding boxes (AABB) to build an AABB tree, selecting an object among the plurality of polygonal objects as a reference object, defining a global bounding box of the reference object, detecting first bounding boxes of the plurality of polygonal objects that intersect the global bounding box of the reference object, and determining intersections for each polygon of the reference object with all polygons of the plurality of polygonal objects.

Abstract: A method and apparatus for visiting all productive stamp positions for a two-dimensional convex polygonal object. The object is visited with a stamp that has a stamp rectangle, and one or more discrete sample points. A productive location is one for which the object contains at least one of the stamp's sample points when the stamp is placed at that location. An unproductive location is one for which the object contains none of the stamp's sample points when the stamp is placed at that location. Stamp locations are discrete points that are separated vertically by the stamp rectangle's height, and horizontally by the stamp rectangle's width. The stamp may move to a nearby position, or to a previously saved position, as it traverses the object. The stamp moves in such a way as to visit all productive locations for an object while avoiding most of the unproductive locations.

Abstract: A system for performing visible object determination. Visualization software executing on one or more processors searches a cone tree with respect to a hull tree. Both trees respect the same group of transformations. Thus, the cone tree as stored in memory need not store all branches down to ultimate resolution. For example, the cone tree may store a selected cone and all its subcones down to the ultimate resolution, while subcones of other cones at the same level as the selected cone may not be represented in the stored cone tree. When the visualization software encounters a nonstored cone and a given hull H in its search procedure, the visualization software may apply an appropriate one of the group transformations to the given hull, and search the tranformed hull with respect to the selected cone (or a subcone of the selected cone).

Abstract: A computing device comprises a processor and a memory. The processor is operable to select a plurality of related graphics elements for extraction from an electronic document. The selection of the plurality of related graphics elements includes creating a graphics region in the electronic document, and the graphics region includes an expandable area in the document encompassing the plurality of related graphics elements. The memory stores the electronic document from which the plurality of related graphics elements are extracted.

Abstract: In a specific embodiment of the present invention, a graphics device generates digital output data in response to a known input data. The resulting digital output data has an expected circular redundancy check (CRC) value. The generated digital output data is provided to a digital graphics output port associated with the graphics controller, which is thereby transmitted to a test apparatus over a digital graphics cable. The test apparatus performs an analysis on the received digital graphics data. The analysis results are transmitted back to the graphics device over a serial link of the digital display cable. The graphics device receives the transmitted analysis data, which is subsequently used to determine if the graphics device is operating properly. This determination may be made the graphics device, or by a host system for further analysis.

Abstract: A computer-implemented drawing tool provides a number of different measurement functions in the context of reviewing and marking up drawings. Drawings may be annotated by the drawing tool using a Measure object, wherein the Measure object is placed proximate to one of the other objects in the drawing and then queries the object for one or more measurement values stored therein. These measurement values may comprise a distance, a multi-distance (e.g., path of travel), or area. The Measure object displays the measurement values queried from the object when it is displayed on a monitor of a computer by the drawing tool.

Abstract: Binning polygons in a three-dimensional graphics system includes constructing a first bounding box around a first-level polygon, the first bounding box including tiles that contain the first-level polygon, subdividing the first-level polygon into second-level polygons if the first bounding box exceeds a predetermined size, and constructing bounding boxes around each second-level polygon. The second bounding box includes fewer tiles than the first bounding box.

Abstract: A method and apparatus for processing graphics primitives that includes a trivial discard guard band. Such a trivial discard guard band is used for comparison operations with the vertices of graphics primitives to determine whether the graphics primitives can be trivially discarded such that no further processing of the primitives is performed. The trivial discard guard band may be based on the specific dimensions of primitives such as one-half of the width of the line primitives or the radial dimension of point primitives such that the rasterization area of such primitives is taken into account when trivial discard decisions are performed.

Abstract: A computerized method and computer readable medium for adjusting a digital image obtained from scanning a document. An application processes the digital image to discern a border portion from an image portion. The application processes the digital image to determine whether an image portion of the digital image corresponds to a target orientation. If the image portion does not correspond to a target orientation, the application adjusts the image portion to correspond to the target orientation. The application further crops the adjusted image to entirely eliminate the border portion of that image.

Abstract: A system, method and computer program product are provided for accelerating graphics processing utilizing a graphics application program interface. Initially, graphics data is processed in a graphics system with components including a central processing unit, a geometry processing module, and a pixel processing module. In use, the graphics application program interface accepts one or more first occlusion queries followed by a second occlusion query. The second occlusion query is at least partially processed by the graphics system before a final result of any one of the first occlusion queries is computed by the graphics system.

Abstract: There is disclosed an image synthesizing apparatus for producing a synthetic image that consists of a background image and at least a main image superimposed on the back ground image. An input image is displayed in a main display area of a control screen, whereas an outer frame and at least an inner frame are displayed in a sub display area of the control screen in accordance with a selected template. First a crop boundary having a similar shape to the outer frame is displayed on the image in the main display section. The crop boundary is movable on the image and changeable in size. After pasting a cropped area of the image as the background image in the outer frame, a second image is selected and displayed in the main display area. Then, a crop boundary having a similar shape to the inner frame is displayed on the second image, so a cropped area of the second image is pasted in the inner frame, to be printed as the main image.

Abstract: An index advisor specifies an optimal index configuration for use in performing workloads against a database managed by a database management system. If the database and database management system are remotely located from the index advisor, then the index advisor invokes a stored procedure in the database management system in order to obtain information for the optimal index configuration.

Abstract: A method and apparatus for processing a primitive for potential display on a display device (having a plurality of pixels) determines if the primitive intersects at least a predetermined number of pixel fragments on the display device. The predetermined number is no less than one. The method and apparatus then cull the primitive as a function of whether the primitive intersects at least the predetermined number of pixel fragments. If it is culled, the primitive is not raster processed (i.e., not subjected to raster processing, whether or not complete).

Abstract: Embodiments of the present invention efficiently support rendering of high resolution images under zone rendering. In particular, a bin array rectangle and binner clipping rectangle for determining primitive-zone intersections. Both of these rectangles are defined by graphics device state variables containing the screen-space location of the rectangle corners. In particular, the binner clipping rectangle is used to define the visible region in screen coordinates. Objects completely outside the binner clipping rectangle in one or more directions will be discarded. Objects that cannot be trivially rejected are subjected to bin determination. The bin array rectangle handles color buffer resolutions larger than could otherwise be accommodated by the optimally-renderer image limits.

Abstract: An image processing apparatus for extracting a desired target object from an image which includes the target object, includes a target object identification part identifying the target object from the image, a rectangle extracting part extracting a rectangle which includes the target object identified by said target object identification part, and an image cutting part cutting out a rectangular image including the target object from the rectangle extracted from the image by said rectangle extracting part.

Abstract: This invention relates to a method used to zoom in selective plot area in display, which method is inserted an inserted box into the display screen of a display device, and said inserted box can be removed to said display screen anywhere and the plot covered within said inserted box can be zoomed in according to predetermined zoom rate or zoom rate immediately set. Said method of this invention is applicable to a plotting calculator so that by way of keying in the keys of said plotting calculator the user can precisely and quickly select the plot area going to zoom in display.

Abstract: A system and method for processing a graphics primitive for display in a display area defined by a scissoring window. The graphics primitive is part of an object in view space which also includes a near and a far plane and possibly one or more user-defined clipping planes. These planes may affect the portion of the graphics primitive to be rendered in the display area. The graphics primitive is enclosed by a bounding box, which is then reduced, if possible, based on the Znear clipping plane intersecting the graphics primitive. The reduced bounding box is then subjected to the scissoring window if a portion of the bounding box lies outside the window. The final bounding box determines how much of the graphics primitive should be rendered in the display area. This reduces the amount of rendering that is required of the graphics system, and increases the performance of the system.

Abstract: The embodiments of the present invention are a method and apparatus to perform anti-aliasing using multi-sampling on a non-power-of-two pixel grid. Using the present invention with 6 sample multisampling gives the same visual antialiasing quality as 8 samples using a prior art technique but uses less memory. A non-power-of-two equally spaced sample from a conventional grid of size N×N, where N is 12 can be chosen using the present invention. A scan conversion to determine the set of pixels covered by a polygon is performed in two parts. According to one embodiment, the present invention can multiply and divide by “N” in order to multisample an image using samples per pixel chosen from a N×N sub-sample grid, where “N” is not necessarily a power of 2. The present invention performs the divide by “N” step, where the step is achieved using a quick divide by 3 or 12 technique.

Abstract: The method of global rendering allows a three dimensional scene to be rendered accurately and viewed correctly from multiple angles and directions at once. The method includes the steps of placing an object representing a multidimensional texture map into a database, replacing the object with a bounding geometry that completely encloses the object, sampling the bounding geometry with a sample of interest, extracting pixel information from the sample of the bounding geometry, and displaying the rendered object using the extracted pixel information.

Abstract: A method and apparatus for creating a series of images is disclosed. The method manages secondary dependencies of regions in a more efficient manner than the prior art. The present invention creates contents labels that represent either leaf node regions or the composition of two other contents labels, manages the reference counting of contents labels and provides a means for determining if there exists a contents label which represents the composition of two other contents labels. The present invention damages contents labels by preferably adding entries to a damage hash table. The present invention utilizes secondary dependency “Directed Acyclic Graphs” (herein referred to as “Dags”) (700) which are stored in every binary node and define the secondary dependency relationship between the contents label created in that node.

Abstract: A computer-implemented system performs a conformal warp operation using a unique warping function to map a first area to a second area. The first area is defined by a first enclosing contour and the second area is defined by a second enclosing contour. The system defines the first enclosing contour; modifies the first enclosing contour into the second enclosing contour; generates an analytic function to conformally warp the first area into the second area; and performs the conformal warp using the analytic function.

Abstract: A system and method for determining graphical object visibility by utilizing ancillary geometry. When comparing visibility cones with bounding hulls of scene graph hierarchy leaf nodes, ancillary geometry may be used in place of the bounding hulls and the leaf node's actual geometry. The ancillary geometry may be created through a manual process, or by an automated decimation process. The ancillary geometry may be a simplistic analytic surface (e.g., a sphere or a cylinder), a NURB surface, a collection of polygons, or a combination of surfaces and polygons.

Abstract: A method and apparatus for visiting all stamps that are relevant to a two-dimensional convex polygonal object. The object is visited with a rectangular stamp, which contains one or more discrete sample points. A relevant location is one for which the object contains at least one of the stamp's sample points when the stamp is placed at that location. Stamp locations are discrete points that are separated vertically by the stamp's height, and horizontally by the stamp's width. The stamp may move to a nearby position, or to a previously saved position, as it traverses the object. The plane in which the object lies is partitioned into rectangular tiles, which are at least as wide and high as the stamp. The invention visits stamp locations in an order that respects tile boundaries—that is, it visits all locations within one tile before visiting any locations within another tile.

Abstract: Embodiments of the present invention provide a method and apparatus for determining the zones that a polygon overlaps to minimize the bins that are updated during binning and reduce the number of polygons to be set up in the render phase. The polygons supported include, but are not limited to, points, lines, triangles and rectangles. Each zone has associated with it a batch buffer to which data is written back for the polygons that overlap that zone. This data includes the setting up of state and the indices for those polygons. Since the zones that a polygon overlaps is precisely determined, the data written back is minimized and the polygons to be set up during the render phase is optimally reduced.

Abstract: A process for preventing spurious intersections in a polygon due to rounding by using proximity-based rounding. A vertex of a polygon is identified which is located within a unit integer box through which an edge of the polygon passes that does not have the vertex as an endpoint. The identified vertex is embedded on the edge which passes through the same unit integer box. Then the vertices are rounded to integer coordinates. In one embodiment of the invention, the proximity-based rounding is performed on an output polygon from a Boolean operation in a design rule checking algorithm.

Abstract: A computer graphics accelerator apparatus and method determines whether a pixel at predetermined pixel co-ordinates in an area being rasterized is within a triangle defining a sub-area of the area. The coordinate system in relation to which the triangle is defined is translated such that the pixel co-ordinates are disposed at the origin of the coordinate system. Determinants of matrices based on at least two of the coordinate values of at least two of the vertices are calculated and their signs compared. Based on this comparison a determination as to pixel location with respect to the triangle may be made.

Abstract: A method and apparatus are provided relationally modeling a trimmed NURBS surface. The relational model may be formed of a NURBS surface object, a trimming curve object that depends on the NURBS surface object, and a third object which depends on both the NURBS surface object and trimming curve object. Modeling a NURBS surface and a trimmed NURBS surface as separate objects eliminates the issue of circular definitions discussed earlier with respect to relational modeling of trimmed NURBS surfaces.

Abstract: A solution is provided to reshape irregularly-shaped computer graphics images in order to reduce the number of rectangles generated for transmission. It may be used any time it is useful to compress a set of digital image data from an irregularly-shaped region of pixels. A post-shaping process may be utilized wherein rectangles in a destination window are examined and any touching (or possibly nearby) rectangles are merged into a single rectangle. Alternatively, a pre-shaping process may be utilized wherein images drawn with a single command are merged into a single rectangle. Each of these processes has advantages and disadvantages which may make one or the other preferable, depending upon the circumstances. Additionally, both processes may be used together if desired.

Abstract: A computing device comprises a processor and a memory. The processor operable to select a plurality of related graphics elements for extraction from an electronic document. The selection of the plurality of related graphics elements includes creating a graphics region in the electronic document, and the graphics region includes an expandable area in the document encompassing the plurality of related graphics elements. The memory stores the electronic document from which the plurality of related graphics elements are extracted.

Abstract: The present invention relates to a method and apparatus for obtaining a bounding sphere for the ellipsoid that results when an affine transformation matrix transforms a bounding volume. The present invention accomplishes this by using Gershgorin intervals to obtain a new radius for the bounding volume. The invention operates on a scene graph, which is comprised of a number of nodes arranged in a hierarchical organization. At least one of these nodes is an affine transformation matrix, which is used for operations such as rotations, scaling, and translations. Associated with the transformation matrix is a bounding sphere. The present invention calculates the radius of a new bounding sphere that encircles the ellipsoid formed when the affine matrix transforms the old bounding volume. The use of Gershgorin intervals is fast and yields accurate results.

Abstract: An interference removal system is provided for determining the possible removal of a component from an assembly where the component to be removed is in an environment including other components that interfere with its removal. The system uses dimensional data to define the removal component and its environment including other components. A boundary space is established around the removal component where the boundary space includes another component interfering with removal of the removal component. The removal component then randomly moves within the boundary space until it is free from interference with its environment. The system is intended to assist in automated path planning by removing initial interference conditions.

Abstract: A method, apparatus, and system provides an integrated viewer with one user interface and one API provides the ability to view, program, redline, and measure DWF and DWG files. In accordance with one or more such embodiments, the present invention provides an intelligent drawing redlining tool for easily and quickly drawing or annotating a drawing. For example, using the tool, a user can click the mouse over the first point of an arc segment. A bulge spacing function may then be utilized to define the length of an arc (also referred to as bulge spacing). In accordance with one or more embodiments of the invention, the bulge spacing function comprises holding down an arc defining key such as the <SHIFT>key while the second point of the arc segment is selected. Thereafter, the bulge spacing of the first arc segment (the distance of the arc between the first and second points) is utilized for the remaining arc segments of the enclosed polyline/path.

Abstract: A method sculpts an object expressed as a model. A hierarchical distance field is generated from the model according to generation parameters. The hierarchical distance field is edited according to editing parameters, and the hierarchical distance field is rendered while editing. To generate the hierarchical distance field, the object distance field is enclosed with an object bounding box. The enclosed object distance field is partitioned into a plurality of cells. Each cell has a size corresponding to detail of the object distance field and a location with respect to the object bounding box. A set of values of the enclosed object distance field is sampled for each cell. A method for reconstructing the portion of the distance field enclosed by the cell is specified for each cell.

Abstract: A method for determining a position at which a polygon to be clipped is situated with respect to a clipping plane to perform clipping processing, includes the steps of selecting a bounding volume sufficiently enclosing the polygon, and judging a position at which the bounding volume is situated with respect to the clipping plane to be the position at which the polygon is situated.

Abstract: Embodiments of the invention obtain dual points by examining the intersection between each line and a perpendicular projection from the line to a point of origin. The dual points are sorted in accordance with a modified quadtree or octtree. The drawing is recursively broken up into equal subdivisions until the maximum allowed number of points for a subdivision has been reached or until the size of the subdivision is less than a tolerance value. Once the number of points in a subdivision is less than the maximum allowed number of points, the points are individually compared to each other. If the subdivision is less than a tolerance value, the subdivision is small enough such that all of the lines within the subdivision are coincident. If the number of points is greater than the maximum allowed number of points and the subdivision is larger than the tolerance, the area is recursively subdivided.

Abstract: A computer-implemented system performs a conformal warp operation using a unique warping function to map a first area to a second area. The first area is defined by a first enclosing contour and the second area is defined by a second enclosing contour. The system defines the first enclosing contour; modifies the first enclosing contour into the second enclosing contour; generates an analytic function to conformally warp the first area into the second area; and performs the conformal warp using the analytic function.

Abstract: The present invention provides a computer system (2) for determining regions of interest in a static digital image for display on a display device, the system comprising a processor (4) configured to compare parts of an image (20, 50) with characteristics at least one region of interest specified by a user (19) and to determine at least one region of interest in an image (20, 50) based at least in part on the degree of similarity between parts of the image and the at least one user-specified region of interest in which the at least one user-specified region of interest is specified from the same image as the image in relation to which the determination is made.

Abstract: Disclosed are a method of and an apparatus for extracting a dotted line from an binary image of a document, and a storage medium thereof. The isolated points are extracted from the binary image. The isolated points configuring a candidate of the dotted line are extracted based on a positional relationship between the extracted isolated points. A validity of the isolated points configuring the candidate of the dotted line is checked. The dotted line from a positional relationship between groups of the extracted isolated points of the candidate of the dotted line. The dotted line can be thereby precisely extracted even if some isolated points are lost due to an. under-density of the image etc.

Abstract: A method and apparatus for optimizing system performance by dynamically determining an intersection method on a demand-based zone renderer. Embodiments of the present invention determine not only the objects to bin, but also the intersection method to use to do so. The embodiment automatically determines, based upon the calculation, which intersection method would be more appropriate for assigning a particular object, such as a graphical primitive, to zones. In particular, the ratio of the primitive pixel area to the bounding box pixel area and a predefined threshold are used to select an appropriate intersection method for binning.

Abstract: A method and apparatus for determining attributes of an object-element using barycentric coordinates includes processing that begins by obtaining a barycentric coordinate for a vertex of an object-element. The object-element is clipped with respect to a clipping plane where a first component of the barycentric coordinate corresponds to a first original vertex of the object-element, a second component of the barycentric coordinate corresponds to a second original vertex of the object-element and a third component of the barycentric coordinate corresponds to a third vertex of the object-element. The processing continues by, for each non-zero component of the barycentric coordinate, determining whether at least one attribute of the corresponding vertex of the non-component is substantially similar. The processing continues by setting the at least one corresponding attribute of the vertex to substantially equal the attribute for the other vertex when the at least one attribute is substantially similar.

Abstract: A method and apparatus for clipping an object element include processing that begins by ascribing barycentric coordinates to each original vertices of an object-element wherein each barycentric coordinate is a weighting factor with respect to a corresponding original vertex. The processing continues by obtaining clipping distances for each original vertex with respect to a clipping plane. For a new vertex of an object-element that represents an intersection of an edge of the object-element with the clipping plane, the process continues by determining a barycentric coordinate for the new vertex. The determination of the new vertex is based on the barycentric coordinates of the original vertices defining the edge and the clipping distances. Having determined the barycentric coordinates for the new vertices corresponding to a clipping plane, the process is repeated for each of a plurality of other clipping planes that intersect the object-element.

Abstract: A programmable visualization apparatus processes graphical data. The apparatus includes a central processing unit for executing a visualization application and a scheduler. A third level of memory is connected to the central processing unit. The third level of memory stores the graphical data. The graphical data is partitioned into a plurality of blocks. A second level of memory is connected to the central processing unit by a system bus. The second level of memory stores a sub-set of the plurality of blocks. A first level of memory is connected to the second level of memory by a memory bus. The scheduler stores an ordered list of blocks in the first level memory. A processor element is connected to the first level of memory by a processor bus. A dispatcher is connected to the first, the second, and the third memories and the processor element. The dispatcher transfers blocks from the third, to the second, and from the second to the third level memories according to the order of the list of blocks.