Abstract: A system and method for performing visible object determination based upon a dual search of a cone hierarchy and a bound hierarchy performed by multiple processors. Each processor is configured to read a (global and/or local) problem queue to access a bound-cone pair. The bound-cone pair points to a bound in the bound hierarchy and a cone in the cone hierarchy. The processor computes a bound-cone distance between the bound and the cone, and compares the bound-cone distance to a visibility distance associated with the cone. If the bound-cone distance is smaller than the visibility distance, the processor may write two or more refined bound-cone pairs corresponding to a refinement of the original pair to the global or local problem queue. When the processor detects a leaf bound and a leaf cone, it updates a nearest object pointer and the visibility distance associated with the leaf cone.

Abstract: A non-reproducible three-dimensional model is shown on a first window and a third-dimensional model which has a part to be deleted or modified is shown on a second window. A difference between shape data and reference data of a part which is non-reproducible among the components of the immediately preceding three-dimensional model and shape data and reference data of the part in data about the non-reproducible three-dimensional model is determined, and data missing from the shape and reference data of the non-reproducible part 13 is extracted. The extracted data is shown as character information indicating the cause of non-reproducibility on a third window. Thus, the cause of non-reproducibility is shown on the screen, so that a person not skilled can complete the operation to re-create a three-dimensional model in a short time and efficiency of the operation can be improved.

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: A method and system for constructing a skeleton for use in animation models allows definition of a skeleton with non-articulated chain elements. These non-chain elements can be 3D objects, which can be rendered and visible in final images and animations, or null models which are not visible in final images or animations. All of the elements of the skeleton, including non-chain elements, are arranged into a skeleton hierarchy. The skeleton hierarchy can include articulated chain elements, articulated chain elements combined with non-chain elements, or solely non-chain elements. Relational information and/or mathematical relationships can be defined for the elements of the skeleton to define ranges of motion, elements which move with other elements and/or translation, rotation, scaling and/or animation of elements.

Abstract: The present invention is a method and apparatus for enhancing clipping a bit-packed glyph. A first clip value is determined if it is less than a first maximum value. If the first clip value exceeds the first maximum value, a second clip value and a third clip value are updated by a difference between the first clip value and the first maximum value, and the first clip value is replaced by the maximum value. Then, an address field value is updated by a predetermined address amount.

Abstract: A system for determining nearest leaf bounds per leaf cone of a cone hierarchy based on a dual-tree search of the cone hierarchy and a bound hierarchy. A processor, performing the dual-tree search, maintains for each leaf cone a collection of nearest leaf bounds. The collection evolves as the dual-tree search progresses. The processor may maintain the N closest leaf bounds for each leaf cone. The processor may classify leaf bounds as occluders or non-occluders, and store any non-occluder closer than the Nth occluder. Alternatively, the processor may assign an occlusion metric value to each leaf bound, and may maintain closest leaf bounds so that the sum of their occlusion metric values is less than or equal to an occlusion threshold. The dual-tree search may be followed by a search of the bound hierarchy with probe cones of the leaf cones.

Abstract: A method of rendering image data for full parallax autostereoscopic displays. The method is based on a double frustrum camera technique, where two cameras provide image data from opposing sides of an image plane. The near clipping plane is located on the image plane. The distance between the near clipping plane and the eyepoint of the camera frustra is adjusted to minimize or avoid clipping.

Abstract: An oversize document, one that is larger than the platen of the scanner, can be scanned in several segments then stitched together electronically. A method is described to analyze the scan segments to determine the orientation, magnification and translation of the different scanned segments to be stitched together. Operator assistance is required to identify salient features in the different segments to be analyzed. The location of these features is determined by calculating the centroid from a rough crop of each feature. The orientation, magnification, and translation of the scanned segment can all be determined from a comparison of the locations of the identified features. The segments are blended together with standard blending techniques.

Abstract: A system and method for performing visible object determination based upon a dual search of a cone hierarchy and a bounding (e.g. hull) hierarchy. Visualization software running on a host processor represents space with a hierarchy of cones constructed by recursive refinement, and generates a hierarchy of bounding hulls from a given collection of objects by recursively grouping clusters of objects. Hull nodes in the hull hierarchy reflect cluster membership. Each hull node stores parameters which characterize a bounding hull for the corresponding cluster or object. The visualization software searches the cone and hull hierarchies starting with the root cone and the root hull. Each leaf-cone is assigned a visibility distance value which represents the distance to its closest known object. The visibility distance value of a non-leaf cone is set equal to the maximum of the visibility distance values for its subcone children.