Sciweavers

1604 search results - page 25 / 321
» Approximation algorithms for developable surfaces
Sort
View
135
Voted
STACS
2007
Springer
15 years 8 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
124
Voted
IGARSS
2010
15 years 4 days ago
A tracking algorithm for GNSS reflected signals on sea surface
The observation of the ocean surface using electromagnetic sources of opportunity (GNSS signals for instance) has been a green research topic for several years. The Global Navigat...
Sarab Tay, Arnaud Coatanhay, Frederic Maussang, Re...
CG
2006
Springer
15 years 2 months ago
A survey of the marching cubes algorithm
A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21...
Timothy S. Newman, Hong Yi
122
Voted
VISUALIZATION
1997
IEEE
15 years 6 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
119
Voted
CVPR
2010
IEEE
15 years 10 months ago
Specular Surface Reconstruction from Sparse Reflection Correspondences
We present a practical approach for surface reconstruction of smooth mirror-like objects using sparse reflection correspondences (RCs). Assuming finite object motion with a fix...
Aswin Sankaranarayanan, Ashok Veeraraghavan, Oncel...