区域填充扫描线算法的硬件设计与实现

在图形处理器(GPU)的研究中,提高图形加速器的描绘速度,特别是提高区域填充的效率是一个关键技术。采用软件实现区域填充,速度慢,限制了图形加速器效率的提高。本文采用一种改进的区域填充扫描线算法,设计了具体的硬件实现方法,并将其应用于一个完整的2D图形加速器系统,提高了加速器的效率,最终在Altera的cycloneII系列开发板上进行了验证。     

A simple method for rendering penumbrae caused by sunlight

A simple rendering method for penumbrae caused by sunlight is proposed to create more realistic outdoor scenery. Only four points are used to define the penumbra area cast by a contour edge so that little storage is needed for penumbra areas. Complex penumbrae caused by such objects as curtains can be rendered. Calculation of illumination in the shadows cast by natural objects, such as trees, mapped on a transparent virtual plane is available. In order to show the usefulness of the proposed method, some computer-generated images with penumbrae are compared with those without penumbrae.     

CP3: Robust, Output-sensitive Display of Convex Polyhedra in Scanline Mode

A new technique is developed for displaying disjoint convex polyhedra. The method has the following properties: It is output-sensitive, displays the objects in scanline mode, and it is naturally robust. There is no complex data structure uniting the different polyhedra, so dynamic insertions and deletions are simple. Its robustnes is based on a novel method of comparing depths by representative "axes" of objects instead of surfaces. The method is based on two extensions of the "critical-points" method for polygon scan conversion: One extension allows the efficient display of planar graphs in scanline mode, and another extension is into the third dimension. Test runs indicate that it compares extremely favorably with other methods that operate in scanline mode, as well as with standard software and hardware techniques of medium-level workstations.     

Performance of scanline algorithms for direct display of CSG

Direct display algorithms display a CSG model without first converting the model into a boundary representation. Three such algorithms are described. All three are based on the scanline display algorithm, and are able to handle both polygonal and quadratic faces.The first algorithm is based on Atherton's recursive subdivision scanline algorithm, the second is a combination of a scanline and a ray casting algorithm, and the third is a scanline version of the Trickle algorithm. A multiprocessor system in which these algorithms can be incorporated is also described.The performances of the algorithms are compared. It turns out that the algorithms efficiently display CSG models on general-purpose architectures. A comparison is also made between the performances for polygon-approximated models and exact models for objects bounded by quadratic faces, such as spherical, cylindrical and conical faces, to get an indication of how many polygons can at most be used to approximate quadratic faces and still have better performance.     

基于扫描线分段的图像稠密匹配方法

在分析相关视图扫描线特征的基础上,提出了一种基于扫描线分段图像稠密匹配方法。依据灰度特征,将校正图像扫描线划分为灰度相似的像素段,重构以灰度平均的像素段为基元的新扫描线,在计算像素段匹配的基础上进行图像稠密匹配,以降低视图稠密匹配过程中的歧义性,提高匹配效率,最后给出了实验结果。     

节理迹长线测量与面测量的精度对比

在三维节理岩体模型 (其节理长度尺寸的分布是已知的 )的基础上 ,本文利用计算机模拟了节理迹长的线测量与面测量 ,并将二者测量的结果与真实的节理长度分布进行了对比 ,结果表明 ,线测量具有比面测量更高的精度     

Accurate real-time stereo correspondence using intra- and inter-scanline optimization

This paper deals with a novel stereo algorithm that can generate accurate dense disparity maps in real time.The algorithm employs an effective cross-based variable support aggregation strategy within a...     

HCE：一个层次化VLSI版图的电路提取系统

本文采用基于边的线扫描算法的图形逻辑操作，并以此为基础设计了一个层次化的电路提取器（ＨＣＥ），单元重复利用率越高，层次化的电路提取器ＨＣＥ比平面化的电路提取器的速度越快，并且，本提取器ＨＣＥ能够处理非曼哈顿图形，提取器ＨＣＥ系统是在ＨＰ９０００／８３４图形工作站上开发完成的，该系统采用了已成为工业标准的软件开发环境，即ＵＮＩＸ操作系统，Ｘ窗口，Ｃ语言和ＥｔｈｅｒＮｅｔ网络，便于系统移植、维护和再开     

Accurate real-time stereo correspondence using intra- and inter-scanline optimization

This paper deals with a novel stereo algorithm that can generate accurate dense disparity maps in real time. The algorithm employs an effective cross-based variable support aggregation strategy within a scanline optimization framework. Rather than matching intensities directly, the use of adaptive support aggregation allows for precisely handling the weak textured regions as well as depth discontinuities. To improve the disparity results with global reasoning, we reformulate the energy function on a tree structure over the whole 2D image area, as opposed to dynamic programming of individual scanlines. By applying both intra- and inter-scanline optimizations, the algorithm reduces the typical ’streaking’ artifact while maintaining high computational efficiency. The experimental results are evaluated on the Middlebury stereo dataset, showing that our approach is among the best for all real-time approaches. We implement the algorithm on a commodity graphics card with CUDA architecture, running at about 35 fames/s for a typical stereo pair with a resolution of 384×288 and 16 disparity levels.