Proceedings ArticleDOI
Dual/Primal mesh optimization for polygonized implicit surfaces
Yutaka Ohtake,Alexander Belyaev +1 more
- pp 171-178
Reads0
Chats0
TLDR
A new method for improving polygonizations of implicit surfaces with sharp features is proposed, which outperforms approaches based on the mesh evolution paradigm in speed and accuracy.Abstract:
A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard marching cubes mesh Lorensen(in our experiments we use VTK marching cubes VTK). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that "double dual" mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.read more
Citations
More filters
Proceedings ArticleDOI
Multi-level partition of unity implicits
TL;DR: A new shape representation is presented, the multi-level partition of unity implicit surface, that allows us to construct surface models from very large sets of points, and can accurately represent sharp features such as edges and corners by selecting appropriate shape functions.
Journal ArticleDOI
Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids
TL;DR: This paper introduces a method to extract 'Shape-DNA', a numerical fingerprint or signature, of any 2d or 3d manifold by taking the eigenvalues (i.e. the spectrum) of its Laplace-Beltrami operator and succeeds in computing eigen values for smoothly bounded objects without discretization errors caused by approximation of the boundary.
Journal ArticleDOI
Noise removal using smoothed normals and surface fitting
TL;DR: This work uses partial differential equation techniques to remove noise from digital images using a total-variation filter to smooth the normal vectors of the level curves of a noise image and finite difference schemes are used to solve these equations.
A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions
TL;DR: The numerical experiments suggest that the approach integrates the best aspects of scattered data fitting with locally and globally supported basis functions and is essentially faster than the state-of-the-art scattered data approximation with globally supported RBFs and much simpler to implement.
Proceedings ArticleDOI
A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions
TL;DR: In this article, a hierarchical approach to 3D scattered data interpolation with compactly supported basis functions is proposed, which integrates the best aspects of scattered data fitting with locally and globally supported RBFs.
References
More filters
Journal ArticleDOI
Feature Sensitive Remeshing
TL;DR: A new remeshing technique that is sensitive to features is proposed that is iteratively adapted by a global restructuring process which additionally optimizes the connectivity and extended by an effective mechanism to attract the vertices to feature edges.
Journal ArticleDOI
Simple and efficient polygonization of implicit surfaces
TL;DR: A simple and efficient polygonization algorithm that gives a practical way to construct adapted piecewise linear representations of implicit surfaces by separating structuring from sampling and reducing part of the full three-dimensional search to two dimensions.
Proceedings ArticleDOI
Dynamic meshes for accurate polygonization of implicit surfaces with sharp features
TL;DR: The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
Journal ArticleDOI
Polygonization of implicit surfaces with constructive solid geometry
Brian Wyvill,Kees van Overveld +1 more
TL;DR: A polygonization algorithm is presented which extends an existing skeletal implicit surface technique to include operations based on Constructive Solid Geometry between blended groups of implicit surface objects, resulting in a surface definition which consists of a boolean expression with union, intersection, and set difference operators.
Journal ArticleDOI
Mesh Optimization for Polygonized Isosurfaces
Yutaka Ohtake,Alexander Belyaev +1 more
TL;DR: This paper introduces a mesh evolution process initialized by the polygonization of an isosurface, and introduces error estimators measuring the deviations of the mesh vertices from the isOSurface and mesh normals from theIsosurfaces normals.