Method for creating spatially balanced bounding volume hierarchies for use in a computer generated display of a complex structure

• US 5,613,049 A
• Filed: 10/26/1994
• Issued: 03/18/1997
• Est. Priority Date: 10/26/1994
• Status: Expired due to Term

• Current Assignee: The Boeing Co.
• Original Assignee: The Boeing Co.
• Inventors: Brechner, Eric L., Bourassa, Virgil E.
• Primary Examiner(s): Nguyen, Phu K.
• Assistant Examiner(s): Vo, Cliff N.
• Application Number:
  US08/329,356
• Time in Patent Office: 874 Days
• Field of Search: 395/120, 395/119, 395/124, 395/127
• US Class Current: 345/420
• CPC Class Codes: G06T 17/005 Tree description, e.g. octree, quadtree
• CPC Class Codes: G06T 19/20 Editing of 3D images, e.g. changing shapes or colours, aligning objects or positioning parts
• CPC Class Codes: G06T 2210/12 Bounding box
• CPC Class Codes: G06T 2219/2008 Assembling, disassembling

Abstract

Disclosed is a method for processing an arbitrary collection of objects, forming a complex structure, into a hierarchy of bounding volumes, from a root volume bounding all objects, to sub-volumes bounding individual objects or assemblies thereof, for use as successive approximations to said objects in a computer generated display. The method includes the first step of creating a bounding volume for each of the objects. Selected bounding volumes are then processed through a combining algorithm determining whether or not, based upon a geometric relationship between the bounding volumes and the higher level, root volume, the selected bounding volumes can be combined. If it is determined that the bounding volumes can be combined, a new bounding volume is created with the combined volumes comprising sub-volumes thereof. This process systematically repeats and attempts to combine all sub-volumes. The combining algorithm preferably allows a combination if the volumes of the combination of the sub-volume is smaller than a fixed percentage of the parent volume. When a pair can combine, it is replaced by a box bounding volume that contains the pair as sub-volumes, and the process continues. In this way, a bounding volume hierarchy for all objects and assemblies within a complex structure is created.

Claims

1. A method for processing an arbitrary collection of objects, represented by computer generated images thereof, into a hierarchy of bounding volumes, from a root volume bounding all objects, to sub-volumes bounding individual objects or assemblies thereof, for use as successive approximations to said objects, comprising the steps of:

a) creating bounding volumes for said objects;

b) processing selected bounding volumes through a predetermined combining algorithm to determine whether or not, based upon a geometric relationship between said bounding volumes and the root volume, the selected bounding volumes can be combined into a new volume representative of said selected bounding volumes, and with respect to those bounding volumes which can be combined;

c) creating a new bounding volume with said combined bounding volumes comprising sub-volumes thereof,

d) recursively applying steps b) and c) to said new bounding volume and treating the new bounding volume as the root volume and its combined volumes as the selected volumes,

e) utilizing said new bounding volume as an approximation of the image of said sub-volumes in a computer generated display.

2. The method of claim 1 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the steps of:

selecting at least two bounding volumes;

computing the combined volume of said selected bounding volumes;

determining whether said combined volume is smaller than a predetermined percentage of the volume of the root volume and;

a) if it is not, determining that said selected bounding volumes cannot be combined and not attempting to combine same, and

b) if it is, determining that said selected bounding can be combined.

3. The method of claim 2 wherein said predetermined percentage is selected as approximately 8.3%.

4. The method of claim 2 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the first step of:

before attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes, determining whether adding the new bounding volume would expand the parent volume and, if it would not, determining that none of the parent'"'"'s sub-volumes can combine and not attempting to combine same.

5. The method of claim 2 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

before attempting to combine sub-volumes contained within a parent volume,

determining if the smallest sub-volume is larger than said predetermined percentage of the volume of said parent volume and, if it is, determining that none of the parent'"'"'s sub-volumes can combine and not attempting to combine same.

6. The method of claim 5 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

identifying each sub-volume having a volume greater than one-tenth of said predetermined percentage of the parent volume and not attempting to combine same.

7. The method of claim 3 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

before attempting to combine sub-volumes contained within a parent volume,

determining if the smallest sub-volume is larger than said predetermined percentage of the volume of said parent volume and, if it is, determining that none of the parent'"'"'s sub-volumes can combine and not attempting to combine same.

