Method and system for organizing topology elements for better compression

A method for organizing elements for compression, comprising:

• nesting, by a computing device, a hierarchical topological structure having a plurality of elements;
• arranging, by the computing device, said plurality of elements in a pattern to facilitate data compression;
• representing said pattern as four arrays by the computing device, the four arrays consisting of a shell array, a face array, a loop array, and a coedge array;
• and
• compressing said plurality of elements from said arrays by the computing device,
• wherein arranging said elements occurs in accordance with the equations:
• rks=rk−1e+1, 0<k<Nr
• sks=sk−1e+1, 0<k<Ns
• fks=rk−1e+1, 0<k<Nf
• lks=rk−1e+1, 0<k<Nl
• where, Nr, Ns, Nf and Nl are the total number of regions, shells, faces, and loops in said structure, respectively, an r with a subscript represents a shell of a region, an s with a subscript represents face of a shell, an f with a subscript represents a loop of a face, an l with a subscript represents a coedge of a loop, an s without a subscript represents a starting element, an e represents an ending element, and k represents an array index.

A method for organizing elements for compression, comprising:

• nesting, by a computing device, a hierarchical topological structure having a plurality of elements;
• arranging, by the computing device, said plurality of elements in a pattern to facilitate data compression;
• representing said pattern as four arrays by the computing device, the four arrays consisting of a shell array, a face array, a loop array, and a coedge array;
• and
• compressing said plurality of elements from said arrays by the computing device,
• wherein representing said arrays occurs in accordance with the equations:
• rkn=rke−rks+1, 0<=k<Nr
• skn=ske−sks+1, 0<=k<Ns
• fkn=fke−fks+1, 0<=k<Nf
• lkn=rle,−rls+1, 0<=k<Nl
• where, Nr, Ns, Nf and Nl are the total number of regions, shells, faces, and loops in said structure, respectively, n indicates the specific structure, an r with a subscript represents a shell of a region, an s with a subscript represents face of a shell, an f with a subscript represents a loop of a face, an l with a subscript represents a coedge of a loop, an s without a subscript represents a starting element, an e represents an ending element, and k represents an array index.

A non-transitory machine readable medium encoded with instructions operable to cause a computer to perform the steps of:

• nesting a hierarchical topological structure having a plurality of elements;
• arranging said plurality of elements in a pattern to facilitate data compression;
• representing said pattern as four arrays, the four arrays consisting of a shell array, a face array, a loop array, and a coedge array;
• and
• compressing said plurality of elements from said arrays.

A non-transitory machine readable medium encoded with instructions operable to cause a computer to perform the steps of:

• nesting a hierarchical topological structure having a plurality of elements;
• arranging said plurality of elements in a pattern to facilitate data compression;
• representing said pattern as four arrays, the four arrays consisting of a shell array, a face array, a loop array, and a coedge array;
• and
• compressing said plurality of elements from said arrays, wherein arranging said elements occurs in accordance with the equations:
• rks=rk−1e+1, 0<k<Nr
• sks=sk−1e+1, 0<k<Ns
• fks=rk−1e+1, 0<k<Nf
• lks=rk−1e+1, 0<k<Nl
• where, Nr, Ns, Nf and Nl are the total number of regions, shells, faces, and loops in said structure, respectively, an r with a subscript represents a shell of a region, an s with a subscript represents face of a shell, an f with a subscript represents a loop of a face, an l with a subscript represents a coedge of a loop, an s without a subscript represents a starting element, an e represents an ending element, and k represents an array index.

A non-transitory machine readable medium encoded with instructions operable to cause a computer to perform the steps of:

• nesting a hierarchical topological structure having a plurality of elements;
• arranging said plurality of elements in a pattern to facilitate data compression;
• representing said pattern as four arrays, the four arrays consisting of a shell array, a face array, a loop array, and a coedge array;
• and
• compressing said plurality of elements from said arrays, wherein representing said arrays occurs in accordance with the equations:
• rkn=rke−rks+1, 0<=k<Nr
• skn=ske−sks+1, 0<=k<Ns
• fkn=fke−fks+1, 0<=k<Nf
• lkn=rle,−rls+1, 0<=k<Nl
• where, Nr, Ns, Nf and Nl are the total number of regions, shells, faces, and loops in said structure, respectively, n indicates the specific structure, an r with a subscript represents a shell of a region, an s with a subscript represents face of a shell, an f with a subscript represents a loop of a face, an l with a subscript represents a coedge of a loop, an s without a subscript represents a starting element, an e represents an ending element, and k represents an array index.

A data processing system comprising

• a processor;
• and
• an accessible memory, the data processing system configured to
• nest a hierarchical topological structure having a plurality of elements;
• arrange said plurality of elements in a pattern to facilitate lossless data compression;
• represent said pattern as four arrays, the four arrays consisting of a shell array, a face array, a loop array, and a coedge array;
• and
• compress said plurality of elements from said arrays.