1672 search results - page 175 / 335 » Tightness problems in the plane |
108
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
While the problem of tracking 3D human motion has been widely studied, most approaches have assumed that the person is isolated and not interacting with the environment. Environme...
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
ICCSA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
ICRA
2003
IEEE
15 years 4 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...