← Back to Patent Explorer
US5883629A Expired / Lapsed US ⏱️ 0.0 years remaining

Recursive and anisotropic method and article of manufacture for generating a balanced computer representation of an object

Assignee: International Business Machines Corp
•
Filing: 1996-06-28
•
Granted: 1999-03-16
•
Expires: 2016-06-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for generating a computer representation of a two-dimensional or three-dimensional object featuring recursive and anisotropic division of the representation. A bitree approach is provided for successively dividing into two equal parts any portion of the computer representation of the object. Each subdivision into two parts is accomplished by dividing the portion either horizontally or vertically. The method is implemented over a user interface to an information handling system comprised of one or more processors, a memory system, I/O devices, and an operating system program. Each subdivision of the computer representation of the object is comprised of a data structure that is efficiently stored in the memory system and dynamically updated to contain information about its neighboring subdivisions in order that balancing can be effectively achieved.

Inventors

  • 👤 Jeffrey Bowman Johnson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 14:02
CPC Classifications
G; G06; G06T; G06T17/00; G06T17/20

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 168 words
An information handling system, comprising: one or more processing units; a memory system; one or more I/O controllers for controlling one or more I/O devices; a system bus connecting the processors, the memory system and the I/O controllers; an operating system control means for controlling operation of the processors, the memory system, and the I/O controllers; one or more means for generating a computer representation of a three-dimensional object; means for recursive and anisotropic division of the computer representation to yield resulting subdivisions; means for generating a data structure for each subdivision of the computer representation, wherein said data structure is efficiently stored in said memory system and contains information linking the subdivision to its succeeding and neighboring subdivisions; means for updating said data structure information after each of said divisions of said computer representation in order that balancing is continuously and dynamically achieved; and a display device connected to one or more I/O controllers for displaying a user interface of the computer representation and the resulting subdivisions.
Claim 2
Dependent Claim 168 words
An information handling system, comprising: one or more processing units; a memory system; one or more I/O controllers for controlling one or more I/O devices; a system bus connecting the processors, the memory system and the I/O controllers; an operating system control means for controlling operation of the processors, the memory system, and the I/O controllers; one or more means for generating a computer representation of a three-dimensional object; means for recursive and anisotropic division of the computer representation to yield resulting subdivisions; means for generating a data structure for each subdivision of the computer representation, wherein said data structure is efficiently stored in said memory system and contains information linking the subdivision to its succeeding and neighboring subdivisions; means for updating said data structure information after each of said divisions of said computer representation in order that balancing is continuously and dynamically achieved; and a display device connected to one or more I/O controllers for displaying a user interface of the computer representation and the resulting subdivisions.
Claim 3
Dependent Claim 38 words
An information handling system, according to claim 1, further comprising: one or more application programs operating under control of the operating system control means for controlling and generating said computer representation of the three-dimensional object and resulting subdivisions.
Claim 4
Dependent Claim 20 words
An information handling system, according to claim 1, further comprising: means for storing in the memory system the resulting subdivisions.
Claim 5
Dependent Claim 36 words
An information handling system, according to claim 1, further comprising: means for recursively continuing the division of the computer representation until a desired degree of balancing is met between the computer representation and the resulting subdivisions.
Claim 6
Independent Claim 217 words
A method for recursively and anisotropically describing a computer representation of a three-dimensional object displayed in an information handling system by a tree data structure in accordance with a programmed set of criteria, comprising the steps of: first, reading the computer representation from a memory system; second, setting a bounding box around the computer representation thereby making a starting quad of the tree data structure; third, subdividing the bounding box into two equal resulting sub-boxes by dividing the bounding box in either the x-direction, the y-direction, or the z-direction, in accordance with the programmed set of criteria, thereby making a first level of said tree data structure having a root node corresponding to the starting quad and having two branches each with two leaves corresponding to each of said two equal resulting sub-boxes; fourth updating said tree data structure information in order that balancing of said tree data structure is continuously and dynamically achieved; fifth, recursively and equally subdividing a resulting sub-box into further resulting sub-boxes by dividing the resulting sub-box in either the x-direction, the y-direction, or the z-direction, in accordance with the programmed set of criteria; and sixth, determining whether the programmed set of criteria have been met and, if not, repeating said fourth, fifth and sixth steps, and if so, ending the subdivision process.
Claim 7
Independent Claim 217 words
A method for recursively and anisotropically describing a computer representation of a three-dimensional object displayed in an information handling system by a tree data structure in accordance with a programmed set of criteria, comprising the steps of: first, reading the computer representation from a memory system; second, setting a bounding box around the computer representation thereby making a starting quad of the tree data structure; third, subdividing the bounding box into two equal resulting sub-boxes by dividing the bounding box in either the x-direction, the y-direction, or the z-direction, in accordance with the programmed set of criteria, thereby making a first level of said tree data structure having a root node corresponding to the starting quad and having two branches each with two leaves corresponding to each of said two equal resulting sub-boxes; fourth updating said tree data structure information in order that balancing of said tree data structure is continuously and dynamically achieved; fifth, recursively and equally subdividing a resulting sub-box into further resulting sub-boxes by dividing the resulting sub-box in either the x-direction, the y-direction, or the z-direction, in accordance with the programmed set of criteria; and sixth, determining whether the programmed set of criteria have been met and, if not, repeating said fourth, fifth and sixth steps, and if so, ending the subdivision process.
Claim 8
Dependent Claim 45 words
A method for recursively and anisotropically describing a computer representation of a three-dimensional object displayed in an information handling system by a tree data structure, according to claim 5, wherein each node includes adjacency pointer information linking each resulting sub-box to its neighboring resulting sub-boxes.
Claim 9
Dependent Claim 39 words
A method for recursively and anisotropically describing a computer representation of a three-dimensional object displayed in an information handling system by a tree data structure, according to claim 5, further comprising storing in a memory subsystem the resulting sub-boxes.
Claim 10
Dependent Claim 99 words
An article of manufacture, comprising: a computer readable medium, comprising: one or more means for generating a computer representation of a three-dimensional object; means for recursive and anisotropic division of the computer representation to yield resulting subdivisions; means for generating a data structure for each subdivision of the computer representation, wherein said data structure is efficiently stored in said memory system and contains information linking the subdivision to its succeeding and neighboring subdivisions; and means for updating said data structure information after each of said divisions of said computer representation in order that balancing is continuously and dynamically achieved.
Claim 11
Dependent Claim 99 words
An article of manufacture, comprising: a computer readable medium, comprising: one or more means for generating a computer representation of a three-dimensional object; means for recursive and anisotropic division of the computer representation to yield resulting subdivisions; means for generating a data structure for each subdivision of the computer representation, wherein said data structure is efficiently stored in said memory system and contains information linking the subdivision to its succeeding and neighboring subdivisions; and means for updating said data structure information after each of said divisions of said computer representation in order that balancing is continuously and dynamically achieved.
Claim 12
Dependent Claim 20 words
An article of manufacture, according to claim 8, further comprising: means for storing in a memory system the resulting subdivisions.
Claim 13
Dependent Claim 36 words
An article of manufacture, according to claim 8, further comprising: means for recursively continuing the division of the computer representation until a desired degree of balancing is met between the computer representation and the resulting subdivisions.
Claim 14
Independent Claim 102 words
A method for recursively and anisotropically describing a computer representation of a three-dimensional object displayed in an information handling system, the method comprising the steps of: generating the computer representation of the three-dimensional object; recursively and anisotropically dividing the computer representation to yield resulting subdivisions; generating a data structure for each subdivision of the computer representation, wherein said data structure is efficiently stored in a memory subsystem and contains information linking the subdivision to its succeeding and neighboring subdivisions; and updating said data structure after each of said divisions of said computer representation in order that balancing is continuously and dynamically achieved.
Claim 15
Independent Claim 102 words
A method for recursively and anisotropically describing a computer representation of a three-dimensional object displayed in an information handling system, the method comprising the steps of: generating the computer representation of the three-dimensional object; recursively and anisotropically dividing the computer representation to yield resulting subdivisions; generating a data structure for each subdivision of the computer representation, wherein said data structure is efficiently stored in a memory subsystem and contains information linking the subdivision to its succeeding and neighboring subdivisions; and updating said data structure after each of said divisions of said computer representation in order that balancing is continuously and dynamically achieved.
Claim 16
Dependent Claim 18 words
The method of claim 11, further comprising the step of: storing in a memory system the resulting subdivisions.
Claim 17
Dependent Claim 34 words
The method of claim 11, further comprising the step of: recursively continuing the division of the computer representation until a desired degree of balancing is met between the computer representation and the resulting subdivisions.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-03-15 2002-09-14 2003-03-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-03-15 2006-09-14 2007-03-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-03-15 2010-09-14 2011-03-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag