نتایج جستجو برای: construction segments

تعداد نتایج: 271885  

2014
R. S. Mohan A. Sarkar A. S. Sekhar

ABSTRACT Blade failure is a common problem of a steam turbine and it’s failure in-service results in safety risks, repair cost and non operational revenue losses. Thus, the reliability of these blades is very important for the successful operation of a steam turbine. Dynamic analysis of a steam turbine blade in computational environment is carried out in the present work. In order to gain physi...

Journal: :IOP Conference Series: Earth and Environmental Science 2021

Journal: :CoRR 2015
Iffat Chowdhury Matt Gibson

Our concern is the digitalization of line segments in Z as considered by Chun et al. [5] and Christ et al. [4]. The key property that differentiates the research of Chun et al. and Christ et al. from other research in digital line segment construction is that the intersection of any two segments must be connected. Such a system of segments is called a consistent digital line segments system (CD...

2006
SEBASTIAN KRIVOGRAD MLADEN TRLEP BORUT ŽALIK

An efficient algorithm for topology construction from a set of line segments is considered in the paper. The algorithm works in two steps: input analyzing, and topology construction. In the first step, inconsistencies in input are solved. The second step consists of two parts: the envelope construction, and determination of neighbouring relations between the obtained neighbouring The time compl...

1999
Petr Tobola Karel Nechvíle

We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log n) for set of segments with low directional density (i.e. it holds for arbitrary segment si from such set, that a line created as extension of this segment doesn’t intersect too many other segments from the set in a near neighbourhood of s...

1999
Petr Tobola Karel Nechvíle

We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log 3 n) for set of segments with low directional density (i.e. it holds for arbitrary segment s i from such set, that a line created as extension of this segment doesn't intersect too many other segments from the set in a near neighbourhood o...

Journal: :Int. J. Image Graphics 2004
Gwenaëlle Toulminet Stéphane Mousset Abdelaziz Bensrhair

In this article, we present a fast and accurate stereo vision-based system that detects and tracks road obstacles, as well as computes their 3D position and their axial motion. To do so, axial motion maps are constructed and the inclination angles of 3D straight segments are computed. 3D straight segments are obtained after the construction of 3D sparse maps based on dynamic programming and mul...

1995
Christoph Stiller

Linear transforms such as the DCT are eecient for image compression. While known transforms that approximate the eigentransform are limited to rectangular regions, this paper proposes a model for construction of eigentransforms for arbitrarily-shaped image segments.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید