Results 191 to 200 of about 4,255,094 (265)

Simulation and experimental verification of the precision finishing method for optical free-form surface segmentation. [PDF]

PLoS One
Jiang C, Zhang E, Zhang W, Hu J, Guo J, Li X.   +5 more
europepmc   +1 more source

An introduction to statistical models used to characterize species-habitat associations with animal movement data. [PDF]

Mov Ecol
Florko KRN, Togunov RR, Gryba R, Sidrow E, Ferguson SH, Yurkowski DJ, Auger-Méthé M.   +6 more
europepmc   +1 more source

MINARO DRS: usability study of a robotic-assisted laminectomy. [PDF]

Int J Comput Assist Radiol Surg
Vossel M, Theisgen L, Wickel N, Phlippen L, Pjontek R, Drobinsky S, Clusmann H, Radermacher K, Blume C, de la Fuente M.   +9 more
europepmc   +1 more source

GAM4water: An R-based method for extracting wetted areas from remotely-sensed images. [PDF]

MethodsX
Redana M, Lancaster LT, Gibbins C.
europepmc   +1 more source

Maui: modular analytics of UAS imagery for specialty crop research. [PDF]

Plant Methods
Kanaley K, Murdock MJ, Qiu T, Liu E, Seyram SE, Starzmann D, Smart LB, Gold KM, Jiang Y.   +8 more
europepmc   +1 more source

Sailfish generate foraging opportunities for seabirds in multi-species predator aggregations. [PDF]

Biol Lett
Licht M, Burns AL, Pacher K, Krause S, Bartashevich P, Romanczuk P, Hansen MJ, Then AY, Krause J.   +8 more
europepmc   +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

Some of the next articles are maybe not open access.

Related searches:

TSP in a Simple Polygon

Embedded Systems and Applications, 2022
We study the Traveling Salesman Problem inside a simple polygon. In this problem, which we call tsp in a simple polygon , we wish to compute a shortest tour that visits a given set S of n sites inside a simple polygon P with m edges while staying inside ...
H. Alkema, M. D. Berg, M. Monemizadeh, Leonidas Theocharous   +3 more
semanticscholar   +1 more source

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon

Algorithmica, 2018
Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric.
Eunjin Oh, Luis Barba, Hee-Kap Ahn
semanticscholar   +1 more source