895 search results - page 177 / 179 » Triangulating Topological Spaces |
SIAMCOMP
2008
13 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
JCM
2007
13 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
JCP
2007
13 years 6 months ago
2007
—The computational Grid concept is gaining great popularity as the best way to deliver access to a wide range of distributed computing and data resources. But, as Grids move from...
CVGIP
2002
13 years 6 months ago
2002
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
IJCV
1998
13 years 6 months ago
1998
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...