Digital Library

of the European Council for Modelling and Simulation



Reliable Joining Of Surfaces For Combined Mesh-Surface Models


Di Jiang, Neil F. Stewart

Published in:


ECMS 2007 Proceedings

Edited by: Ivan Zelinka, Zuzana Oplatkova, Alessandra Orsoni


ISBN: 978-0-9553018-2-7

Doi: 10.7148/2007


21st European Conference on Modelling and Simulation,

Prague, June 4-6, 2007


Citation format:

iang, D., & Stewart, N. F. (2007). Reliable Joining Of Surfaces For Combined Mesh-Surface Models. ECMS 2007 Proceedings edited by: I. Zelinka, Z. Oplatkova, A. Orsoni (pp. 297-303). European Council for Modeling and Simulation. doi:10.7148/2007-0297.



Algorithms to join two mesh patches along an edge are of immediate practical interest in the context of higher-level opera- tions on models of objects formed by such mesh patches. Such models are widely used in graphical visualization and simulation, shape in- terrogation, and other areas. Thus, there are now available methods to join two subdivision surfaces along a common edge curve, as well as methods to join mesh patches that approximate given trimmed-surface patches. The latter problem is studied in this paper.

The auxiliary information available to the algorithm, in the context of surface joining, varies, depending upon circumstances. In partic- ular, it may or may not be true that an explicit common edge curve, representing the boundary between the two patches to be joined, is available as part of the data. Even in the case, however, when max- imal auxiliary information is available algorithms are not necessarily reliable. For example, methods that do not use normal-vector error criteria, to measure the discrepancy between the surface patch and the associated mesh patch, can produce poor results, due to large changes in the normal direction of a triangle near the mesh boundary. It is even possible to give examples where the triangles near the joined bound- ary are turned upside down by the joining process, so that computed meshes self-intersect. In this paper an algorithm is presented that uses a proxy for a normal-vector error criterion, and the Whitney extension theorem, to produce reliable algorithms. Examples are given, and an implementation is described.

Full text: