Sciweavers

839 search results - page 49 / 168
» Three-Clustering of Points in the Plane
Sort
View
COMGEO
1999
ACM
13 years 8 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
COMBINATORICS
2006
94views more  COMBINATORICS 2006»
13 years 9 months ago
Some Results on Odd Astral Configurations
An astral configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane where every point has q straight lines passing through it and every line h...
Leah Wrenn Berman
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
14 years 2 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
RAS
2008
139views more  RAS 2008»
13 years 7 months ago
Towards 3D Point cloud based object maps for household environments
This article investigates the problem of acquiring 3D object maps of indoor household environments, in particular kitchens. The objects modeled in these maps include cupboards, ta...
Radu Bogdan Rusu, Zoltan Csaba Marton, Nico Blodow...
ECCV
2006
Springer
14 years 11 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner