Sciweavers

413 search results - page 17 / 83
» Computing Distances between Surfaces Using Line Geometry
Sort
View
WPES
2004
ACM
14 years 25 days ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
ECCV
2010
Springer
14 years 5 days ago
Blocks World Revisited: Image Understanding using Qualitative Geometry and Mechanics
Since most current scene understanding approaches operate either on the 2D image or using a surface-based representation, they do not allow reasoning about the physical constrain...
Abhinav Gupta, Alexei A. Efros, Martial Hebert
VISUALIZATION
2005
IEEE
14 years 1 months ago
Surface Reconstruction Via Contour Metamorphosis: An Eulerian Approach With Lagrangian Particle Tracking
We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segment...
Ola Nilsson, David E. Breen, Ken Museth
COMPGEOM
2000
ACM
13 years 11 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
CGF
2010
157views more  CGF 2010»
13 years 4 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen