Name
Abstract | ||
|---|---|---|
This paper describes an ecient and robust algorithm for computing a common renement of two meshes modeling a common surface of arbitrary shape by overlaying them on top of each other. A common renement is an impor- tant data structure for transferring data between meshes that have dierent topological structures. Our algorithm is optimal in time and space, with linear complexity. Special treatments are introduced to handle discretization and rounding errors and to ensure robustness with imprecise computations. It also addresses the additional com- plexities caused by degeneracies, sharp edges, sharp corners, and nonmatching boundaries. The algorithm has been implemented and demonstrated to be robust for complex geometries from real-world applications. |
Year | Venue | Field |
|---|---|---|
2001 | IMR | Discretization,Data structure,Polygon mesh,Spacetime,Algorithm,Robustness (computer science),Rounding,Overlay,Mathematics,Computation |
DocType | Citations | PageRank |
Conference | 1 | 0.44 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiangmin Jiao | 1 | 327 | 31.80 |
| Michael T. Heath | 2 | 366 | 73.58 |