10 search results - page 2 / 2 » Approximating the Visible Region of a Point on a Terrain |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
IVC
2000
13 years 7 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
GEOINFO
2003
13 years 8 months ago
2003
For the construction of digital terrain models based on surface interpolation, it is defined a bivariate function ¡£¢¥¤§¦©¨ that interpolates a finite set of sample ...
ICRA
2003
IEEE
14 years 19 days ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...