Name
Abstract | ||
|---|---|---|
In Part I, we described an efficient and robust algorithm for computing a common refinement of two surface meshes. In this paper, we present a theoretical verification of the robustness of our algorithm by showing the topological preservation of the intersection principle, which we used to resolve topological inconsistencies caused by numerical errors. To enhance robustness in practice for complex geometries, we further propose techniques to detect and match geometric features, such as ridges, corners, and nonmatching boundaries. We report experimental results using our enhanced overlay algorithm with feature matching for complex geometries from real-world applications. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1142/S0218195904001524 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
computational geometry, mesh overlay, common refinement, robustness, topology preservation, feature detection, matching | Journal | 14 |
Issue | ISSN | Citations |
6 | 0218-1959 | 9 |
PageRank | References | Authors |
0.74 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiangmin Jiao | 1 | 327 | 31.80 |
| Michael T. Heath | 2 | 366 | 73.58 |