839 search results - page 47 / 168 » Three-Clustering of Points in the Plane |
188
click to vote
DCG
2011
15 years 1 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
357
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point p...
190
click to vote
SMILE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Since uncalibrated images permit only projective reconstruction, metric information requires either camera or scene calibration. We propose a stratified approach to proje...
168
click to vote
BMVC
2010
15 years 4 months ago
2010
Man-made environments are abundant with planar surfaces which have attractive properties and are a prerequisite for a variety of vision tasks. This paper presents an incremental m...
155
click to vote
FOCM
2008
15 years 6 months ago
2008
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...