Connectivity in Digital Pictures
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that every simply-connected object in such a picture has elements which can be deleted without destroying its simple- connectedness, which makes it easy to prove that a well-known "shrinking" algorithm always works--that is, shrinks any simply- connected object down to a single element.
Abstract
article Free AccessConnectivity in Digital Pictures Author: Azriel Rosenfeld University of Maryland, Computer Science Center, College Park, Maryland University of Maryland, Computer Science Center, College Park, MarylandView Profile Authors Info & Claims Journal of the ACMVolume 17Issue 1Jan. 1970 pp 146–160https://doi.org/10.1145/321556.321570Published:01 January 1970Publication History 512citation1,839DownloadsMetricsTotal Citations512Total Downloads1,839Last 12 Months196Last 6 weeks22 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF