235 search results - page 24 / 47 » The Complexity of Separating Points in the Plane |
168
click to vote
ICIAR
2004
Springer
15 years 11 months ago
2004
Springer
We present a simple calibration method for computing the extrinsic parameters (pose) and intrinsic parameters (focal length and principal point) of a camera by imaging a pattern of...
152
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
1 The compression efficiency of Distributed Video-Coding2 (DVC) suffers from the necessity of transmitting a large num-3 ber of key-frames which are intra-coded. This paper describ...
172
click to vote
ICCSA
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
164
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, a system which constructs a mosaic image of the tunnel surface with little distortion is presented. The tunnel surface is typically composed of a roughly cylindrica...
163
Voted
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
— We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. ...