An efficient adaptive multigrid algorithm for predicting thin film flow on surfaces containing localised topographic features

Gravity-driven continuous thin film flow over a plane, containing well-defined single and grouped topographic features, is modelled as Stokes flow using lubrication theory. The associated time-dependent, nonlinear, coupled set of governing equations is solved using a full approximation storage (FAS) multigrid algorithm by employing automatic mesh adaptivity, the power, efficiency and accuracy of which is demonstrated by comparing the results with corresponding global fine-mesh solutions. These show that automatic grid refinement effectively restricts the use of fine grids to regions of rapid flow development which, for the topographies considered, includes the topography itself, the upstream Capillary ridge, downstream surge region, and the characteristic bow wave. It is shown that for the accurate solution of the associated lubrication equations, adaptive multigrid offers increased flexibility together with a significant reduction in memory requirement. This is further demonstrated by solving the problem of transient flow over a trench topography, generated by a sinusoidally varying inlet condition.     

Inertial thin film flow on planar surfaces featuring topography

A range of problems is investigated, involving the gravity-driven inertial flow of a thin viscous liquid film over an inclined planar surface containing topographical features, modelled via a depth-averaged form of the governing unsteady Navier-Stokes equations. The discrete analogue of the resulting coupled equation set, employing a staggered mesh arrangement for the dependent variables, is solved accurately using an efficient full approximation storage (FAS) algorithm and a full multigrid (FMG) technique; together with error-controlled automatic adaptive time-stepping and proper treatment of the associated nonlinear convective terms. An extensive set of results is presented for flow over both one- and two-dimensional topographical features, and errors quantified via detailed comparisons drawn with complementary experimental data and predictions from finite element analyses where they exist. In the case of one-dimensional (spanwise) topography, moderate Reynolds numbers and shallow/short topographical features, the results obtained are in close agreement with corresponding finite element solutions of the full free-surface problem. For the case of flow over two-dimensional (localised) topography, it is shown that the free-surface disturbance is influenced significantly by the presence of inertia leading, as in the case of spanwise topography, to an increase in the magnitude and severity of the resulting capillary ridge and trough formations: the effect of inclination angle and topography aspect ratio are similarly explored.     

Polynomial surfaces interpolating arbitrary triangulations

Triangular Bezier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bezier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we introduce a new method for visually smooth interpolation of arbitrary triangle meshes based on a regular 4-split of the domain triangles. Ensuring tangent plane continuity of the surface is not enough for producing an overall fair shape. Interpolation of irregular control-polygons, be that in 1D or in 2D, often yields unwanted undulations. Note that this undulation problem is not particular to parametric interpolation, but also occurs with interpolatory subdivision surfaces. Our new method avoids unwanted undulations by relaxing the constraint of the first derivatives at the input mesh vertices: The tangent directions of the boundary curves at the mesh vertices are now completely free. Irregular triangulations can be handled much better in the sense that unwanted undulations due to flat triangles in the mesh are now avoided.     

Recursively generated B-spline surfaces on arbitrary topological meshes

This paper describes a method for recursively generating surfaces that approximate points lying-on a mesh of arbitrary topology. The method is presented as a generalization of a recursive bicubic B-spline patch subdivision algorithm. For rectangular control-point meshes, the method generates a standard B-spline surface. For non-rectangular meshes, it generates surfaces that are shown to reduce to a standard B-spline surface except at a small number of points, called extraordinary points. Therefore, everywhere except at these points the surface is continuous in tangent and curvature. At the extraordinary points, the pictures of the surface indicate that the surface is at least continuous in tangent, but no proof of continuity is given. A similar algorithm for biquadratic B-splines is also presented.     

Method of direct texture synthesis on arbitrary surfaces

A direct texture synthesis method on arbitrary surfaces is proposed in this paper. The idea is to recursively map triangles on surface to texture space until the surface is completely mapped. First, the surface is simplified and a tangential vector field is created over the simplified mesh. Then, mapping process searches for the most optimal texture coordinates in texture sample for each triangle, and the textures of neighboring triangles are blended on the mesh. All synthesized texture triangles are compressed to an atlas. Finally, the simplified mesh is subdivided to approach the initial surface. The algorithm has several advantages over former methods: it synthesizes texture on surface without local parameterization; it does not need partitioning surface to patches; and it does not need a particular texture sample. The results demonstrate that the new algorithm is applicable to a wide variety of texture samples and any triangulated surfaces.     

Hexagonal global parameterization of arbitrary surfaces

We introduce hexagonal global parameterization, a new type of surface parameterization in which parameter lines respect sixfold rotational symmetries (6-RoSy). Such parameterizations enable the tiling of surfaces with nearly regular hexagonal or triangular patterns, and can be used for triangular remeshing. Our framework to construct a hexagonal parameterization, referred to as HEXCOVER, extends the QUADCOVER algorithm and formulates necessary conditions for hexagonal parameterization. We also provide an algorithm to automatically generate a 6-RoSy field that respects directional and singularity features in the surface. We demonstrate the usefulness of our geometry-aware global parameterization with applications such as surface tiling with nearly regular textures and geometry patterns, as well as triangular and hexagonal remeshing.     

基于块的任意曲面上的纹理合成

一种新的曲面纹理合成技术被提出,它采用求最小割集来解决块拼接时的礁缝走样问题。算法在预处理期对模型的三维网格进行了重建,使其规则并且建立网格点与参数化栅格采样后的图像点一一对应的关系,无论对合成的速度和质量都有很大的提高。提出了在曲面上进行纹理粘贴的算法,对于渲染存在不完整性的自然物体取得了较好的效果。     

Reconstruction of planar surfaces behind occlusions in range images

Analysis and reconstruction of range images usually focuses on complex objects completely contained in the field of view; little attention has been devoted so far to the reconstruction of simply shaped wide areas like parts of a wall hidden behind furniture pieces in an indoor range image. The work presented in the paper is aimed at such reconstruction. First of all, the range image is partitioned based on depth discontinuities and fold edges. Next, the planes best fitting each of the regions constituting the partition of the image are determined. A third step locates potentially contiguous surfaces, while a final step reconstructs the hidden regions. The paper presents results for reconstruction of the shape of planar surfaces behind arbitrary occluding surfaces. The system proved to be effective and the reconstructed surfaces appear to be reasonable. Some examples of results are presented from the Bornholm church range images     

Finite volume flow simulations on arbitrary domains

We present a novel method for solving the incompressible Navier–Stokes equations that more accurately handles arbitrary boundary conditions and sharp geometric features in the fluid domain. It uses a space filling tetrahedral mesh, which can be created using many well-known methods, to represent the fluid domain. Examples of the method’s strengths are illustrated by free surface fluid simulations and smoke simulations of flows around objects with complex geometry.     

任意散乱点集的B-样条曲面重建

为了解决工业设计中复杂形体的曲面造型问题,提出了一种张量积型的低阶B-样条曲面重建算法。先将采集到的任意拓扑形状的散乱数据点进行三次不同的参数化得到四边形控制网格,然后再采用张量积型的双二次、双三次B-样条进行拟合,在拟合的过程中采用距离函数来控制拟合误差,得到光滑的曲面。运用该方法,直接对初始散乱点集进行重建,方法简单易实施,重建效率高并且重建后的样条曲面自然满足切平面连续。与以往的方法相比,该方法在逆向工程中可以在保证连续性的情况下,得到精准的结果曲面,提高了曲面造型的质量和效率。     

Synthesis and rendering of bidirectional texture functions on arbitrary surfaces

The bidirectional texture function (BTF) is a 6D function that describes the appearance of a real-world surface as a function of lighting and viewing directions. The BTF can model the fine-scale shadows, occlusions, and specularities caused by surface mesostructures. In this paper, we present algorithms for efficient synthesis of BTFs on arbitrary surfaces and for hardware-accelerated rendering. For both synthesis and rendering, a main challenge is handling the large amount of data in a BTF sample. To addresses this challenge, we approximate the BTF sample by a small number of 4D point appearance functions (PAFs) multiplied by 2D geometry maps. The geometry maps and PAFs lead to efficient synthesis and fast rendering of BTFs on arbitrary surfaces. For synthesis, a surface BTF can be generated by applying a texton-based sysnthesis algorithm to a small set of 2D geometry maps while leaving the companion 4D PAFs untouched. As for rendering, a surface BTF synthesized using geometry maps is well-suited for leveraging the programmable vertex and pixel shaders on the graphics hardware. We present a real-time BTF rendering algorithm that runs at the speed of about 30 frames/second on a mid-level PC with an ATI Radeon 8500 graphics card. We demonstrate the effectiveness of our synthesis and rendering algorithms using both real and synthetic BTF samples.     

Flow charts: visualization of vector fields on arbitrary surfaces

We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme the surface and its associated flow are segmented into overlapping patches which are then parameterized and packed in the texture domain. This scheme allows accurate particle advection across multiple charts in the texture domain, providing a flexible framework that supports various flow visualization techniques. The use of surface parameterization enables flow visualization techniques requiring the global view of the surface over long time spans, such as Unsteady Flow LIC (UFLIC), particle-based Unsteady Flow Advection-Convolution (UFAC), or dye advection. It also prevents visual artifacts normally associated with view-dependent methods. Represented as textures, Flow Charts can be naturally integrated into GPU flow visualization techniques for interactive performance.     

Effects of interface deformation on flow through microtubes containing superhydrophobic surfaces with longitudinal ribs and grooves

This paper presents analytical and numerical results for Poiseuille flow through microtubes patterned with superhydrophobic surfaces which consist of alternative ribs and grooves aligned longitudinally with the flow direction. The superhydrophobic surface prevents the flowing liquid from penetrating the grooves and the liquid–gas interface experiences deformation as a consequence of a pressure difference across the interface. Employing a domain perturbation technique, the effects of a small interface deformation on the effective slip behavior are analytically quantified. For large interface deformations, numerical studies are performed to predict the effects of interface protrusion on the effective slip behavior of the superhydrophobic microtube. Comparisons are made between the effective slip behavior for tube and channel flows patterned with superhydrophobic surfaces containing alternating longitudinal ribs and grooves.     

Interpolation of arbitrary spaced points by closed surfaces

A procedure using spherical coordinates is devised to interploate points in two (resp. three) dimensional spaces by closed smooth curves (resp. surfaces). It can be applied to any of the existing methods for interpolating points. In this article, the Shepard and Maude methods are considered. The interpolation depends upon the choice of a “pole”, therefore, is not unique and, thus, can be controlled at will up to some extent.     

Texture mapping on surfaces of arbitrary topology using norm preserving-based optimization

A simple and yet highly efficient, high-quality texture mapping method for surfaces of arbitrary topology is presented. The new method projects the given surface from the 3D object space into the 2D texture space to identify the 2D texture structure that will be used to texture the surface. The object space to texture space projection is optimized to ensure minimum distortion of the texture mapping process. The optimization is achieved through a commonly used norm preserving minimization process on edges of the surface. The main difference here is, by using an initial value approach, the optimization problem can be set up as a quadratic programming problem and, consequently, solved by a linear least squares method. Three methods to choose a good initial value are presented. Test cases show that the new method works well on surfaces of arbitrary topology, with the exception of surfaces with exceptionally abnormal curvature distribution. Other advantages of the new method include uniformity and seamlessness of the texture mapping process. The new method is suitable for applications that do not require precise texture mapping results but demand highly efficient mapping process such as computer animation or video games.     

Thin film shape memory alloy microactuators

Thin film shape memory alloys (SMAs) have the potential to become a primary actuating mechanism for mechanical devices with dimensions in the micron-to-millimeter range requiring large forces over long displacements. The work output per volume of thin film SMA microactuators exceeds that of other microactuation mechanisms such as electrostatic, magnetic, thermal bimorph, piezoelectric, and thermopneumatic, and it is possible to achieve cycling frequencies on the order of 100 Hz due to the rapid heat transfer rates associated with thin film devices. In this paper, a quantitative comparison of several microactuation schemes is made, techniques for depositing and characterizing Ni-Ti-based shape memory films are evaluated, and micromachining and design issues for SMA microactuators are discussed. The substrate curvature method is used to investigate the thermo-mechanical properties of Ni-Ti-Cu SMA films, revealing recoverable stresses up to 510 MPa, transformation temperatures above 32°C, and hysteresis widths between 5 and 13°C. Fatigue data shows that for small strains, applied loads up to 350 MPa can be sustained for thousands of cycles. Two micromachined shape memory-actuated devices-a microgripper and microvalve-also are presented     

Generation of high order surfaces over arbitrary polyhedral meshes

A new algorithm for generating high order surfaces over arbitrary meshes will be discussed in this paper. This technique offers more freedom to the designer for controlling the shape of free-form objects in order to meet the various constraints. It also has the advantage of being compatible with B-spline surfaces over rectangular grids of points.