366 search results - page 2 / 74 » Dynamic Programming for Graphs on Surfaces |
WG
2010
Springer
13 years 4 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
ICPR
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...
PLDI
2004
ACM
13 years 12 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
ICALP
1997
Springer
13 years 10 months ago
1997
Springer
VISUALIZATION
2000
IEEE
13 years 10 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...