107 search results - page 4 / 22 » Approximation algorithms for art gallery problems in polygon... |
82
Voted
ICCS
2003
Springer
15 years 2 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
IPL
2002
14 years 9 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
70
Voted
PG
1999
IEEE
15 years 1 months ago
1999
IEEE
We present an automatic camera placement method for generating image-based models from scenes with known geometry. Our method first approximately determines the set of surfaces vi...
CCCG
2001
14 years 11 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
FCT
2003
Springer
15 years 2 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...