Sciweavers

417 search results - page 4 / 84
» Convex Shape Decomposition
Sort
View
MOC
2002
101views more  MOC 2002»
15 years 2 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
108
Voted
ICPR
2008
IEEE
16 years 4 months ago
Robust decomposition of a digital curve into convex and concave parts
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
Tristan Roussillon, Isabelle Sivignon, Laure Tougn...
GBRPR
2009
Springer
15 years 10 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
JCIT
2007
75views more  JCIT 2007»
15 years 3 months ago
A Method for Classification of Convex Polygons
Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it ...
Ping Guo, Yan-Xia Wang