| Author | Ramamoorthy Ravichandran |
|---|---|
| Title | Matching Meshes on Specific Model Boundaries |
| Year | 1995 |
| School | Civil Engineering |
| Institution | RPI |
| Abstract | In this thesis a mesh matching procedure has been developed to superimpose a new valid mesh on a model face. The procedure works from the valid mesh of the domain and the new face mesh that needs to be created on the model face. The mesh matching procedures developed modifies the existing mesh on the model face to reflect the topology and the geometry of new mesh on the model face. The mesh matching procedure is applied as the last step in the mesh generation process and is used only if mesh matching is required. This thesis also describes some of the tools that are required by the mesh matching procedures. Some of the procedures need efficient data structure to quickly determine if two mesh entities intersect. These procedures are very useful when the size of the mesh is large. Several different data structures that can help in efficient determination of intersecting mesh entities have been studied. A new data structure called pseudo Alternating Digital Tree has been proposed which attempts to solve some of the draw backs of the existing data structures while maintaining their basic advantages. The proposed data structure stores the bounding boxes of the entities and returns if the bounding boxes of the entities intersect. Further calculations are necessary to find if the entities actually intersect. |