Sciweavers

839 search results - page 109 / 168
» Three-Clustering of Points in the Plane
Sort
View
CCCG
2010
13 years 8 months ago
Determining the robustness of sensor barriers
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
David G. Kirkpatrick
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
14 years 4 months ago
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
CVPR
2004
IEEE
15 years 11 days ago
The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...
René Vidal, Richard I. Hartley
ECCV
2004
Springer
15 years 7 days ago
Structure and Motion from Images of Smooth Textureless Objects
This paper addresses the problem of estimating the 3D shape of a smooth textureless solid from multiple images acquired under orthographic projection from unknown and unconstrained...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...
ISAAC
2009
Springer
116views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
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 ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...