Sciweavers

839 search results - page 55 / 168
» Three-Clustering of Points in the Plane
Sort
View
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 4 months ago
Arrangements of double pseudolines
We define a double pseudoline as a simple closed curve in the open M¨obius band homotopic to the double of its core circle, and we define an arrangement of double pseudolines a...
Luc Habert, Michel Pocchiola
ICPR
2006
IEEE
14 years 10 months ago
Planar Structure Based Registration of Multiple Range Images
In this paper, we describe the method for aligning multiple range images given by a range finder. Especially we will use range images of inside and outside of buildings which cont...
Daiju Watanabe, Hideo Saito
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
14 years 1 months ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein
CGF
1999
128views more  CGF 1999»
13 years 8 months ago
Creating Architectural Models from Images
We present methods for creating 3D graphical models of scenes from a limited numbers of images, i.e. one or two, in situations where no scene co-ordinate measurements are availabl...
David Liebowitz, Antonio Criminisi, Andrew Zisserm...
JCT
2011
89views more  JCT 2011»
13 years 4 months ago
On lines, joints, and incidences in three dimensions
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
György Elekes, Haim Kaplan, Micha Sharir