投影器的标定方法

随着近景摄影测量的发展,投影器的使用越来越频繁和广泛。为了更好地使用和充分地利用投影器,需要求解投影器的内方位元素,即对投影器进行标定。提出了一种方便有效的投影器标定的方法。只需要一架投影器、一部数码相机、一个平面格网和一台计算机,设备的连接和使用相对方便灵活。基于近景摄影测量的理论,结合二维直接线性变换(2D-DLT)和共线方程,运用图像处理的方法,利用光束法平差对投影器进行标定。实验及其结果证明了该标定方法的正确性和有效性。     

非结构网格上温度扩散方程的能流计算方法

讨论非结构网格上温度扩散方程的能流计算方法.应用有限点方法(Finite Point Method,简称FPM)导出基于有限点两点公式和三点公式的能流计算公式,该公式适用于任意多边形及非匹配网格等非结构网格;给出网格角点温度新的计算公式.数值试验表明:基于两点公式的离散解和基于三点公式的离散解均具有平方阶的收敛速度;基于三点公式的离散解的精度总优于基于两点公式的离散解.     

A local domain‐free discretization method for simulation of incompressible flows over moving bodies

This paper presents a local domain‐free discretization (DFD) method for the simulation of unsteady flows over moving bodies governed by the incompressible Navier–Stokes equations. The discretization strategy of DFD is that the discrete form of partial differential equations at an interior point may involve some points outside the solution domain. All the mesh points are classified as interior points, exterior dependent points and exterior independent points. The functional values at the exterior dependent points are updated at each time step by the approximate form of solution near the boundary. When the body is moving, only the status of points is changed and the mesh can stay fixed. The issue of ‘freshly cleared nodes/cells’ encountered in usual sharp interface methods does not pose any particular difficulty in the presented method. The Galerkin finite‐element approximation is used for spatial discretization, and the discrete equations are integrated in time via a dual‐time‐stepping scheme based on artificial compressibility. In order to validate the present method for moving‐boundary flow problems, two groups of flow phenomena have been simulated: (1) flows over a fixed circular cylinder, a harmonic in‐line oscillating cylinder in fluid at rest and a transversely oscillating cylinder in uniform flow; (2) flows over a pure pitching airfoil, a heaving–pitching airfoil and a deforming airfoil. The predictions show good agreement with the published numerical results or experimental data. Copyright © 2010 John Wiley & Sons, Ltd.     

Numerical simulation of 2D lid‐driven cavity flow with CLEARER algorithm on extremely highly skewed grids at high Reynolds numbers

It is crucial to deal with the grid non‐orthogonality effectively in solving the flow in complex geometries, especially at high Reynolds numbers. In this study, the newly proposed Coupled and Linked Equations Algorithm Revised‐ER (CLEARER) algorithm is adopted to solve this problem successfully. In CLEARER algorithm the second relaxation factor is introduced in constructing the contravariant interface velocities, by setting it to a low value. CLEARER algorithm can overcome the severe grid non‐orthogonality and non‐linearity of equations effectively. After the numerical results with CLEARER are validated with the benchmark solutions, this algorithm is used to solve the lid‐driven flow in inclined cavity with inclination angles varying from 10 to 170^°, and Reynolds numbers varying from 5000 to 15 000. The streamlines and the centerline velocity distributions are provided in detail for all cases, which may offer some guidance for the study in this area. Copyright © 2010 John Wiley & Sons, Ltd.     

Conceptual linearization of Euler governing equations to solve high speed compressible flow using a pressure‐based method

The main objective of the current work is to introduce a new conceptual linearization strategy to improve the performance of a primitive shock‐capturing pressure‐based finite‐volume method. To avoid a spurious oscillatory solution in the chosen collocated grids, both the primitive and extended methods utilize two convecting and convected momentum expressions at each cell face. The expressions are obtained via a physical‐based discretization of two inclusive statements, which are constructed via a novel incorporation of the continuity and momentum governing equations. These two expressions in turn provide a strong coupling among the Euler conservative statements. Contrary to the primitive work, the linearization in the current work respects the definitions and essence of physics behind deriving the Euler governing equations. The accuracy and efficiency of the new formulation are then investigated by solving the shock tube as a problem with moving normal and expansion waves and the converging‐diverging nozzle as a problem with strong stationary normal shock. The results show that there is good improvement in performance of the primitive pressure‐based shock‐capturing method while its superior accuracy is not deteriorated at all. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

A vortex axis and vortex core border grid adaptation algorithm

In the design process of hydrodynamical and aerodynamical technical applications, the numerical simulation of massively separated vortical flow is crucial for predicting, for example, lift or drag. To obtain reliable numerical results, it is mandatory to accurately predict the physical behavior of vortices. Thus, the dominant vortical flow structures have to be resolved in detail, which requires a local grid refinement and certain adaptation techniques. In this paper, a vortex flow structure adaptation algorithm is presented, which is particularly designed for local grid refinement at vortex axes positions and associated vortex core border locations. To this end, a fast and efficient vortex axis detection scheme is introduced and the algorithm for the vortex core border determination is explained. As the interaction between vortices makes the assignment of grid points to a certain vortex axis difficult, a helicity‐based vortex distinction approach in combination with a geometrical rotational sensor is developed. After describing the combined different techniques in detail, the vortex feature adaptation algorithm is applied to analytical and more realistic examples, which show that the described grid adaptation algorithm is able to enhance the grid cell resolution locally such that all significant vortical flow phenomena are resolved. Copyright © 2008 John Wiley & Sons, Ltd.     

CartGen: Robust,efficient and easy to implement uniform/octree/embedded boundary Cartesian grid generator

An efficient and easy to implement method to generate Cartesian grids is presented. The presented method generates various kinds of Cartesian grids such as uniform, octree and embedded boundary grids. It supports the variation of grid size along each spatial direction as well as anisotropic and non‐graded refinements. The efficiency and ease of implementation are the main benefits of the presented method in contrast to the alternative methods. Regarding octree grid generation, applying a simple and efficient data compression method permits to store all grid levels without considerable memory overhead. The presented method generates octree grids up to a 13‐level refinement (8192³ grids on the finest level) from a complicated geometry in a few minutes on the traditional desktop computers. The FORTRAN 90 implementation of the presented method is freely available under the terms of the GNU general public license. Copyright © 2007 John Wiley & Sons, Ltd.     

Angular multiplexed holographic memory system based on moving window on liquid crystal display and its crosstalk analysis

We suggested a new non-mechanical angular multiplexed holographic memory system using a moving window, which was fabricated by controlling the pixels of a liquid crystal display (LCD) electronically. If we use light passed through the window left and right, and up and down, each window makes a reference wave with a different incidence angle and we can store angular-multiplexed holograms. The feasibility of the proposed method was demonstrated through optical experiments and its crosstalk noise analysis was also presented.