Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Digital Convexity, Straightness, and Convex Polygons
55
Zitationen
1
Autoren
1982
Jahr
Abstract
New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments. Also, a linear time algorithm is presented that, given a digital convex region, determines the smallest integer n such that the region is a digital convex n-gon.
Ähnliche Arbeiten
Use of the Hough transformation to detect lines and curves in pictures
1972 · 6.521 Zit.
Efficient Graph-Based Image Segmentation
2004 · 6.187 Zit.
Statistical and structural approaches to texture
1979 · 5.739 Zit.
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
1991 · 5.561 Zit.
The quickhull algorithm for convex hulls
1996 · 5.315 Zit.