23 search results - page 3 / 5 » Fast Constrained Surface Extraction by Minimal Paths |
TVCG
2011
13 years 2 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
ECCV
2000
Springer
14 years 3 days ago
2000
Springer
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
ICIAP
2001
Springer
14 years 7 months ago
2001
Springer
Deformable models are by their formulation able to solve surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ...
CIAC
2000
Springer
14 years 3 days ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the e...