Abstract: A method routes a predefined number of entities (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into a first set of cells (100); grouping the first set of cells (100) into a number of corridors (201) equal to the number of entities (200); determining a starting cell for each entity (200) in each corridor (201); initiating a scan of cells of each of the corridors (201) from the starting cell of each of the entities (200) and determining the content of each of the scanned cells; and determining a total cost for each entity (200) to travel to each of the scanned cells scanned by each entity (200) and performing a scan from each of the scanned cells by each entity (200).

Abstract: A method for generating an automated exploded view of an assembly of parts is presented. The method includes determining at least one sequence of viable directions of motion of at least one moving part in the assembly of parts. Computer-readable medium and systems that afford functionality of the type defined by this method are also contemplated in conjunction with the present technique.

Abstract: A method for generating an automated exploded view of an assembly of parts is presented. The method includes determining at least one sequence of viable directions of motion of at least one moving part in the assembly of parts. Computer-readable medium and systems that afford functionality of the type defined by this method are also contemplated in conjunction with the present technique.

Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.

Abstract: A method for viewing an abnormality in different kinds of images is described. The method includes scanning an object using a first imaging system to obtain at least a first image of the object, determining coordinates of a region of interest (ROI) visible on the first image, wherein the ROI includes the abnormality, and using the coordinates of the ROI to scan the object with a second imaging system.

Abstract: A system and computer implemented method for enabling field service of machines and training of field service personnel. The method comprises the steps of generating at least one validated sequence of instructions for at least one maintenance task and delivering the at least one validated sequence for use in performing the at least one maintenance task.

Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method includes the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.

Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.

Abstract: A method routes a plurality of entities (200) through a predetermined area. The method includes the steps of: providing a plan; providing a deterministic method for computing the plan for the plurality of entities (200), the plan including a plurality of routes and sets of scan points for each of the entities (200); and performing the method by each of the plurality of entities (200) independently from the other of the plurality of entities (200).

Abstract: A method analyzes a plan for scanning the content of a predetermined area. The method includes the steps of: providing a plan for at least one entity (200), the plan including a route and a set of scan points; and assigning an associated score for the plan in order to compare the plan to other plans, the score indicating the quality of the plan.

Abstract: A method routes a plurality of entities (200) through a predetermined area. The method includes the steps of: providing a plan; providing a deterministic method for computing the plan for the plurality of entities (200), the plan including a plurality of routes and sets of scan points for each of the entities (200); and performing the method by each of the plurality of entities (200) independently from the other of the plurality of entities (200).

Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.

Abstract: The present invention provides a system and method for performing three-dimensional surface measurements of a path length along a surface. The method for determining the path length along the surface of a three-dimensional object includes the step of first selecting a first and second point on the three-dimensional surface. A plane is then defined which contains both the first and second points. A determination is then made to find the shortest path curve between the first point and second point which is defined by the intersection of the three-dimensional object with the plane. This path length is recorded for future comparison. A series of subsequent planes is defined that contains the first and second point, wherein these planes are rotated at an angle to each other. A determination is then made for the shortest path length associated with each subsequent plane. The overall shortest path length is the minimum of these recorded path lengths.

Abstract: A method for generating an image of an object of interest includes acquiring a first three-dimensional dataset of the object at a first position using an X-ray source and a detector, acquiring a second three-dimensional dataset of the object at the first position using an ultrasound probe, and combining the first three-dimensional dataset and the second three-dimensional dataset to generate a three-dimensional image of the object.

Abstract: A method and system for generating at least one disassembly sequence from a geometric representation of an assembly. The method comprises selecting at least one part for removal from the assembly and generating the disassembly sequence for the part based on a plurality of pre-computed relational information from the geometric representation.

Abstract: A system and computer implemented method for enabling field service of machines and training of field service personnel. The method comprises the steps of generating at least one validated sequence of instructions for at least one maintenance task and delivering the at least one validated sequence for use in performing the at least one maintenance task.

Abstract: A storage medium encoded with machine-readable computer program is used for finding the shortest path between two points on a polygonal surface. The storage medium includes instructions for causing a computer to implement a method for finding the shortest path. Given a first point and a second point on the polygonal surface, a polyline lying on the surface and passing through the two points is defined. The polyline on a polygonal mesh is analyzed to determine points lying on the polyline and on edges of the mesh. The polygonal faces of the mesh are assumed, without any loss of generality, to be triangles. If the start and end points of the polyline are not on the edges of the mesh, the faces of the polygonal surface on which the start and end points of the polyline lie are triangulated so that the start and end points become vertices of the polygonal mesh. The polyline is then modified such that it will pass through the first and second points of the polyline, creating a new polyline of a shorter length.

Abstract: The axis of rotational transducer array scans, because of imperfect transducer array assembly, may have two orthogonal offsets relative to the geometric center of the transducer array. Without knowledge of these offsets, it is not possible to convert rotational transducer scan data into a rectilinear (Euclidean) coordinate system, as is necessary for three-dimensional processing. Using spatial coherency between appropriate scan lines in different rotational transducer scans, the horizontal and vertical rotational offsets are calculated. These offsets are then utilized in converting the data to a rectilinear coordinate system for three-dimensional processing.

Abstract: A method for modeling an object with a polygonal mesh includes obtaining a closed-surface polygonal mesh and positioning the closed-surface polygonal mesh relative to the object. A ray is projected through a point-of-interest on said closed-surface polygonal mesh. The existence of an intersection point between said ray and a surface of the object is determined and the location of the point-of-interest is adjusted in response to the existence and location of the intersection point. The projecting is repeated for a plurality of points in the closed-surface polygonal mesh in order to approximate the object.

Abstract: A method and apparatus for calculating the inter-slice spacing in a data volume and registering the slices of that volume using SAD calculations. The resulting transformed data volume is then three-dimensionally reconstructed using a projection technique. If during scanning the probe is translated in the Z direction and at the same time is shifted in the X and/or Y direction, the SAD value will be artificially high. By translating two adjacent images with respect to each other in the X direction and then in the Y direction, and searching for the minimum SAD value, the amount of shift in the X and/or Y direction can be determined and that shift can then be removed. Also by rotating two slices with respect to each other and looking for a minimum SAD value, rotational motion of the probe during scanning can be removed.