نتایج جستجو برای: and convex area and perimeter
تعداد نتایج: 16885853 فیلتر نتایج به سال:
the application of e-learning systems - as one of the solutions to the issue of anywhere and anytime learning – is increasingly spreading in the area of education. content management - one of the most important parts of any e-learning system- is in the concern of tutors and teachers through which they can obtain means and paths to achieve the goals of the course and learning objectives. e-learn...
a frame semantic approach to the study of translating cultural scripts in salingers franny and zooey
the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...
We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter, having minimum area (perimeter) bounding box, having minimum area (perimeter) convex hull. For constant values of c, all our algorithms run in O(n log n) time.
nitric oxide (no) is a small molecule synthesized by most of mammalian cells with diverse biological activities including vasodilatation, host defense and wound healing. impaired wound healing is a common occurrence among diabetics and patients receiving glucocorticoid therapy. on the other hand the application of laser in biomedical area have been increased. thus, the current studies were desi...
We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two (possibly overlapping) point sets in the plane, with a bounded number of convex-hull peeling layers. The ham-sandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex count of both point sets. Our algorithm supports insertion and deletion of vertices in O(c log n) tim...
Given a set of points P in the plane and profits (or prizes) π : P → R≥0 we want to select a maximum profit set X ⊆ P which maximizes P p∈X π(p) − μ(X) for some particular criterion μ(X). In this paper we consider four such criteria, namely the perimeter and the area of the smallest axis-parallel rectangle containing X, and the perimeter and the area of the convex hull conv(X) of X. Our key res...
in the area of vocabulary teaching and learning although much research has been done, only some of it has led to effective techniques of vocabulary teaching and many language learners still have problem learning vocabulary. the urge behind this study was to investigate three methods of teaching words. the first one was teaching words in context based on a traditional method of teaching that is,...
The maximal area of a polygon with n = 2m edges and unit diameter is not known when m ≥ 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known when m ≥ 4. We construct improved polygons in both problems, and show that the values we obtain cannot be improved for large n by more than c1/n in the area problem and c2/n in the perimeter problem, for certain con...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید