107 search results - page 8 / 22 » Approximation algorithms for art gallery problems in polygon... |
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...