A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
, 2007 Xuehou Tan
openalex +1 more source
Impact of visual stimulus complexity on associative learning and associated reaction times in migraine patients. [PDF]
Sci RepTót K +8 more
europepmc +1 more source
A Simple Kinetic Visibility Polygon
, 2002 Given a set of moving obstacles in the plane, we propose a method for maintaining efficiently the visibility polygon of a (possibly moving) viewpoint. We consider both smooth-convex, and simply-polygonal obstacles.
Hornus, Samuel, Puech, Claude
openaire +1 more source
Recovering the polyhedral geometry of fragments. [PDF]
MethodsXTörök J, Domokos G.
europepmc +1 more source
Optimal shortest path queries in a simple polygon
SCG '87, 1987 L. Guibas, J. Hershberger
semanticscholar +1 more source
Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
, 2011 Tetsuo Asano +2 more
openalex +1 more source
On approximations to minimum link visibility paths in simple polygons
, 2020 Mohammad Reza Zarrabi +1 more
openalex +2 more sources
Autonomous Mission Planning for Fixed-Wing Unmanned Aerial Vehicles in Multiscenario Reconnaissance. [PDF]
Sensors (Basel)Chen B, Yan J, Zhou Z, Lai R, Lin J.
europepmc +1 more source
An improved algorithm for reconstructing a simple polygon from its visibility angles
, 2012 Danny Z. Chen, Haitao Wang
openalex +1 more source
On the geodesic voronoi diagram of point sites in a simple polygon
SCG '87, 1989 B. Aronov
semanticscholar +1 more source