Abstract: The method for displaying according to the present invention is used for displaying the displacement of an object (group) on the display of an electronic device. The method calculates an animation interval according to an amount of animation and an animation time; calculates an animation end time according to the animation interval and the order of animation to be executed; calculates a distribution ratio according to the animation end time and a distribution curve; calculates a displacement according to the distribution ratio and an animation execution distance; calculates an updated coordinate according to the displacement after the object (group) is moved; and replots the displaced object (group) in the display window of the display of the electronic device according to the updated coordinate. By calculating the displacement of each step of animation during the animation process, the present invention can present the process of object (group) movement.

Abstract: A chart generation unit generates an adjustment chart, and a projection unit projects the adjustment chart onto a circular cylinder. A parameter acquiring unit acquires 12 parameters in total, relating to the positions of four corners and middle points of a top side and a bottom side of a chart and lateral expansion of the chart, the chart being input by a user through manipulations of an operation unit. A transform function determination unit calculates, from the total of 12 parameters, an accurate transform function for projecting an image onto the circular cylinder. An image conversion unit applies geometric transformation to the image based on the calculated transform function.

Abstract: For ray tracing scenes composed of primitives, systems and methods-accelerate ray/primitive intersection identification by testing rays against elements of geometry acceleration data (GAD) in a parallelized intersection testing resource. Groups of rays can be described as shared attribute information and individual ray data for ray data transfer. A host hosts shading and/or management processes can control the testing resource and adapting the ray tracing. The GAD elements can be arranged in a graph, and rays collected into collections based on whether a ray intersects a given element. When a collection is deemed ready for further testing, it is tested for intersection with GAD elements connected, in the graph, to the given element. The graph can be hierarchical such that rays of a given collection are tested against children of the GAD element associated with the given collection.

Abstract: Spatial errors identifying differences between spatial co-ordinates of vertices of a mesh surface defined by mesh data and corresponding vertices in a mesh surface generated from an encoded representation of the mesh data are determined. Mesh data and texture co-ordinate data associating vertices of a mesh surface with locations in an image space of an image to be rendered onto the mesh surface are then processed to determine mapping between the co-ordinate space of the mesh data and the image space of an image to be rendered onto the mesh surface. Texture co-ordinate data for each vertex is then modified to associate a vertex with a location in image space which differs from the location identified by the unmodified texture co-ordinate data by an amount corresponding to the projection the spatial errors associated with the vertex to the image space.

Abstract: Techniques for forming a complex shelled object are described. The shelling procedure does not merely combine two shelled objects into in single shelled object, but also integrates the two object with one another without destroying the integrity of either of the shelled objects.

Abstract: A pre-culling method for the hidden surface removal of image objects is disclosed. The steps of the pre-culling method includes: transforming an eye coordinate from an eye space to a model space of a polygon when performing a rendering operation; and comparing a normal vector of the eye coordinate in the model space with the normal vector of each face of the polygon to determine whether each face of the polygon with respect to the eye coordinate is a front face or a back face.

Abstract: There are provided a method and an apparatus for generating a depth map of a stereoscopic image that are capable of representing the depth perception of an image more finely by considering not only vanishing points but also fine lines formed within an image. The method includes: generating multiple line segments by grouping multiple edge pixels within an input image based on an intensity gradient direction; merging the multiple line segments based on similarity and thereafter detecting at least one vanishing point in consideration of a result of the merging; and generating an energy depth function on which correlation between the line segments and the vanishing point is reflected and generating a depth map by decoding the energy depth function.

Abstract: Systems and methods for producing an acceleration structure provide for subdividing a 3-D scene into a plurality of volumetric portions, which have different sizes, each being addressable using a multipart address indicating a location and a relative size of each volumetric portion. A stream of primitives is processed by characterizing each according to one or more criteria, selecting a relative size of volumetric portions for use in bounding the primitive, and finding a set of volumetric portions of that relative size which bound the primitive. A primitive ID is stored in each location of a cache associated with each volumetric portion of the set of volumetric portions. A cache location is selected for eviction, responsive to each cache eviction decision made during the processing. An element of an acceleration structure according to the contents of the evicted cache location is generated, responsive to the evicted cache location.

Abstract: An image processor processes an assembly of data that defines an elementary image and a graphics object. The assembly of data includes composition data that defines a given appearance of the graphics object in an output image, where the graphics object overlays a portion of the elementary image. The image processor includes an occlusion analyzer for establishing an occlusion indication based on the composition data. The occlusion indication specifies an area in the elementary image that the graphics object will occlude in the output image, but which may be de-occluded in a stereoscopic rendering of the output image. An occlusion data generator composes an occlusion image based on the occlusion indication and the elementary image. The occlusion image represents a portion of the elementary image that corresponds with the area specified by the occlusion indication.

Abstract: A pixel processing system and method which permits rendering of complicated three dimensional images using a shallow graphics pipeline including reduced gate counts and low power operation. Pixel packet information includes pixel surface attribute values retrieved in a single unified data fetch stage. A determination is made if the pixel packet information contributes to an image display presentation (e.g., a depth comparison of Z values may be performed). The pixel packet information processing is handled in accordance with results of the determining. The pixel surface attribute values and pixel packet information are removed from further processing if the pixel surface attribute values are occluded. In one exemplary implementation, the pixel packet includes a plurality of rows and the handling is coordinated for the plurality of rows.

Abstract: A hair pipeline utilizes a surface definition module to define a surface and a control hair and a hair motion compositor module combines different control hair curve shapes associated with the control hair and the surface. In particular, the hair motion compositor module generates a static node defining a static control hair curve shape; generates an animation node defining an animation control hair curve shape; and combines the static control hair curve shape of the static node with the animation control hair curve hair shape of the animation node to produce a resultant control hair curve shape for the control hair.

Abstract: Embodiments of the present invention address deficiencies of the art with respect to modeling a process having a visual representation and provide a method, system and computer program product for importing a visual representation of a process for use in an application. In one embodiment, a computer-implemented visual process model importation method can include identifying an arrangement of one or more visual objects in a visual process model, selecting associations between the visual objects and corresponding representative elements for a target process model, mapping the visual objects in the source model into the selected corresponding representative elements for the target process model, and producing the target process model for the visual process model using the mapping. The method subsequently can include providing the target process model as input to an application such as a simulation engine, a workflow engine or a visual collaboration and documentation system.

Abstract: Methods and apparatus for hidden surface removal with soft occlusion. Soft occlusion methods are described that treat surfaces as having a degree of uncertainty in depth. The soft occlusion methods may, for example, be used to remove artifacts from rendered images due to nearly coplanar surfaces or to render novel effects such as soft intersections between objects including consistent shadows and other global illumination effects. The soft occlusion methods may compute the ‘expected’ or average image given depth probability density functions. This has the effect of visually blending together surfaces that are close together in depth, leading to soft intersections. The computation of soft occlusion may be achieved analytically, for certain probability density functions, or stochastically. The stochastic soft occlusion methods extend the approach to a probability distribution of models, which allows for the effects of shadows and other global illumination effects to be included.

Abstract: A method and a device for generating a multi-views three-dimensional (3D) stereoscopic image are based on displaying positions of target image elements of each view image of a multi-views 3D stereoscopic image in a 3D stereo display. Source image elements suitable to be displayed at each displaying position are obtained from a 2D-depth mixed image formed by combining a source 2D image and a corresponding depth map through an inverse view image searching manner, thereby generating a multi-views 3D stereoscopic image from the set target image elements for being displayed in the 3D stereo display.

Abstract: An apparatus and a method for generating 3-dimensional computer graphic images. The image is first sub-divided into a plurality of rectangular areas. A display list memory is loaded with object data for each rectangular area. The image and shading data for each picture element of each rectangular area are derived from the object data in the image synthesis processor and a texturizing and shading processor. A depth range generator derives a depth range for each rectangular area from the object data as the imaging and shading data is derived. This is compared with the depth of each new object to be provided to the image synthesis processor and the object may be prevented from being provided to the image synthesis processor independence on the result of the comparison.

Abstract: Methods and systems for 3D shape retrieval are described herein. An embodiment includes receiving a query 3D model, extracting a plurality of features of the query 3D model, comparing the features of the 3D query model against a plurality of features of one or more 3D models in a repository, calculating a similarity score based on the comparing step, ranking the 3D models based on the similarity score and returning one or more 3D models based on the ranking step. The embodiment further includes generating a representation of the query 3D model, calculating a correlation matching function between the representation of the query 3D model and representations of 3D models in the repository, determining a plurality of matching scores between the query 3D model and the 3D models in the repository for each rotational alignment of the 3D models and selecting the highest score from the plurality of matching scores based on the determining step.

Abstract: The present invention relates to an image generating apparatus for generating an image from a viewpoint specified by a user. According to the invention, the apparatus has a storage unit that stores a plurality of pre-images from viewpoints on predetermined lines and depth maps indicating a depth value of each pixel of a corresponding pre-image, and an image generating unit that generates a first image from a first viewpoint based on the pre-images and depth maps.

Abstract: A method, medium, and system rendering 3-dimensional (3D) graphic data. The method of rendering 3D graphic data may include grouping objects from among transparent objects included in graphic data, which overlap each other in a 3D space, and rendering the group and remaining objects excluding the grouped objects, in an order determined according to the distance between the group and a viewpoint and the distance between the remaining objects and the viewpoint. In particular, in the rendering of the group, the objects included in the group may be rendered in an order determined according to the distance between each unit element of each object belonging to the group and the viewpoint. By using such a method, medium, and system, rendering picture quality of a transparent object may be improved by avoiding rendering errors.

Abstract: Folding avoidance in skeletal stroke application is provided. In some embodiments, folding avoidance in skeletal stroke application includes identifying a destination path for a source artwork and a plurality of ribs extending perpendicularly from the destination path, in which the source artwork is mapped onto the destination path; determining a contiguous region along the destination path including a subset of ribs; in which each of the subset of ribs in the contiguous region crosses another rib in the contiguous region that is not necessarily an adjacent rib; and adjusting each of the subset of ribs in the contiguous region so that each of the ribs no longer crosses another rib in the contiguous region to provide a modified subset of ribs. Accordingly, the source artwork can then be adapted to fit along the destination path using the adjusted ribs.

Abstract: A multi-core processor system may support 3D image rendering on an autostereoscopic display. The 3D image rendering includes pre-processing of depth map and 3D image wrapping tasks. The pre-processing of depth map may include a foreground prior depth image smoothing technique, which may perform a depth gradient detection and a smoothing task. The depth gradient detection task may detect areas with large depth gradient and the smoothing task may transform the large depth gradient into a linearly changing shape using low-strength, low-pass filtering techniques. The 3D image wrapping may include vectorizing the code for 3D image wrapping of row pixels using an efficient single instruction multiple data (SIMD) technique. After vectorizing, an API such as OpenMP may be used to parallelize the 3D image wrapping procedure. The 3D image wrapping using OpenMP may be performed on rows of the 3D image and on images of the multiple view images.

Abstract: A method of determining implicit hidden features of phenomena, representable by a point distribution in a space, includes the following steps: defining a set of first parameters describing effects of a phenomenon such as an event or process; defining a n-dimensional space, wherein the first parameters are represented by entity points; determining, as a function of measured values of the first parameters, additional geometrical points in the n-dimensional space, which are expected to provide additional characteristic parameters describing the phenomenon or additional locations where the phenomenon will produce its effects; adding the additional parameters or points, in recurrent sequence, to the first parameters or points, to define at each iterative step a shorter minimum spanning tree than at the preceding step; and displaying or printing the n-dimensional space, wherein the additional characteristic parameters or points are shown together with the first parameters and the geometrical point.

Abstract: A method comprises receiving scene model data including a scene geometry model and a plurality of pixel data describing objects arranged in a scene. The method generates a primary ray based on a selected first pixel data. In the event the primary ray intersects an object in the scene, the method determines primary hit color data and generates a plurality of secondary rays. The method groups the secondary packets and arranges the packets in a queue based on the octant of each direction vector in the secondary ray packet. The method generates secondary color data based on the secondary ray packets in the queue and generates a pixel color based on the primary hit color data, and the secondary color data. The method generates an image based on the pixel color for the pixel data.

Abstract: The present invention discloses an image processing method for feature retention associated with averaging processes. The image processing method comprises: scaling and aligning a plurality of image data for acquiring feature information; determining a plurality of two-dimensional feature label points according to the feature information for generating at least one Bezier curve; utilizing the at least one Bezier curve to generate at least one Bezier tube and performing Bezier tube fitting for generating result of Bezier tube fitting; deforming the plurality of image data according to the Bezier tube or the result of Bezier tube fitting for generating a plurality of deformed image data; and averaging the plurality of deformed image data for generating feature-preserved average image data. The present invention also provides an image processing system, a computer readable storage medium, and a computer program product, for implementing the image processing method.

Abstract: A method, apparatus, and article of manufacture for automating a draw order of entities output from a computer. A drawing output from a computer (e.g., on a display device) is obtained by a drawing program and examined to identify two or more entities that overlap/intersect. The drawing program then automatically determines the drawing order for the two or more entities based on a set of one or more predefined rules.

Abstract: A method of determining features of events or processes having a dynamic evolution in space and/or time using measurements of parameters that calculate the most probable consequences of the event or process at a certain time includes: defining a set of measurable parameters describing the effects of the event or process, characteristic of the event or process, and measurable at a certain time; defining a n-dimensional space where the parameters describing the event or process are represented by entity points; determining, as a function of the measured values of the characteristic parameters describing the event or process at the certain time, a geometrical point in the n-dimensional space forces accumulate that are generated by the evolution of the event of process in time; and displaying or printing the n-dimensional space where the characteristic parameters are shown as entity points and as a geometrical point.

Abstract: A system automatically detects objects in an image and automatically displays a chosen object if the object is not currently visible in real time. An image data processing system automatically displays potentially hidden features in 3D (three dimensional) medical image data. A repository includes a 3D (three dimensional) image dataset representing an anatomical volume of interest. An image data processor processes the dataset retrieved from the repository by, (a) automatically detecting if a first object is obscured by a second object in the 3D image dataset, (b) automatically determining if the first object is visible by rotating the anatomical volume of interest and (c) rotating the anatomical volume of interest until the first object is visible in response to a command. A display processor initiates display of the rotated anatomical volume of interest.

Abstract: A three dimensional (3D) virtual world wormhole includes hosting a 3D virtual world, and creating a wormhole at a selected location in the 3D virtual world for automatic transport of an avatar from the selected location to a selected destination in the 3D virtual world. Policies may be defined for the wormhole where the wormhole operates in accordance with the defined policies. An avatar may be automatically transported from the location to any one of a plurality of destinations based on a current capacity of each of the plurality of destinations.

Abstract: A multi-view image may be generated by detecting discontinuities in a radiance function using multi-view silhouette edges. A multi-view silhouette edge is an edge of a triangle that intersects a back tracing plane and, in addition, the triangle faces backwards, as seen from the intersection point, and the edge is not further connected to any back facing triangles. Analytical visibility may be computed between shading points and a camera line and shared shading computations may be reused.

Abstract: An animation wireframe is modified with three-dimensional (3D) range and color data having a corresponding shape surface. The animation wireframe is vertically scaled based on distances between consecutive features within the 3D range and color data and corresponding distances within the generic animation wireframe. For each animation wireframe point, the location of the animation wireframe point is adjusted to coincide with a point on the shape surface. The shape surface point lies along a scaling line connecting the animation wireframe point, the shape surface point and an origin point. The scaling line is within a horizontal point.

Abstract: System and methods for rendering interior surfaces of a 3D volumetric object to be viewed from an external viewpoint. Image data sets being representative of a 3D volumetric object are processed to render image surfaces of the 3D volumetric object. The rendered image surfaces are transformed to allow viewing of internal surfaces of the 3D volumetric object from the perspective of the external viewpoint. The transformations involve inverting at least one of a normal vector, a winding order, and a z-order of a plurality of polygon members making up the rendered image surfaces. The transformations may further involve modifying a transparency parameter of a subset of the plurality of polygon members.

Abstract: A system and method for processing and rendering multiple layers of a two-dimensional scene. A system provides a mechanism to determine a number of scene surfaces and a mapping between scene layers and scene surfaces. The mechanisms may include combining and aggregating areas of layers to create one opaque surface, aggregating non-overlapping semi-transparent opaque areas of layers, or creating surfaces from overlapping semi-transparent surfaces. Moving objects are accommodated, so that layers below a moving object may be rendered properly in frames where the moving object is above the layer and frames where the moving object is not above the layer, for each pixel.

Abstract: A surface definition module of a hair/fur pipeline may be used to define a surface. An interpolation module may be used to interpolate at least one final hair on the surface based upon at least one control hair. An effects module including an effects pipeline may be utilized to apply a plurality of effects to the final hair in a user-defined order to generate a modified final hair that may be ultimately rendered.

Abstract: A surface definition module of a hair/fur pipeline may be used to define a surface and an optimization module may be used to determine whether a hair is to be rendered upon the surface. In particular, the optimization module may be used to: determine a size metric for the hair; apply a first density curve to the size metric determined for the hair to generate a density multiplier value; and based upon the density multiplier value, determine whether the hair should be rendered.

Abstract: As set forth herein, a computer-implemented method facilitates replacing text on cylindrical or curved surfaces in images. For instance, the user is first asked to perform a multi-click selection of a polygon to bound the text. A triangulation scheme is carried out to identify the pixels. Segmentation and erasing algorithms are then applied. The ellipses are estimated accurately through constrained least squares fitting. A 3D framework for rendering the text, including the central projection pinhole camera model and specification of the cylindrical object, is generated. These parameters are jointly estimated from the fitted ellipses as well as the two vertical edges of the cylinder. The personalized text is wrapped around the cylinder and subsequently rendered.

Abstract: Image completion using scene geometry is described, for example, to remove marks from digital photographs or complete regions which are blank due to editing. In an embodiment an image depicting, from a viewpoint, a scene of textured objects has regions to be completed. In an example, geometry of the scene is estimated from a depth map and the geometry used to warp the image so that at least some surfaces depicted in the image are fronto-parallel to the viewpoint. An image completion process is guided using distortion applied during the warping. For example, patches used to fill the regions are selected on the basis of distortion introduced by the warping. In examples where the scene comprises regions having only planar surfaces the warping process comprises rotating the image. Where the scene comprises non-planar surfaces, geodesic distances between image elements may be scaled to flatten the non-planar surfaces.

Abstract: A computer-implemented method includes initializing a driver associated with an input/output adapter in response to receiving an initialize driver request from a client application. The computer-implemented method includes initializing the input/output adapter to enable adapter capabilities of the input/output adapter to be determined. The computer-implemented method also includes determining the adapter capabilities of the input/output adapter. The computer-implemented method further includes determining slot capabilities of a slot associated with the input/output adapter. The computer-implemented method also includes setting configurable capabilities of the input/output adapter based on the adapter capabilities and the slot capabilities.

