THREE DIMENSIONAL GEOMETRIC DATA CORRECTION
Technology creates visualization data which corrects defects present in the native application data created by a CAD or other graphic application. A computer implemented process creates three dimensional object view data, and includes the steps of: accessing a three dimensional object data comprising a plurality of polygons having borders; building a border collapsion heap, the border collapsion heap comprising pairs of border elements separated by a distance; and joining one or more pairs of border elements based on a separation distance.
1 . A process for correcting errors in a three dimensional view of an object, the view comprising a plurality of polygons, comprising:
spatially mapping boundary vertices between the polygons;
creating a vertex collapsion heap based on the spatial mapping;
processing the collapsion heap by collapsing pairs of boundary vertices within a defined distance.
2 . The process of claim 1 wherein the process further includes mapping connectivity information into a data structure and detecting boundary vertices.
3 . The process of claim 1 wherein the step of mapping comprises establishing a bounding box for the object, segmenting the bounding box into regularly sized cells based on a granularity setting.
4 . The process of claim 3 wherein the granularity setting is user defined.
5 . The process of claim 3 wherein the process further includes storing vertices that are adjacent to cell boundaries with adjacent cell information by applying a tolerance factor.
6 . The process of claim 3 wherein the step of building a vertex collapsion heap includes storing pairs of boundary vertices within each cell.
7 . The process of claim 1 wherein the step of creating a vertex collapsion heap comprises at least one or more of the steps of: determining whether the distance between members of a vertex pair is less than a tolerance factor; determining that members of a vertex pair are not on the same polygon face; determining that no face inversion exists between members of the pair.
8 . The process of claim 7 wherein the step of creating a vertex collapsion heap comprises all of said determining steps.
9 . The process of claim 1 wherein the step of processing the collapsion heap includes for at least a first vertex pair, substituting a second vertex for a first vertex in the pair.
10 . The process of claim 9 wherein the step of processing includes removing any heap elements containing said first vertex.
11 . The process of claim 9 further including the step of determining a whether the substituted second vertex is a boundary vertex.
12 . A computer implemented process for creating three dimensional object view data, comprising:
accessing a three dimensional object data comprising a plurality of polygons having borders;
building a border collapsion heap, the border collapsion heap comprising pairs of border elements separated by a distance;
joining one or more pairs of border elements based on a separation distance.
13 . The computer implemented method of claim 12 wherein the border elements are vertices.
14 . The computer implemented method of claim 12 wherein the border elements are edges.
15 . The computer implemented method of claim 12 further including the step of mapping boundary vertices between polygons comprising the three dimensional object.
16 . The computer implemented method of claim 15 wherein the process further includes storing vertices that are adjacent to cell boundaries with adjacent cell information by applying a tolerance factor.
17 . The computer implemented method of claim 12 wherein the step of creating a border collapsion heap comprises at least one or more of the steps of: determining whether the distance between members of an element pair is less than a tolerance factor; determining that members of a element pair are not on the same polygon face; determining that no face inversion exists between members of the pair.
18 . The computer implemented method of claim 17 wherein the step of creating an element collapsion heap comprises all of said determining steps.
19 . The computer implemented method of claim 12 wherein the step of joining includes for at least a first element pair, substituting a second element for a first element in the pair.
20 . A computer readable medium having instructions stored thereon, the instructions causing a processing device to execute a method comprising:
mapping connectivity information for polygons comprising a three dimensional object into a data structure;
detecting boundary vertices joining the polygons;
spatially mapping the boundary vertices into a vertex face array;
building a vertex collapsion data structure containing pairs of boundary vertices;
joining a first vertex with a second vertex in ones of said pairs of boundary vertices; and
outputting corrected three dimensional object data for a viewer.
21 . The computer readable medium of claim 20 wherein the step of mapping comprises establishing a bounding box for the object, segmenting the bounding box into regularly sized cells based on a granularity setting.
22 . The computer readable medium of claim 21 wherein the step of building a vertex collapsion heap includes storing pairs of boundary vertices within each cell of the vertex face array.
23 . The process of claim 22 wherein the step of creating a vertex collapsion heap comprises at least one or more of the steps of: determining whether the distance between members of a vertex pair is less than a tolerance factor; determining that members of a vertex pair are not on the same polygon face; determining that no face inversion exists between members of the pair.
24 . The process of claim 20 wherein the step of processing the collapsion heap includes for at least a first vertex pair, substituting a second vertex for a first vertex in the pair.
25 . The process of claim 24 wherein the step of processing includes removing any heap elements containing said first vertex.
26 . The process of claim 24 further including the step of determining a whether the substituted second vertex is a boundary vertex.