Results 101 to 110 of about 142,034 (198)

Finding the Medial Axis of a Simple Polygon in Linear Time

International Symposium on Algorithms and Computation, 1995
F. Chin, J. Snoeyink, C. Wang
semanticscholar   +1 more source

Effectiveness of school-based interventions on fundamental movement skills in children: a systematic review and meta-analysis. [PDF]

BMC Public Health
Yin X, Zhang D, Shen Y, Wang Y, Wang Z, Liu Y.   +5 more
europepmc   +1 more source

Visual recognition of honeybee behavior patterns at the hive entrance. [PDF]

PLoS One
Sledevič T, Serackis A, Matuzevičius D, Plonis D, Vdoviak G.   +4 more
europepmc   +1 more source

Visual perception of wind hazards using cycloidal scanning LiDAR system. [PDF]

Sci Rep
Kim G, Eom J, Park Y.
europepmc   +1 more source

The Complexity of Guarding Monotone Polygons

, 2012
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection with P. A set G of points inside P or on the boundary of P is said to guard the polygon if every point inside P or on the boundary of P is seen by a point in G. An interior guard can lie anywhere inside or on the boundary of the polygon. Using a reduction
Krohn, Erik, Nilsson, Bengt J.
openaire   +1 more source

Turning machines: a simple algorithmic model for molecular robotics. [PDF]

Nat Comput
Kostitsyna I, Wood C, Woods D.
europepmc   +1 more source

CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU. [PDF]

Springerplus, 2016
Mei G.
europepmc   +1 more source

Tropical Ehrhart theory and tropical volume. [PDF]

Res Math Sci, 2020
Loho G, Schymura M.
europepmc   +1 more source

On the use of elliptic PDEs for the parameterisation of planar multipatch domains: Part 1: Numerical algorithms and foundations of parametric control. [PDF]

Eng Comput
Hinz J, Buffa A.
europepmc   +1 more source

Any Monotone Boolean Function Can Be Realized by Interlocked Polygons

, 2010
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interior-disjoint simple planar polygons are interlocked if no subset can be separated arbitrarily far from the rest, moving each polygon as a rigid object as in a sliding-block puzzle.
Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei   +2 more
openaire   +1 more source