Research on Distance Judgement Method from Point to Line to Generate a Line

Regarding the problem that the traditional straight-line generating has a low accuracy, we study straightline generating with the distance of point to line. We explore generating a line to approximate the ideal line and the issue is to pick out the pixel point of approximating the ideal line. The paper plays a significant scientific role in elucidating linear optimization norm and it lays a foundation for showing a straight line. The algorithm is valuable for computer graphics.

THEORY AND METHOD FOR WETLAND BOUNDARY DELINEATION

Based on the analysis of the subjectivity of wetland boundary criteria and their causes at present, this paper suggested that, under the condition that the mechanism of wetland formation process has not been understood, "black box" method of System Theory can be used to delineate wetland boundaries scientifically. After analyzing the difference of system construction among aquatic habitats, wetlands and uplands, the lower limit of rooted plants was chosen as the lower boundary criterion of wetlands. Because soil diagnostic horizon is the result of the long-term interaction among all environments, and it is less responsive than vegetation to short-term change, soil diagnostic horizon was chosen as the indicator to delineate wetland upper boundary, which lies at the thinning-out point of soil diagnostic horizon. Case study indicated that it was feasible using the lower limit of rooted plants and the thinning-out point of soil diagnostic horizon as criteria to delineate the lower and upper boundaries of wetland. In the study area, the thinning-out line of albic horizon was coincident with the 55.74m contour line, the maximum horizon error was less than 1m, and the maximum vertical error less than 0.04m. The problem on wetland definition always arises on the boundaries. Having delineated wetland boundaries, wetlands can be defined as follows: wetlands are the transitional zones between uplands and deepwater habitats, they are a kind of azonal complex that are inundated or saturated by surface or ground water, with the lower boundary lying at the lower limit of rooted plants, and the upper boundary at the thinning-out line of upland soil diagnostic horizon.

Discrimination of Junctions in Line Drawing by Computer

For discrimination of the common W-junction and Y-junction in the labels of line drawing for a three-dimensional manifold plane surface with trihedral vertices, the existing algorithms are almost using angles between two adjacent lines and W-junction and Y- junction＇s definitions, and other complex methods. This passage gives four methods with their detailed mathematical inference processes in order to use these algorithms implemented by computer. The algorithms listed are Angle Summation method and Points to the Line method, Triangle methods which are the Triangle Area method and the Cross method. When the computer programs discriminate junctions, by comparison, the Angle Summation method and Points to the Line method are less efficacious than the Triangle method, and Cross method is more efficacious than the Triangle Area method in the Triangle method.

Multi-point Contact of the High-speed Vehicle-turnout System Dynamics

The wheel-rail contact problems, such as the number, location and the track of contact patches, are very important for optimizing the spatial structure of the rails and lowering the vehicle-turnout system dynamics. However, the above problems are not well solved currently because of having the difficulties in how to determine the multi-contact, to preciously present the changeable profiles of the rails and to establish an accurate spatial turnout system dynamics model. Based on a high-speed vehicle-turnout coupled model in which the track is modeled as flexible with rails and sleepers represented by beams, the line tracing extreme point method is introduced to investigate the wheel-rail multiple contact conditions and the key sections of the blade rail, longer nose rail, shorter rail in the switch and nose rail area are discretized to represent the varying profiles of rails in the turnout. The dynamic interaction between the vehicle and turnout is simulated for cases of the vehicle divergently passing the turnout and the multi-point contact is obtained. The tracks of the contact patches on the top of the rails are presented and the wheel-rail impact forces are offered in comparison with the contact patches transference on the rails. The numerical simulation results indicate that the length of two-point contact occurrence of a worn wheel profile and rails is longer than that of the new wheel profile and rails; The two-point contact definitely occurs in the switch and crossing area. Generally, three-point contact doesn’t occur for the new rail profile, which is testified by the wheel-rails interpolation distance and the first order derivative function of the tracing line extreme points. The presented research is not only helpful to optimize the structure of the turnout, but also useful to lower the dynamics of the high speed vehicle-turnout system.

