Name
Abstract | ||
|---|---|---|
A shape with a twice-differentiable boundary is convex if and only if the boundary has nonnegative curvature everywhere. We show how to formulate this condition equivalently in terms of the Fourier descriptors of the boundary: The shape is convex if and only if the boundary has a nonnegative definite “parametric” curvature spectrum (defined herein) |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1049/el:19980943 | Pattern Recognition, 1998. Proceedings. Fourteenth International Conference |
Keywords | Field | DocType |
fourier series,pattern recognition,fourier descriptors,convex contour,convexity testing | Topology,Convexity,Algorithm,Regular polygon,Electronic engineering,Fourier transform,Planar,Mathematics | Conference |
Volume | Issue | ISSN |
34 | 14 | 0013-5194 |
ISBN | Citations | PageRank |
0-8186-8512-3 | 7 | 0.48 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ramakrishna Kakarala | 1 | 7 | 0.48 |