8. The method of claim 7 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

identifying each sub-volume having a volume greater than one-tenth of said predetermined percentage of the parent volume and not attempting to combine same.

9. The method of claim 4 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

before attempting to combine sub-volumes contained within a parent volume,

determining if the smallest sub-volume is larger than said predetermined percentage of the volume of said parent volume and, if it is, determining that none of the parent'"'"'s sub-volumes can combine and not attempting to combine same.

10. The method of claim 9 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

identifying each sub-volume having a volume greater than one-tenth of said predetermined percentage of the parent volume and not attempting to combine same.

11. The method of claim 1 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

before attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

12. The method of claim 2 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

before attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

13. The method of claim 3 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

14. The method of claim 4 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

15. The method of claim 5 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

16. The method of claim 6 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

17. The method of claim 7 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

18. The method of claim 8 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

19. The method of claim 9 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

20. The method of claim 10 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes are unlikely to combine and not attempting to combine same.

21. A method for creating a tight, spatially balanced hierarchy of bounding volumes from an arbitrary distribution of parts for use as successive approximations to the original parts and part assemblies, comprising the steps of:

a) selecting a first part;

b) computing a first bounding volume for said first part;

c) making said first bounding volume a root volume;

d) selecting a second part;

e) computing a second bounding volume for said second part;

f) creating a new root volume to contain said second bounding volume with said old root volume and second bounding volume as sub-volumes thereof;

g) selecting a third part;

h) computing a third bounding volume for said third part;

i) expanding said root volume to contain said third bounding volume and adding said third bounding volume as a sub-volume thereof;

j) selecting a first pair of said sub-volumes;

k) processing said selected sub-volumes through a predetermined combining algorithm which determines, based upon a geometric relationship between said sub-volumes and said root volume, whether or not said selected sub-volumes can be combined into a new bounding volume and;

i) if they cannot be combined, selecting a new pair of sub-volumes and processing said selected pair of sub-volumes through step k),

ii) if they can be combined;

1) creating a new bounding volume with said selected sub-volumes as sub-volumes thereof,

2) selecting a new pair of sub-volumes and processing said selected pair of sub-volumes through step k),

whereby sub-volumes of said root volume are tested to determine if they can combine into new bounding volumes to thereby create said hierarchy of bounding volumes; and

utilizing said new bounding volumes as an approximation of the image of said sub-volumes in a computer generated display.

22. The method of claim 21 wherein the step of processing said selected sub-volumes through a predetermined combining algorithm comprises the steps of:

a) computing the combined volume of said selected sub-volumes; and

b) determining whether said combined volume is smaller than a predetermined percentage of the volume of the root volume;

i) if it is not, determining that said selected pair of sub-volumes cannot be combined,

ii) if it is, determining that said selected pair of sub-volumes can be combined.

23. The method of claim 22 wherein said predetermined percentage is selected as approximately 8.3%.

24. The method of claim 21 including the further step of:

predeterminedly repeating said steps to process all remaining parts such that a bounding volume hierarchy is created for all parts and part assemblies.

25. The method of claim 22 including the further step of:

predeterminedly repeating said steps to process all remaining parts such that a bounding volume hierarchy is created for all parts and part assemblies.

26. The method of claim 25 wherein said predetermined percentage is selected as approximately 8.3%.

27. The method of claim 21 wherein the steps of computing said bounding volumes comprises the step of;

creating bounding boxes having the eight corners thereof selected to bound the selected part.

28. The method of claim 22 wherein the steps of computing said bounding volumes comprises the step of;

creating bounding boxes having the eight corners thereof selected to bound the selected part.

29. A method for creating a tight, spatially balanced hierarchy of bounding volumes from an arbitrary distribution of parts for use as successive approximations to the original parts and part assemblies, comprising the steps of:

a) selecting a first part;

b) computing a bounding volume for said first part;

c) determining if a root volume exists and;

i) if it does not;

1) making the current volume the root volume, and

2) selecting a new object and proceeding with step b),

ii) if it does, proceeding with step d);

d) determining if the root volume has sub-volumes;

i) if it does not;

1) creating a new root volume with the old root volume and new selected volume as sub-volumes;

2) selecting a new object and proceeding with step b);

ii) if it does, proceeding with step e);

e) expanding the root volume to contain the new selected volume and adding the new selected volume as a sub-volume thereof;

f) selecting a first pair of sub-volumes;

g) processing said selected sub-volumes through a predetermined combining algorithm which determines whether or not said selected sub-volumes can be combined into a new bounding volume which is representative of said sub-volumes, and;

i) if they cannot be combined, selecting a new pair of sub-volumes and proceeding to step g),

ii) if they can be combined, proceeding to step h);

h) determining if the first of the selected sub-volumes has sub-volumes and;

i) if it does;

1) expanding the first selected sub-volume to contain the second selected sub-volume, and

2) if it does not, proceeding to step f);

ii) if it does not, proceeding to step i);

i) determining if the second of the selected sub-volumes has sub-volumes and;

i) if it does;

1) expanding the second selected sub-volume to contain the first selected sub-volume, and

2) proceeding to step f),

ii) if it does not, proceeding to step j); and

j) creating a new volume with the first and second selected sub-volumes as sub-volumes thereof and selecting a new pair of sub-volumes and proceeding to step g),

whereby sub-volumes of said root volume are tested to determine if they can combine into new bounding volumes to thereby create said hierarchy of bounding volumes; and

k) utilizing the new bounding volume as an approximation of the image of said sub-volumes in a computer generated display.

30. The method of claim 29 wherein the step of processing said selected sub-volumes through a predetermined combining algorithm comprises the steps of:

a) computing the combined volume of said selected sub-volumes; and

b) determining whether said combined volume is smaller than a predetermined percentage of the volume of the root volume;

i) if it is not, determining that said selected pair of sub-volumes cannot be combined, and

ii) if it is, determining that said selected pair of sub-volumes can be combined.

31. The method of claim 30 wherein said predetermined percentage is selected as approximately 8.3%.

32. The method of claim 29 including the further step of:

predeterminedly repeating said steps to process all remaining parts such that a bounding volume hierarchy is created for all parts and part assemblies.

33. The method of claim 30 including the further step of:

predeterminedly repeating said steps to process all remaining parts such that a bounding volume hierarchy is created for all parts and part assemblies.

34. The method of claim 29 wherein the steps of computing said bounding volumes comprises the step of:

creating bounding boxes having the eight corners thereof selected to bound the selected part.

35. The method of claim 30 wherein the steps of computing said bounding volumes comprises the step of:

creating bounding boxes having the eight corners thereof selected to bound the selected part.

36. A method for processing an arbitrary collection of geometric objects into a hierarchy of bounding volumes, from a root volume bounding all objects, to sub-volumes bounding individual objects or assemblies thereof, for use as successive approximations to said objects, in a computer generated representation therefore comprising the steps of:

a) creating bounding volumes for said objects;

b) processing selected bounding volumes through a predetermined combining algorithm to determine whether or not, based upon a geometric relationship between said bounding volumes and the root volume, the selected bounding volumes can be combined into a new volume representative of said selected bounding volumes, and with respect to those bounding volumes which can be combined;

c) creating a new bounding volume with said combined bounding volumes comprising sub-volumes thereof, whereby the new bounding volume approximates the spatial relationship of said sub-volumes,

d) recursively applying steps b) and c) to said new bounding volume treating the new bounding volume as the root volume; and

e) utilizing said new bounding volume as an approximation of the spatial relationship of said sub-volumes in a computer generated representation therefore.

37. The method of claim 36 wherein the step is processing selected bounding volumes through a predetermined combining algorithm comprises the steps of:

selected at least two bounding volumes;

computing the combined volume of said selected bounding volumes;

determining whether said combined volume is smaller than a predetermined percentage of the volume of the root volume and;

a) if it is not, determining that said selected bounding volumes cannot be combined and not attempting to combine same, and

b) if it is, determining that said selected bounding can be combined.

38. The method of claim 37 wherein said predetermined percentage is selected as approximately 8.3%.

39. The method of claim 37 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether adding the new bounding volume expands the parent volume and, if it does, determining that none of the parent'"'"'s sub-volumes can combine and not attempting to combine same.

40. The method of claim 37 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine sub-volumes contained within a parent volume,

determining if the smallest sub-volume is larger than said predetermined percentage of the volume of said parent volume and, if it is, determining that none of the parent'"'"'s sub-volumes can combine and not attempting to combine same.

41. The method of claim 40 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

identifying each sub-volume having a volume greater than one tenth of said predetermined percentage of the parent volume and determining that each such sub-volume cannot be combined with other volumes and not attempting to combine same.

42. The method of claim 36 wherein the step of processing selected bounding volumes through a predetermined combining algorithm comprises the further step of:

in attempting to combine a new bounding volume into a parent volume which contains at least two sub-volumes,

determining whether said new bounding volume can combine with one of said sub-volumes and, if it can, determining that the remaining sub-volumes cannot combine and not attempting to combine same.

43. A method for creating a tight, spatially balanced hierarchy of bounding volumes from an arbitrary distribution of parts for use as successive approximations to be the original parts and part assemblies, in a computer generated representation thereof comprising the steps of:

a) selecting a first part;

b) computing a bounding volume for said first part;

c) determining if a root volume exists and;

i) if it does not;

1) making the current volume the root volume, and

2) selecting a new object and proceeding with step b),

ii) if it does, proceeding with step d);

d) determining if the root volume has sub-volumes;

i) if it does not;

1) creating a new root volume with the old root volume and new selected volume as sub-volumes thereof;

2) selecting a new part and proceeding with step b),

ii) if it does, proceeding with step e);

e) expanding the root volume to contain a new selected volume, N, and adding the new selected volume as a sub-volume thereof;

f) selecting a first, previously existing, sub-volume, M;

g) computing the combined volume of selected sub-volume M and newly inserted sub-volume, N;

h) determining if said combined volume is smaller than a predetermined percentage of the parent volume and;

i) if it is not, selecting a next, previously existing sub-volume, M, and proceeding to step g) unless all previously existing sub-volumes have been previously selected, in which case proceed to step l);

ii) if it is, proceeding to step i);

i) determining whether sub-volume M has sub-volumes, and;

i) if it does,

a) expanding volume M to contain volume N and proceeding to step l),

ii) if it does not, proceeding to step j);

j) determining whether sub-volume N has sub-volumes, and;

i) if it does,

a) expanding volume N to contain volume M,

b) selecting the next, previously existing sub-volume, M, and

proceeding to step g) unless all previously existing sub-volumes have been previously selected, in which case proceeding to step l);

ii) if it does not, proceeding to step k);

k) creating a new volume with N and M as sub-volumes and proceeding to step l);

l) determining whether N was merged with a previously existing sub-volume and;

i) if it was not, selecting a new object and proceeding with step b),

ii) if it was, proceeding with step m);

m) determining if the parent volume of N increased by the inclusion of N, and;

i) if it did not, selecting a new object and proceeding with step b),

ii) if it did, proceeding with step n);

n) determining if the smallest sub-volume within the parent volume is smaller than a predetermined percentage of the parent volume, and;

i) if it is not, selecting a new object and proceeding with step b),

ii) if it is, proceeding with step o);

o) selecting a first pair of sub-volumes A, B;

p) computing the combined volume of selected volumes A and B;

q) determining if said combined volume is less than a predetermined percentage of the parent volume, and

i) if it is not, selecting a new pair of sub-volumes A, B and proceeding to step p);

ii) if it is, proceeding to step r);

r) determining if the first sub-volume A has sub-volumes and;

i) if it does;

1) expanding the first selected sub-volume A to contain the second selected sub-volume B, and

2) proceeding to step f),

ii) if it does not, proceeding to step s)

s) determining if the second selected sub-volume B has sub-volumes and;

i) if it does;

1) expanding the second selected sub-volume to contain the first selected sub-volume A, and

2) proceeding to step f),

ii) if it does not, proceeding to step t); and

t) creating a new volume with the selected sub-volumes A, B as sub-volumes thereof and selecting a new pair of sub-volumes A, B, and proceeding to step b),

whereby sub-volumes are tested to determine if they can combine into new bounding volumes to thereby create said hierarchy of bounding volumes and

u) utilizing said new bounding volumes as an approximation of said sub-volumes as an approximation of said sub-volumes in a computer generated representation thereof.