Tree-shaped flow structures designed by minimizing path lengths

This paper outlines a direct route to the construction of effective tree-shaped flow structures. Dendritic flow structures dominate the design of natural and engineered flow systems, especially in thermal and fluid systems. The starting point is the optimization of the shape of each elemental area or volume, such that the length of the flow path housed by the element is minimized. Proceeding toward larger and more complex structures - from elements, to first constructs, second constructs, etc. - the paper develops tree-shaped flow structures between one point and a straight line, one point and a plane, a circle and its center, and a point and many points distributed uniformly over an area. In the latter, the construction method is applied to a fluid flow configuration with laminar fully developed flow. The constructions reveal several features that are supported by empirical observations of natural tree-shaped flows: asymmetry, flow rate imbalance, pairing or bifurcation, angles between branches, and Y-shaped constructs that lie in a plane. It is shown that these basic features are necessary because of “packing”, i.e., assembling optimized elements into a fixed space, and filling the space completely. For the flow between an area and one point, the best elemental shape is the regular hexagon. It is shown that the emergence of string-shaped links that connect two or more elements are necessary features, which are also required by packing. Strings cover some of the inner zones of the tree network, particularly the inner zones of large and complex trees. Dichotomous Y-shaped constructs dominate the tree structure, especially the peripheral zones of the tree canopy. The practical importance of the simplified design method is discussed.     

求解复杂形状旋转体拉延毛坯直径的新方法--计算机作图查询法

提出了基于AutoCAD软件的确定复杂形状旋转体拉延毛坯直径的方法－计算机作图查询法，这种方法操作严谨，结果准确，比原有的3种方法简捷、快速，是一种值得推广的好方法。     

二维地震过障碍观测系统模式及其参数设计

在二维地震勘探中,为了避免因地表障碍物使地震反射剖面出现间断现象,需要改变观测系统设计,跨越障碍物(江河、城镇等),以保证反射同相轴能连续追踪对比。在以往地震勘探中,有时因过障碍观测系统设计不合理,不但增加勘探费用,而且影响采集质量。因此只有科学合理地设计过障碍观测系统模式和参数,才能保证地震测线顺利通过障碍物,得到较好的障碍物下方的地震资料并降低勘探成本。为此本文在调查和研究大量野外实际的过障碍观测系统的基础上,总结归纳成三大类过障碍观测系统模式,并分析其特点和应用范围。采用图解法,推导出主要模式的跨越宽度、最小炮检距及最大炮检距等参数公式。采用这套过障碍观测模式不仅可以得到和障碍区两侧等质量的地震资料,而且可以有效地降低勘探成本。     

Applications of the 4×4 determinant method and the POLYGON ENGINE

In the first half of the paper, various types of processing pertaining to a polygon, using the 4×4 determinant theories are explained along with a new containment test algorithm of a point in a polygon. In the latter half of the paper, a general-purpose geometric processor, the POLYGON ENGINE, is presented which can deal with various types of interference problems, such as Boolean operations in solid modelling, hidden line and surface eliminations, ray tracing and so on. It is, a successor of the TRIANGLE PROCESSOR and is also based upon the 4×4 determinant theories [4–6]. While the TRIANGLE PROCESSOR processes a triangulated polygon on a triangle-by-triangle basis, the POLYGON ENGINE can treat a polygon without triangulation. The latter is expected to be more functional, more efficient and easier to use.     

用MAXScript脚本语言生成分形图形

介绍了分形生成技术的原理与性质、MAXScript脚本语言的特点及功能，详细叙述了用MAXScript脚本语言生成分形图形的设计思想和实现方法。针对分形几何的特点，以具有严格自相似性的分形树为例，通过解释源代码、描述程序运行过程和结果，以及对生成的图片用3DSMAX进行再处理，分析了在3DSMAX环境中用MAXScript脚本语言生成分形图形这一新方法的优点和不足。     

Effects of Working Fluid,Tubeside Enhancement and Bundle Depth on the Optimized Fin Geometry of a Horizontal Condenser Tube

A theoretical study has been made to optimize the fin geometry of a horizontal finned tube which is to be usedfor condensers that handle the vapor load of a liquid phase change cooling module.Systematic numerical calcu-lations of the vapor to coolant heat transfer have been performed for parametric values of fin height,fin spacing,vertical bundle depth and tubeside heat transfer coefficient.Three dielectric fluids (R-113,FC-72,and FC-87)at atmospheric pressure were selected as the working fluids.For a single tube with optimized fin geometry,theaverage heat flux increased in the order of FC-87,R-113 and FC-72.Both the optimum fin height and optimumfin spacing increased with increasing vertical bundle depth.     

Periodic surface modeling for computer aided nano design

Current solid and surface modeling methods based on Euclidean geometry in traditional computer aided design are not efficient in constructing a large number of atoms and particles. In this paper, we propose a periodic surface model for computer aided nano design such that geometry of atoms and molecules can be constructed parametrically. At the molecular scale, periodicity of the model allows thousands of particles to be built efficiently. At the meso scale, inherent porosity of the model represents natural morphology of polymer and macromolecule. Surface and volume operations are defined to support crystal and molecular model creation with loci and foci periodic surfaces. The ultimate goal is to enable computer assisted material and system design at atomic, molecular, and meso scales.     

利用计算机进行油气资源评价和勘探决策

本文着重介绍了构成《现代勘探决策理论系统》的5个主要计算机模块,即:生油岩热演化处理、求任意曲边形面积、数学模拟预测资源量、勘探经济评价分析及决策、辅助处理等模块。该系统曾在塔里木盆地和准噶尔盆地的油气资源评价和勘探决策中发挥了作用,受到了专家和用户的好评。     

Note on covering monotone orthogonal polygons with star-shaped polygons

In 1986, Keil provided an O(n²) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space.     

Determining the Castability of Simple Polyhedra

A polyhedron P is castable if its boundary can be partitioned by a plane into two polyhedral terrains. Castable polyhedra can be manufactured easily using two cast parts, where each cast part can be removed from the object without breaking the cast part or the object. If we assume that the cast parts are each removed by a single translation, it is shown that for a simple polyhedron with n vertices, castability can be decided in time and linear space using a simple algorithm. A more complicated algorithm solves the problem in time and space, for any fixed ε > 0. In the case where the cast parts are to be removed in opposite directions, a simple O(n ² )-time algorithm is presented. Finally, if the object is a convex polyhedron and the cast parts are to be removed in opposite directions, a simple algorithm is presented. Received June 1, 1994; revised May 25, 1995.