Dynamic Analysis for the Global Performance of An SPM-Feeder-Cage System Under Waves and Currents

In the present study, the dynamic response of a coupled SPM-feeder-cage system under irregular waves and shear currents is analyzed. A numerical model is developed by using the commercial software Orca Flex. Hydrodynamics coefficients of the vessel are calculated by using a 3D diffraction/radiation panel program. First- and second-order wave forces are included in the calculations. Morison equation is used to compute the drag force on line elements representing the net. Drag coefficients are determined at every time step in the simulation considering the relative normal velocity between the structural elements and the fluid flow. The dynamic response of the coupled system is analyzed for various environments and net materials. The results of the study show the effects of solidity ratio of the net and vertical positions of the cage on the overall dynamic response of the system, confirming the viability of this type of configuration for future development of offshore aquaculture in deep waters.

A class of two-dimensional rational maps with self-excited and hidden attractors

This paper studies a new class of two-dimensional rational maps exhibiting self-excited and hidden attractors. The mathematical model of these maps is firstly formulated by introducing a rational term. The analysis of existence and stability of the fixed points in these maps suggests that there are four types of fixed points, i.e., no fixed point, one single fixed point, two fixed points and a line of fixed points. To investigate the complex dynamics of these rational maps with different types of fixed points, numerical analysis tools, such as time histories, phase portraits, basins of attraction, Lyapunov exponent spectrum, Lyapunov(Kaplan–Yorke) dimension and bifurcation diagrams, are employed. Our extensive numerical simulations identify both self-excited and hidden attractors, which were rarely reported in the literature. Therefore, the multi-stability of these maps, especially the hidden one, is further explored in the present work.

Search Algorithm for Determining the Range of the Possible Collision of Conver Polygons

Let P=(po, p1,..., pn-1 ) and Q=(qo,q1..., qm-1) be two arbitrary convex polygonsin plane. In this paper, the author studies the problems of how to quickly determine their possiblecollision range and movable range. In the paper, a new sufficient and necessary condition for decidingpossible collision is proposed,and the basic characters of the oblique supporting lines are investigated,and on these grounds the problem to determine the possible collision range is transformed into thatof searching the supporting points on the sets of convex polygon vertexs. Using the strategy ofsearching simultaneously the sets of vertexes of P and Q, the author constructs the fast algorithmfor finding the supporting points, the time-complexity of which is O(log2(m + n)). Based on theseresults, the algorithms to quickly determine the range are given, which possess the time-complexityof O(log2(m+n)).

A Fast Vision-inertial Odometer Based on Line Midpoint Descriptor

Visual simultaneous localization and mapping(VSLAM) are essential technologies to realize the autonomous movement of vehicles. Visual-inertial odometry(VIO) is often used as the front-end of VSLAM because of its rich information, lightweight, and robustness. This article proposes the FPL-VIO, an optimization-based fast vision-inertial odometer with points and lines. Traditional VIO mostly uses points as landmarks;meanwhile, most of the geometrical structure information is ignored. Therefore, the accuracy will be jeopardized under motion blur and texture-less area. Some researchers improve accuracy by adding lines as landmarks in the system.However, almost all of them use line segment detector(LSD) and line band descriptor(LBD) in line processing, which is very time-consuming. This article first proposes a fast line feature description and matching method based on the midpoint and compares the three line detection algorithms of LSD, fast line detector(FLD), and edge drawing lines(EDLines). Then, the measurement model of the line is introduced in detail. Finally, FPL-VIO is proposed by adding the above method to monocular visual-inertial state estimator(VINSMono), an optimization-based fast vision-inertial odometer with lines described by midpoint and points. Compared with VIO using points and lines(PL-VIO), the line processing efficiency of FPL-VIO is increased by 3-4 times while ensuring the same accuracy.