2,982 research outputs found
Density-equalizing maps for simply-connected open surfaces
In this paper, we are concerned with the problem of creating flattening maps
of simply-connected open surfaces in . Using a natural principle
of density diffusion in physics, we propose an effective algorithm for
computing density-equalizing flattening maps with any prescribed density
distribution. By varying the initial density distribution, a large variety of
mappings with different properties can be achieved. For instance,
area-preserving parameterizations of simply-connected open surfaces can be
easily computed. Experimental results are presented to demonstrate the
effectiveness of our proposed method. Applications to data visualization and
surface remeshing are explored
Gap Processing for Adaptive Maximal Poisson-Disk Sampling
In this paper, we study the generation of maximal Poisson-disk sets with
varying radii. First, we present a geometric analysis of gaps in such disk
sets. This analysis is the basis for maximal and adaptive sampling in Euclidean
space and on manifolds. Second, we propose efficient algorithms and data
structures to detect gaps and update gaps when disks are inserted, deleted,
moved, or have their radius changed. We build on the concepts of the regular
triangulation and the power diagram. Third, we will show how our analysis can
make a contribution to the state-of-the-art in surface remeshing.Comment: 16 pages. ACM Transactions on Graphics, 201
Recent advances in unstructured grid generation program VGRID3D
A program for the generation of unstructured grids over complex configurations, VGRID3D, is described. The grid elements (triangles on the surfaces and tetrahedra in the field) are generated starting from the surface boundaries towards the interior of the computational domain using the Advancing Front Method
Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement
The typical goal of surface remeshing consists in finding a mesh that is (1)
geometrically faithful to the original geometry, (2) as coarse as possible to
obtain a low-complexity representation and (3) free of bad elements that would
hamper the desired application. In this paper, we design an algorithm to
address all three optimization goals simultaneously. The user specifies desired
bounds on approximation error {\delta}, minimal interior angle {\theta} and
maximum mesh complexity N (number of vertices). Since such a desired mesh might
not even exist, our optimization framework treats only the approximation error
bound {\delta} as a hard constraint and the other two criteria as optimization
goals. More specifically, we iteratively perform carefully prioritized local
operators, whenever they do not violate the approximation error bound and
improve the mesh otherwise. In this way our optimization framework greedily
searches for the coarsest mesh with minimal interior angle above {\theta} and
approximation error bounded by {\delta}. Fast runtime is enabled by a local
approximation error estimation, while implicit feature preservation is obtained
by specifically designed vertex relocation operators. Experiments show that our
approach delivers high-quality meshes with implicitly preserved features and
better balances between geometric fidelity, mesh complexity and element quality
than the state-of-the-art.Comment: 14 pages, 20 figures. Submitted to IEEE Transactions on Visualization
and Computer Graphic
Recommended from our members
Drop deformation in stokes flow through converging channels
This work presents an application of a direct BEM formulation for drop
deformation and interaction in Stokes flows through converging channels. Parametric
studies are conducted to investigate the effect, on drop deformation, of the channel’s
convergence ratio, the drop-fluid viscosity ratio, the interfacial tension and the initial
relative position of the drops
SPH method applied to high speed cutting modelling
The purpose of this study is to introduce a new approach of high speed cutting numerical modelling. A Lagrangian smoothed particle hydrodynamics (SPH)- based model is arried out using the Ls-Dyna software. SPH is a meshless method, thus large material distortions that occur in the cutting problem are easily managed and SPH contact control permits a "natural" workpiece/chip separation. The developed approach is compared to machining dedicated code results and experimental data. The SPH cutting model has proved is ability to account for continuous to shear localized chip formation and also correctly estimates the cutting forces, as illustrated in some orthogonal cutting examples. Thus, comparable results to machining dedicated codes are obtained without introducing any adjusting numerical parameters (friction coefficient, fracture control parameter)
- …