by Klette, R and Krishnamurthy, EV
Abstract:
A simple approach based on Shoenberg’s theorem is described to test whether a set of border points of a simply 4-connected digital picture is convex. The sequential implementation of this method is linear inthe number of points; the parallel algorithm needs constant time only, using bitwise parallel Boolean operations and shifts on binary matrices. Suitable modifications of this approach can be used for decomposing two-dimensional objects into convex sets and for filling concavities. © 1981.
Reference:
Algorithms for testing convexity of digital polygons (Klette, R and Krishnamurthy, EV), In Computer Graphics and Image Processing, volume 16, 1981.
Bibtex Entry:
@article{klette1981algorithmspolygons,
author = "Klette, R and Krishnamurthy, EV",
journal = "Computer Graphics and Image Processing",
pages = "177--184",
title = "Algorithms for testing convexity of digital polygons",
volume = "16",
year = "1981",
abstract = "A simple approach based on Shoenberg's theorem is described to test whether a set of border points of a simply 4-connected digital picture is convex. The sequential implementation of this method is linear inthe number of points; the parallel algorithm needs constant time only, using bitwise parallel Boolean operations and shifts on binary matrices. Suitable modifications of this approach can be used for decomposing two-dimensional objects into convex sets and for filling concavities. © 1981.",
doi = "10.1016/0146-664X(81)90055-1",
issn = "0146-664X",
issue = "2",
language = "eng",
pii = "0146664X81900551",
}