Results 321 to 330 of about 4,303,118 (363)
Some of the next articles are maybe not open access.
Maintaining the Visibility Graph of a Dynamic Simple Polygon
International Conference on Algorithms and Discrete Applied Mathematics, 2019Tameem Choudhury, R. Inkulu
semanticscholar +1 more source
Exploring Simple Grid Polygons
2005We investigate the online exploration problem of a short-sighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it can determine only which of the four cells adjacent to its current position are free and which are blocked, i.e., unaccessible for the robot.
Rolf Klein +3 more
openaire +1 more source
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon
International Symposium on Computational Geometry, 2016Eunjin Oh, Luis Barba, Hee-Kap Ahn
semanticscholar +1 more source
The VC-Dimension of Visibility on the Boundary of a Simple Polygon
International Symposium on Algorithms and Computation, 2015Matt Gibson, Erik Krohn, Qing Wang
semanticscholar +1 more source
GRP_CH Heuristic for Generating Random Simple Polygon
International Workshop on Combinatorial Algorithms, 2012S. Sadhu +4 more
semanticscholar +1 more source
On-Line Searching in Simple Polygons
1999In this paper we study the problem of a robot searching for a visually recognizable target in an unknown simple polygon. We present two algorithms. Both work for arbitrarily oriented polygons. The search cost is proportional to the distance traveled by the robot. We use competitive analysis to judge the performance of our strategies. The first one is a
openaire +2 more sources
CPP-Net: Context-Aware Polygon Proposal Network for Nucleus Segmentation
IEEE Transactions on Image Processing, 2023Shengcong Chen +2 more
exaly