Sciweavers

2498 search results - page 93 / 500
» Algorithms for the Topological Watershed
Sort
View
ECCV
2010
Springer
15 years 11 months ago
Shape Analysis of Planar Objects with Arbitrary Topologies using Conformal Geometry
The study of 2D shapes is a central problem in the field of computer vision. In 2D shape analysis, classification and recognition of objects from their observed silhouette are e...
CVPR
2011
IEEE
14 years 9 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...
166
Voted
CAD
2005
Springer
15 years 6 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 11 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
COMSWARE
2007
IEEE
16 years 12 days ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra