137 search results - page 4 / 28 » A Method for Classification of Convex Polygons |
IWVF
2001
Springer
13 years 9 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
WSCG
2004
13 years 6 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
VISUALIZATION
2000
IEEE
13 years 8 months ago
2000
IEEE
We present an algorithm for automatically classifying the interior and exterior parts of a polygonal model. The need for visualizing the interiors of objects frequently arises in ...
FLAIRS
2004
13 years 6 months ago
2004
A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex ...