Results 81 to 90 of about 4,255,094 (265)
A fast-growing literature uses remotely sensed land-cover data along with quasi-experimental statistical methods to assess the efficacy of forest conservation interventions.
Allen Blackman+2 more
doaj +1 more source
Review and prospect of coal mine informatization constructio
Based on the definition of coal mine informatization, the characteristics, typical problems and their representative solutions in different stages of coal mine informatization construction are reviewed, which include single machine(system) automation ...
DING Enjie+3 more
doaj +1 more source
A simple model of trees for unicellular maps [PDF]
We consider unicellular maps, or polygon gluings, of fixed genus. In FPSAC '09 the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for these objects.
Guillaume Chapuy+2 more
doaj +1 more source
Packing identical simple polygons is NP-hard
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.
Allen, Sarah R., Iacono, John
core
Constant-work-space algorithms for geometric problems
Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a read-only array.
Tetsuo Asano+3 more
doaj +1 more source
Investigation on Classification and Cleaning for Visually Self-Intersected Monocyclic Polygons
In the geographic information system field, identifying and cleaning self-intersected polygons to achieve simple polygons is a basic and core issue.
Chengming Li+3 more
doaj +1 more source
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular
Keivan Borna
doaj
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their ...
Boomari, Hossein+2 more
core
THE IMPORTANCE AND THE ROLE OF THE POLYGON IN THE DEVELOPMENT OF BIOMOTORING EXPERIENCES OF THE FIRST SERIES OF NINE YEARS LASTED ELEMENTARY SCHOOL STUDENTS [PDF]
In order to underline the importance of the polygon for the students of the first series of nine years lasted school in the function of development, escort and control of the elementary monitoring experiences, in the sense of space solution, simple ...
Drago Milošević
doaj
Geographic features in maps consist of a mixture of points, polylines, and polygons, generally including POIs, roads, buildings, and other geographic features.
Chongya Gong+4 more
doaj +1 more source