نتایج جستجو برای: surrounding polygon
تعداد نتایج: 88821 فیلتر نتایج به سال:
In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculation are described completely and the algorithm will be showed as a computer program.
We devise dynamic algorithms for the following (weak) visibility polygon computation problems: • Maintaining visibility polygon of a fixed point located interior to simple polygon amid vertex insertions and deletions to simple polygon. • Answering visibility polygon query corresponding to any point located exterior to simple polygon amid vertex insertions and deletions to simple polygon. • Main...
Parking lots have wide variety of shapes because surrounding environment and the objects inside parking lot, such as trees, manholes, etc. In case paving much area possible should be covered by construction vehicle to reduce need for manual workforce. Thus, coverage path planning (CPP) problem is formulated. The CPP a complex with constraints regarding various issues, dimensions data processing...
A thin glacial diamicton, informally termed Granite drift, occupies the floor of central Beacon Valley in southern Victoria Land, Antarctica. This drift is ,1.0 m thick and rests with sharp planar contacts on stagnant glacier ice reportedly of Miocene age, older than 8.1 Ma. The age of the ice is based on 40Ar/39Ar analyses of presumed in situ ash-fall deposits that occur within Granite drift. ...
An important role of statistical analysis in science is for interpreting and communicating statistical evidente per se showing “what the data say.” Although standard methods (hypothesis testing, estimation, confidence intervals) are routinely used for this purpose, the theory behind those methods contains no defined concept of evidente, and no answer to the basic question, “When is it correct t...
Let $$C_{k_1}, \ldots , C_{k_n}$$ be cycles with $$k_i\ge 2$$ vertices ( $$1\le i\le n$$ ). By attaching these n together in a linear order, we obtain graph called polygon chain. cyclic graph, which is ring if it can embedded on the plane; and twisted Möbius band. It known that sandpile group of chain always cyclic. Furthermore, there exist edge generators. In this paper, not only show any (twi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید