1245 search results - page 45 / 249 » Triangulation for Points on Lines |
84
Voted
WACV
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
DM
2008
14 years 9 months ago
2008
Rahilly [10] described a construction that relates any Hadamard design H on 4m -1 points with a line spread to an affine design having the same parameters as the classical design ...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
IMAMS
2007
14 years 11 months ago
2007
Abstract. In this work we focus on approximations of continuous harmonic functions by discrete harmonic functions based on the discrete Laplacian in a triangulation of a point set....
108
click to vote
CGVR
2010
14 years 7 months ago
2010
We demonstrate a generic method for visualization of high-resolution unorganized and noisy 3D data points with a surface of significantly lower resolution. To this effect, we feed...