Abstract: The object is to generate an image in which an overlapped part of a tuned object and a non-tuned object having a contour line drawn therein is naturally represented. Only tuned objects among objects existing in a virtual three-dimensional space are perspective transformed, and image data and depth data of each tuned object is written into a process buffer 163a for each pixel. The contour of each tuned object is detected based on the depth data and normal line data acquired from the perspective transformation process, and contour line data is written into a process buffer 163c together with the depth data. When a non-tuned objects is perspective transformed, in a pixel in which a non-tuned objected is located on the front side of a tuned object, image data and depth data of the process buffer 163a are updated. The contour line data of the process buffer 163c is combined with the image data of the process buffer 163a, and the composed data is written into a frame buffer 112.

Abstract: In order to efficiently backface cull rendering primitives during computer graphics rendering, it is important to be sure that the rendering primitives to be culled are guaranteed to be backfacing even if the primitives are moving or are undergoing defocus blur. Therefore, we derive conservative tests that determine if a moving and defocused triangle is backfacing over an entire time interval and over the area of a lens. In addition, we present tests for the special cases of only motion blur and only depth of field.

Abstract: A computer-implemented method and system reduces size of a data structure of a computer-aided design (CAD) model. Given a CAD model formed of a plurality of modeling elements, the method and system provide one or more geometric entities defining modeling elements of the CAD model. The geometric entities have corresponding graphical entities configured to display the CAD model. For each modeling element, the method and system determine visibility of the modeling element and produce a reduced data structure by storing in the structure graphic data representing the graphical entities and geometric data of only certain ones of the geometric entities determined as a function of visibility of the corresponding modeling elements.

Abstract: An image processing apparatus able to continuously generate region data, able to eliminate wasteful processing due to invalid regions, and able to efficiently draw an image, is provided with a triangle digital differential analyzer (DDA) circuit for generating region data increased by at least one unit square region worth of data based on set-up data including a change data input from a DDA set-up circuit in a case where at least one pixel is located inside a triangle in a unit square region including a plurality of pixels, storing the region data, further dividing the stored region data into usual region data equivalent to the unit square regions, and outputting the same as DDA data to a texture engine circuit, and a method of the same.

Abstract: A system, method, and computer program product are provided for efficiently ray tracing micropolygon or other highly complex geometry. In operation, a first hierarchy of a plurality of objects is established. Additionally, rays are traced using the first hierarchy to efficiently identify which of the plurality of objects are potentially intersected. Furthermore, at least one of the potentially intersected objects are decomposed, on-demand, into a set of subobjects, each set of subobjects corresponding to one of the at least one of the potentially intersected objects. Still yet, a second hierarchy is established for at least one of the set of subobjects, the second hierarchy being determined by a connectivity of subobjects in an associated set of subobjects in order to accelerate ray tracing.

Abstract: A method for performing a ray-box intersection test includes forming a span extending between a first plane-ray intersection point and a second plane-ray intersection point, and increasing the span by relocating to a new position at least one of the first and second plane-ray intersection points. A box intersection span is constructed using the increased span, and the box intersection span, which corresponds to a node in a hierarchical acceleration structure, is tested for intersection with the ray.

Abstract: A 3D reconstruction technique using integral imaging, which does not require computing point correspondences. The technique has been demonstrated that it can effectively estimate the surface of an object, and reconstruct the surfaces of partially occluded objects. Reconstruction can be performed from either an array of imaging sensors, or a single moving imaging sensor with known positions. The technique relies on the concept that each view is allowed to vote on the contents of the scene via ray tracing. Various sharpness metrics are utilized for estimating the locations of visible surfaces in the views, and reconstruction is posed as an optimization problem.

Abstract: A method for mapping a body organ, including receiving a three-dimensional (3D) map of the body organ together with items of auxiliary information having respective location coordinates in a frame of reference of the 3D map and apportioning the items into a plurality of sub-groups. The method further includes assigning to a selected sub-group a visibility parameter indicative of a relative visibility of the selected sub-group in relation to the map and to other sub-groups. The method also includes displaying the 3D map of the body organ in a selected orientation while selectively superimposing on the 3D map one or more of the items in the selected sub-group responsively to the orientation, the respective location coordinates of the items, and the assigned visibility parameter.

Abstract: The subject matter discloses a method of determining whether a point in a computerized image is visible from a viewpoint; said image is represented as a point cloud, the method comprising: performing inversion on a the vicinity of the point thus creating a computerized inversed object, each point in the vicinity of the point is related to a parallel point in the computerized inversed object and obtaining a convex hull of the inversed object; the point is likely to be visible from the viewpoint in case it belongs to the point set composing the convex hull. The method is also useful for shadow casting and for determining the location of an image-capturing device within a volume.

Abstract: A graphic system having a central processing unit; a system memory coupled to the central processing unit; a display unit provided with a corresponding screen; a graphic module coupled to and controlled by the central processing unit to render an image on the screen of the display unit, the graphic module including a fragment graphic module having a depth test buffer for storing a current depth value; a depth test stage coupled to the depth test buffer for comparing the current depth value with a depth coordinate associated with an incoming fragment and defining a resulting fragment; a test stage for testing the resulting fragment and defining a retained fragment; a buffer writing stage operatively associated with the test stage for receiving the retained fragment, the buffer writing stage coupled to the depth test buffer for updating the current depth value with a depth value of the retained fragment.

Abstract: A method for automatic virtual endoscopy navigation, including: (a) using a fisheye camera to generate an endoscopic image and a depth image from a current position of the camera in lumen computed tomographic (CT) data; (b) segmenting a first region and a second region from the depth image, wherein the first region identifies a view direction of the camera and the second region is an area through which the camera can be moved without touching an inner surface of the lumen; (c) moving the camera from the current position, while pointing the camera in the view direction, to a next position in the second region; and (d) repeating steps (a-c) in sequence using the next position in step (c) as the current position in step (a).

Abstract: A method for rendering a deformable object. The method includes: obtaining a 3D volumetric voxel dataset of a region, such region having therein an object to be rendered; building a tree hierarchical structure for the obtained volumetric dataset, such tree structure blocks as the nodes of a primary tree hierarchy and bricks being those blocks stored as textures in a video memory; augmenting the primary tree hierarchical structure with maximum and minimum values of the data contained within a block; creating a neighborhood tree hierarchy having for each leaf block of the neighborhood tree hierarchy a reference to the neighboring leaf blocks in the neighborhood tree hierarchy as well as references to neighboring bricks in the neighborhood tree hierarchy; updating the information about minimum and maximum in the primary tree hierarchy by saving for each block the minimum and maximum of the neighboring blocks; and rendering the leaf blocks in visibility order.

Abstract: In general, the invention relates to a method for performing polygon dissections in a geographic information system. The method includes receiving a notification of a spatial update for a number of polygons, where each of the number of polygons overlaps at least one of a number of previously dissected polygons, determining that a dissection is required based on the spatial update, and obtaining an updated polygon, associated with the spatial update, and related polygons of the number of polygons, where each of the related polygons overlaps the updated polygon. The method further includes dissecting the updated polygon and the related polygons to obtain a number of dissected polygons and replacing at least one of the number of previously dissected polygons with the number of dissected polygons, where the at least one of the number of previously dissected polygons is invalid based on the spatial update.

Abstract: An input processing device comprises a display screen and a pointing device for inputting corresponding 2-dimensional coordinates on the display screen. A 3-dimensional space is displayed on the display screen and the 2-dimensional coordinates inputted from the pointing device are detected. Next, shift amounts, per unit of time, of the detected 2-dimensional coordinates are calculated based on a predetermined calculation start condition. And the calculated shift amounts are converted to 3-dimensional coordinate shift amounts in the 3-dimensional space.