140 search results - page 22 / 28 » Computing the visibility graph of points within a polygon |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
109
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
115
click to vote
ISVC
2010
Springer
14 years 9 months ago
2010
Springer
We present a method for visual classification of actions and events captured from an egocentric point of view. The method tackles the challenge of a moving camera by creating defor...
101
Voted
SMA
2008
ACM
14 years 11 months ago
2008
ACM
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
101
click to vote
ICCV
1999
IEEE
16 years 1 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...