1387 search results - page 19 / 278 » Convexity in Discrete Space |
DGCI
2005
Springer
14 years 1 months ago
2005
Springer
COMPGEOM
2004
ACM
14 years 29 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
JCIT
2007
13 years 7 months ago
2007
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 ...
DGCI
2009
Springer
13 years 10 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...