Lee R Nackman, Age 70414 Bennett Orchard Trl, Chapel Hill, NC 27516

6182281, Jan 30, 2001

Apr 16, 1997

8/838205

Lee Richard Nackman - White Plains NY
Michael Karasick - Ossining NY
John Joseph Barton - Mahopac NY
Derek Lieber - Yorktown Heights NY
David Joseph Streeter - Scarborough, CA

International Business Machines Corporation - Armonk NY

G06F 9445

717 5

An enhanced compiler for compiling C++ programs without the use of forward declarations normally included in program header files. Through multiple parsing passes, the compiler extracts definitions for the declarations directly from the bodies of the C++ files. By saving the definitions to a persistent program representation, for example a program database, on subsequent sweeps, only definitions for new or changed declarations need be updated. In this way, C++ programs can be incrementally compiled on a declaration by declaration basis.

4797842, Jan 10, 1989

Sep 16, 1987

7/097382

Lee R. Nackman - White Plains NY
Vijay Srinivasan - Ossining NY

International Business Machines Corporation - Armonk NY

G06F 1560
G06F 1562
G06F 15328

364578

A method, amenable to automation, for generating finite elements of a geometric model. The model is first subdivided into coarse subdomains and then the coarse subdomains are further subdivided. The coarse subdivision is performed using a symmetric axis transform which generates axes symmetric to opposing boundaries of the object. The transform also generates a radius function of the axes giving the distance between the axes and the boundaries. A coarse subdomain is created between each single non-branching section of the axes and one of its associated boundaries. The fine subdivisions of the relatively simple coarse subdomains is performed by well known techniques or can beneficially use the radius function.

4933889, Jun 12, 1990

Apr 29, 1988

7/187715

Siavash N. Meshkat - San Jose CA
Lee R. Nackman - White Plains NY
Vijay Srinivasan - Peekskill NY

International Business Machines Corporation - Armonk NY

G06F 1560
G06F 1562
G06F 15328

364578

A method for fine decomposition in finite element mesh generation, in which a polygonal boundary of a domain is input into the system by an analyst and the domain is automatically divided into rough elements generally corresponding to Voronoi regions, that is, regions which are closer to respective ones of the polygonal line segments or reflex vertices therebetween. Any arc portion of these regions is converted to a straight line. Additional lines are formed between interior vertices of the rough regions so that all rough regions are either triangles or trapezoids. Adjacent rough regions are then paired across internal boundaries and are classified into four types. The rough regions are then subdivided into fine regions of triangular shape according to rules associated with each of the four types. The degree of fine subdivision can be controlled according to known equations providing the total number of fine elements. Finite difference equations are solved on the so generated fine regions and a physical variable is displayed in pictorial form.