US5761391A — Arithmetic unit for calculating distance between …

Claim 1

Independent Claim 302 words

An arithmetic unit in a computer for computing a closest distance between a first and a second three-dimensional convex object, at least one of the objects being a convex curved surface object, in accordance with shape information including arrangement position information about the objects, the arithmetic unit comprising: first closest vector arithmetic means for identifying a preliminary closest vector coupling the closest points of the two objects, displayed on a computer screen by repeatedly calculating for each object an inner product of a candidate for the preliminary closest vector directed from a first of the two objects to a second of the two objects and a plurality of position vectors, each position vector being one of: a position vector of a vertex where the first object is a convex polyhedron defined by vertexes, and a position vector of a control point of a convex curved surface patch where the first object is a convex curved surface object comprising sets of convex curved surface patches defined by control points, wherein a position vector for each object having a maximum inner product is extracted and a new candidate for the preliminary closest vector is formed by a vector connecting the two position vectors; and second closest vector arithmetic means for correcting the preliminary closest vector identified by said first closest vector arithmetic means to identify a new closest vector perpendicularly intersecting a tangent plane in contact with the object having a convex curved surface at the closest point of the object having a convex curved surface by starting from the preliminary closest vector and sequentially updating a given coordinate on the surface of the object having a convex curved surface until an inner product of a vector on the tangent plane and the closest vector on the given coordinates has the smallest possible value.

Claim 2

Dependent Claim 302 words

An arithmetic unit in a computer for computing a closest distance between a first and a second three-dimensional convex object, at least one of the objects being a convex curved surface object, in accordance with shape information including arrangement position information about the objects, the arithmetic unit comprising: first closest vector arithmetic means for identifying a preliminary closest vector coupling the closest points of the two objects, displayed on a computer screen by repeatedly calculating for each object an inner product of a candidate for the preliminary closest vector directed from a first of the two objects to a second of the two objects and a plurality of position vectors, each position vector being one of: a position vector of a vertex where the first object is a convex polyhedron defined by vertexes, and a position vector of a control point of a convex curved surface patch where the first object is a convex curved surface object comprising sets of convex curved surface patches defined by control points, wherein a position vector for each object having a maximum inner product is extracted and a new candidate for the preliminary closest vector is formed by a vector connecting the two position vectors; and second closest vector arithmetic means for correcting the preliminary closest vector identified by said first closest vector arithmetic means to identify a new closest vector perpendicularly intersecting a tangent plane in contact with the object having a convex curved surface at the closest point of the object having a convex curved surface by starting from the preliminary closest vector and sequentially updating a given coordinate on the surface of the object having a convex curved surface until an inner product of a vector on the tangent plane and the closest vector on the given coordinates has the smallest possible value.

Claim 3

Dependent Claim 44 words

An arithmetic unit according to claim 1, wherein said arithmetic unit further comprises collision determination means for determining whether the first and second objects are in a collision state in accordance with the new closest vector evaluated by said second closest vector arithmetic means.

Claim 4

Dependent Claim 142 words

An arithmetic unit according to claim 1, wherein said arithmetic unit further comprises: shape information storage means for storing shape information comprising sets of the control points constituting the convex curved surface patches constituting the object having a convex curved surface including sets of the vertexes of a convex polygon in a case where one of the objects is a convex polyhedron; shape information updating means for performing arithmetic on coordinates after a movement or a deformation of the vertexes or the control points of the objects in accordance with information for instructing a movement or a deformation of the objects, thereby evaluating a new shape information; and curved surface patch information producing means for producing convex curved surface patches constituting the object having a convex curved surface in accordance with the shape information of the object having a convex curved surface.

Claim 5

Dependent Claim 58 words

An arithmetic unit according to claim 3, wherein when the object is moved or deformed, said second closest vector arithmetic means modifies the new closest vector evaluated before a current movement or deformation to a further new closest vector, instead of evaluating a closest vector after a movement or a deformation by said first closest vector arithmetic means.

Claim 6

Dependent Claim 43 words

An arithmetic unit according to claim 3, wherein said arithmetic unit further comprises display means for displaying the objects based on the shape information stored in said shape information storage means and the new shape information evaluated by said shape information updating means.

Claim 7

Dependent Claim 296 words

An arithmetic unit in a computer for computing a closest distance between a first and a second two dimensional convex object, at least one of the objects being a convex curved line object, in accordance with shape information including arrangement position information about the objects, comprising: first closest vector arithmetic means for identifying a preliminary closest vector coupling the closest points of the two objects, displayed on a computer screen by repeatedly calculating for each object an inner product of a candidate for the preliminary closest vector directed from a first of the two objects to a second of the two objects and a plurality of position vectors, each position vector being one of: a position vector of a vertex where the first object is a convex polyhedron defined by vertexes, and a position vector of a control point of a convex curved line patch where the first object is a convex curved line object comprising sets of convex curved surface patches defined by control points, wherein a position vector for each object having a maximum inner product is extracted and a new candidate for the preliminary closest vector is formed by a vector connecting the two position vectors; and second closest vector arithmetic means for correcting the preliminary closest vector identified by said first closest vector arithmetic means to identify a new closest vector perpendicularly intersecting a tangent plane in contact with the convex curved line object at the closest point of the convex curved line object by starting from the preliminary closest vector and sequentially updating a given coordinate on the surface of the object having a convex curved surface until an inner product of a vector on the tangent plane and the closest vector on the given coordinates has the smallest possible value.

Claim 8

Dependent Claim 296 words

An arithmetic unit in a computer for computing a closest distance between a first and a second two dimensional convex object, at least one of the objects being a convex curved line object, in accordance with shape information including arrangement position information about the objects, comprising: first closest vector arithmetic means for identifying a preliminary closest vector coupling the closest points of the two objects, displayed on a computer screen by repeatedly calculating for each object an inner product of a candidate for the preliminary closest vector directed from a first of the two objects to a second of the two objects and a plurality of position vectors, each position vector being one of: a position vector of a vertex where the first object is a convex polyhedron defined by vertexes, and a position vector of a control point of a convex curved line patch where the first object is a convex curved line object comprising sets of convex curved surface patches defined by control points, wherein a position vector for each object having a maximum inner product is extracted and a new candidate for the preliminary closest vector is formed by a vector connecting the two position vectors; and second closest vector arithmetic means for correcting the preliminary closest vector identified by said first closest vector arithmetic means to identify a new closest vector perpendicularly intersecting a tangent plane in contact with the convex curved line object at the closest point of the convex curved line object by starting from the preliminary closest vector and sequentially updating a given coordinate on the surface of the object having a convex curved surface until an inner product of a vector on the tangent plane and the closest vector on the given coordinates has the smallest possible value.

Claim 9

Dependent Claim 43 words

An arithmetic unit according to claim 6, wherein said arithmetic unit further comprises collision determination means for determining whether the first and second objects are in a collision state in accordance with the new closest vector evaluated by said second closest arithmetic means.

Claim 10

Dependent Claim 133 words

An arithmetic unit according to claim 6, wherein said arithmetic unit further comprises: shape information storage means for storing shape information comprising sets of the control points constituting the convex curved line patches constituting the convex curved line object, including sets of the vertexes of a convex polygon where one of the objects is a convex polyhedron; shape information updating means for performing arithmetic on coordinates after a movement or a deformation of the vertexes or the control points of the objects in accordance with information for instructing a movement or a deformation of the objects, thereby evaluating a new shape information; and curved line patch information producing means for producing convex curved line patches constituting the convex curved line object in accordance with the shape information of the convex curved line object.

Claim 11

Dependent Claim 58 words

An arithmetic unit according to claim 8, wherein when the object is moved or deformed, said second closest vector arithmetic means modifies the new closest vector evaluated before a current movement or deformation to a further new closest vector, instead of evaluating a closest vector after a movement or a deformation by said first closest vector arithmetic means.

Claim 12

Dependent Claim 43 words

An arithmetic unit according to claim 8, wherein said arithmetic unit further comprises display means for displaying the objects based on the shape information stored in said shape information storage means and the new shape information evaluated by said shape information updating means.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2001-06-01	2001-12-01	2002-06-02	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2005-06-01	2005-12-01	2006-06-02	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2009-06-01	2009-12-01	2010-06-02	$7700.00	Window Closed / Lapsed

Arithmetic unit for calculating distance between objects

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag