Sciweavers

Share
137 search results - page 1 / 28
» A Method for Classification of Convex Polygons
Sort
View
JCIT
2007
75views more  JCIT 2007»
9 years 11 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
MVA
2007
210views Computer Vision» more  MVA 2007»
10 years 28 days ago
Represent Image Contents Using Curves and Chain Code
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
Pornchai Mongkolnam, Chakarida Nukoolkit, Thanee D...
JMMA
2002
90views more  JMMA 2002»
9 years 11 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
10 years 3 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
EJC
2008
9 years 11 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
books