Procedural Tree Modeling with Guiding Vectors

We propose guiding vectors to augment graph‐based tree synthesis, in which trees are collections of least‐cost paths in a graph. Each node has an associated guiding vector; edges parallel to the guiding vector are cheap, but edges are more expensive when their orientation differs from the guiding vector. We further propose an incremental method for assigning guiding vectors over the graph, in which a node's guiding vector is an incremental rotation of that of its parent. We present a complete procedural system for tree modeling; our use of guiding vectors enables the graph‐based method to produce high‐quality tree models resembling a variety of real‐world tree species.     

Guided Volume Editing based on Histogram Dissimilarity

Segmentation of volumetric data is an important part of many analysis pipelines, but frequently requires manual inspection and correction. While plenty of volume editing techniques exist, it remains cumbersome and errorprone for the user to find and select appropriate regions for editing. We propose an approach to improve volume editing by detecting potential segmentation defects while considering the underlying structure of the object of interest. Our method is based on a novel histogram dissimilarity measure between individual regions, derived from structural information extracted from the initial segmentation. Based on this information, our interactive system guides the user towards potential defects, provides integrated tools for their inspection, and automatically generates suggestions for their resolution. We demonstrate that our approach can reduce interaction effort and supports the user in a comprehensive investigation for high‐quality segmentations.     

Semi‐Regular Triangle Remeshing: A Comprehensive Study

Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multi‐resolution analysis. In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades. We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives.     

Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.     

Filtering Multi‐Layer Shadow Maps for Accurate Soft Shadows

In this paper, we introduce a novel technique for pre‐filtering multi‐layer shadow maps. The occluders in the scene are stored as variable‐length lists of fragments for each texel. We show how this representation can be filtered by progressively merging these lists. In contrast to previous pre‐filtering techniques, our method better captures the distribution of depth values, resulting in a much higher shadow quality for overlapping occluders and occluders with different depths. The pre‐filtered maps are generated and evaluated directly on the GPU, and provide efficient queries for shadow tests with arbitrary filter sizes. Accurate soft shadows are rendered in real‐time even for complex scenes and difficult setups. Our results demonstrate that our pre‐filtered maps are general and particularly scalable.     

Statics Aware Grid Shells

We introduce a framework for the generation of polygonal gridshell architectural structures, whose topology is designed in order to excel in static performances. We start from the analysis of stress on the input surface and we use the resulting tensor field to induce an anisotropic nonEuclidean metric over it. This metric is derived by studying the relation between the stress tensor over a continuous shell and the optimal shape of polygons in a corresponding gridshell. Polygonal meshes with uniform density and isotropic cells under this metric exhibit variable density and anisotropy in Euclidean space, thus achieving a better distribution of the strain energy over their elements. Meshes are further optimized taking into account symmetry and regularity of cells to improve aesthetics. We experiment with quad meshes and hexdominant meshes, demonstrating that our gridshells achieve better static performances than stateoftheart gridshells.     

Automatic generation algorithm of expected results for testing of component-based software system

ContextA component-based software (CBS) system is a typical example of a composite component, which is composed of two or more atomic components. In the test of a CBS system, it is necessary to automatically generate expected results because they are compared with the actual results.ObjectiveThis paper proposes an automatic generation algorithm of expected results for the testing of a CBS system.MethodThe algorithm analyzes Input/Output (I/O) relationships of a CBS system to identify inputs that influence its outputs. Then, the algorithm uses test cases of atomic components for each input and automatically generates expected results. To evaluate the proposed approach, we compare the proposed approach with the other I/O relationship based approach via two case studies which are the CBS systems for guide robot. The comparison shows the effectiveness of our approach.ResultsTo verify effectiveness of the proposed approach, we measure the cost of manual generation of expected results for each case study. The costs are from 0.001 to 0.015 in the first case study, and are from 0.590 to 0.998 in the second case study.ConclusionThis proposed approach reduces the time-consuming and error-prone task which manually generates expected results for the testing of a CBS system.     

基于I~2C总线的云台电机控制系统设计

本文分析了I2 C的工作原理和Linux的I2 C总线驱动程序,构建了高速公路视频监控系统下基于I2 C云台电机控制系统,完成了基于ARM和Linux的I2 C驱动程序、I2 C应用程序和云台电机控制应用程序设计,实现了应用程序控制云台电机,并应用于高速公路视频监控系统中,达到全方位的高速公路视频监控,具有良好的效果和较高的应用价值。