40 search results - page 2 / 8 » caip 2007 |
CAIP
2007
Springer
13 years 9 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The use of traditional moment invariants is limited to a certain set of simple geometric transforms, such as rotation, scaling and affine transform. This paper presents a...
CAIP
2007
Springer
13 years 9 months ago
2007
Springer
In this paper we introduce a new method for computing the orientation for compound shapes. If the method is applied to single component shapes the computed orientation is consisten...
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
An algorithm of estimation of the curvature at each point of a general discrete curve in O(nlog2 n) is proposed. It uses the notion of blurred segment, extending the definition of...
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...