نتایج جستجو برای: plane algorithm

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

2002
Shin-ichi Nakano Takeaki Uno

In this paper we give an algorithm to generate all biconnected plane triangulations having exactly n vertices including exactly r vertices on the outer face. The algorithm uses O(n) space in total and generates such triangulations without duplications in O(rn) time per triangulation, while the previous best algorithm generates such triangulations in O(rn) time per triangulation.

Journal: :Discrete Applied Mathematics 2005
Yan Gérard Isabelle Debled-Rennesson Paul Zimmermann

A naive digital plane is a subset of points (x, y, z) ∈ Z3 verifying h ≤ ax+ by+ cz < h+max{|a|, |b|, |c|} where (a, b, c, h) ∈ Z4. Given a finite unstructured subset of Z3, determine whether there exists a naive digital plane containing it is called digital plane recognition. This question is rather classical in the field of digital geometry (also called discrete geometry). We suggest in this ...

Many researchers have controlled and analyzed biped robots that walk in the sagittal plane. Nevertheless, walking robots require the capability to walk merely laterally, when they are faced with the obstacles such as a wall. In walking robot field, both nonlinearity of the dynamic equations and also having a tracking system cause an effective control has to be utilized to address these problems...

The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

2016
Jacques-Olivier Lachaud Xavier Provençal Tristan Roussillon

Digital planes are sets of integer points located between two parallel planes. We present a new algorithm that computes the normal vector of a digital plane given only a predicate is a point x in the digital plane or not . In opposition with the algorithm presented in [7], the algorithm is fully local and does not explore the plane. Furthermore its worst-case complexity bound is O(ω), where ω i...

Journal: :iranian journal of public health 0
lw hu hz gong djun yu q gao n gao m wang

background: in general, measurements of solar ultraviolet (uv) radiation are related to horizontal surfaces. while the hu­mans walking and standing outdoors expose to the natural solar uv radiation, their eyes, cheeks, extremities, trunks, or many other anatomical sites are close to vertical plane and random orient to different directions. in this study, we character­ized the diurnal variations...

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

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