Results 291 to 300 of about 4,303,118 (363)

Pesticides in France: ten years of combined exposure to active substances in land, air and surface water. [PDF]

Sci Data
Rigal S, Perrot T.
europepmc   +1 more source

One-shot learning for solution operators of partial differential equations. [PDF]

Nat Commun
Jiao A, He H, Ranade R, Pathak J, Lu L.
europepmc   +1 more source

Giotto Suite: a multiscale and technology-agnostic spatial multiomics analysis ecosystem. [PDF]

Nat Methods
Chen JG, Chávez-Fuentes JC, O'Brien M, Xu J, Ruiz EC, Wang W, Amin I, Sheridan JP, Shin SC, Hasyagar SV, Sarfraz I, Guckhool P, Sistig A, Jarzabek V, Yuan GC, Dries R.   +15 more
europepmc   +1 more source

Live-cell 3D-SIM of Rift Valley fever virus NSs filaments reveals a polygonal web architecture

Dunlop J, Thomason PA, Carlin LM, Davis BG, Carter SD.   +4 more
europepmc   +1 more source

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 the polygon.
H. Alkema, M. D. Berg, M. Monemizadeh, Leonidas Theocharous   +3 more
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Guarding in a simple polygon

Information Processing Letters, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chuan Yi Tang, Bor-Kuan Lu, Fang-Rong Hsu   +2 more
openaire   +3 more sources

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

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

Discrete & Computational Geometry, 2017
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric.
Eunjin Oh, Hee-Kap Ahn
semanticscholar   +1 more source

Morphing Simple Polygons

Discrete & Computational Geometry, 2000
Morphing two geometric shapes means finding a continuous deformation that transforms one shape into the other. This paper considers the problem of morphing two parallel simple polygons \(P\) and \(Q\) with \(n\) edges \(P_i\), \(Q_i\), \(i=1,\ldots,n\), where edge \(P_i\) is parallel to edge \(Q_i\), and all intermediate shapes are also parallel simple
John Hershberger, Leonidas J. Guibas, Subhash Suri   +2 more
openaire   +2 more sources