A simple and efficient algorithm for detection of high curvature points in planar curves

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

A new algorithm is presented for detection of corners and other high curvature points in planar curves. A corner is defined as a location where a triangle with specified opening angle and size can be inscribed in the curve. The tests compare the new algorithm to four alternative algorithms for corner detection.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsNicolai Petkov, Michel A. Westenberg
PublisherSpringer Verlag
Pages746-753
Number of pages8
ISBN (Print)3540407308, 9783540407300
DOIs
Publication statusPublished - Jan 1 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2756
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

    Fingerprint

Keywords

  • Algorithms
  • Corner detection
  • Curvature
  • Planar curves

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chetverikov, D. (2003). A simple and efficient algorithm for detection of high curvature points in planar curves. In N. Petkov, & M. A. Westenberg (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 746-753). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2756). Springer Verlag. https://doi.org/10.1007/978-3-540-45179-2_91