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 ofthe 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
Surface acquisition methods are becoming popular for many practical applications in manufacturing, a...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
This paper presents an algorithm for sampling and triangulating a smooth surface ∑ ⊂ ℝ<sup>3</sup> w...
This paper introduces a method for accurately computing the visible con-tours of a smooth 3D surface...
This paper presents an extended surface boundary representation (B-rep), where each topology entity ...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Abstract Geometry images parameterise a mesh with a square domain and store the information in a sin...
This article introduces a method for partial matching of surfaces represented by triangular meshes. ...
A popular technique for rendition of isosurfaces in sampled data is to consider cells with sample po...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Abstract: In this work, we use concepts from digital topology for the topological filtering of recon...
Most deformable surfaces used in computer vision are restricted to a simple underlying mesh topology...
Surface or shape reconstruction from 3D digitizations, range pictures play an important role as the ...
Surface or shape reconstruction from 3D digitizations, range pictures play an important role as the ...
Surface acquisition methods are becoming popular for many practical applications in manufacturing, a...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
This paper presents an algorithm for sampling and triangulating a smooth surface ∑ ⊂ ℝ<sup>3</sup> w...
This paper introduces a method for accurately computing the visible con-tours of a smooth 3D surface...
This paper presents an extended surface boundary representation (B-rep), where each topology entity ...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Abstract Geometry images parameterise a mesh with a square domain and store the information in a sin...
This article introduces a method for partial matching of surfaces represented by triangular meshes. ...
A popular technique for rendition of isosurfaces in sampled data is to consider cells with sample po...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Abstract: In this work, we use concepts from digital topology for the topological filtering of recon...
Most deformable surfaces used in computer vision are restricted to a simple underlying mesh topology...
Surface or shape reconstruction from 3D digitizations, range pictures play an important role as the ...
Surface or shape reconstruction from 3D digitizations, range pictures play an important role as the ...
Surface acquisition methods are becoming popular for many practical applications in manufacturing, a...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
This paper presents an algorithm for sampling and triangulating a smooth surface ∑ ⊂ ℝ<sup>3</sup> w...