Sciweavers

839 search results - page 48 / 168
» Three-Clustering of Points in the Plane
Sort
View
IWPEC
2004
Springer
14 years 2 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
ICIAR
2010
Springer
14 years 1 months ago
Real-Time Scale Invariant 3D Range Point Cloud Registration
Abstract. Stereo cameras, laser rangers and other time-of-flight ranging devices are utilized with increasing frequency as they can provide information in the 3D plane. The abilit...
Anuj Sehgal, Daniel Cernea, Milena Makaveeva
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 3 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 3 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
COMGEO
2008
ACM
13 years 9 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...