Journal ArticleDOI
How a Digital Computer can Tell whether a Line is Straight
Azriel Rosenfeld,Chul E. Kim +1 more
About:
This article is published in American Mathematical Monthly.The article was published on 1982-04-01. It has received 29 citations till now. The article focuses on the topics: Line (text file).read more
Citations
More filters
Journal ArticleDOI
Metric bases in digital geometry
Robert A. Melter,Ioan Tomescu +1 more
TL;DR: It is shown that for Euclidean distance, the minimal metric bases for the digital plane are just the sets of three noncollinear points; but for city block or chessboard distance,The digital plane has no finite metric basis.
Book
Digital geometry
Azriel Rosenfeld,Reinhard Klette +1 more
TL;DR: Questions of particular interest include how images and image subsets are digitized; how geometric properties are defined for digitized sets; the computational complexity of computing them--in particular, whether they can be computed using simple (e.g., local) operations; characterizing image operations that preserve them; and characterizing digital objects that could be the digitizations of real objects that have given geometric properties.
Journal ArticleDOI
Digital straightness: a review
Reinhard Klette,Azriel Rosenfeld +1 more
TL;DR: This paper reviews the literature on digital straightness and discusses its relationship to other concepts of geometry, the theory of words, and number theory.
Journal ArticleDOI
A bibliography on digital and computational convexity (1961-1988)
TL;DR: A bibliography of 370 references of books, papers in serial journals, and conference papers, on convexity in relation to computer science is presented.
Proceedings ArticleDOI
Digital disks and a digital compactness measure
Chul E. Kim,Timothy A. Anderson +1 more
TL;DR: An O(n2) time algorithm is presented that determines whether or not a given convex digital region is a digital disk.
References
More filters
Journal ArticleDOI
Computer Processing of Line-Drawing Images
TL;DR: Various forms of line drawing representation are described, different schemes of quantization are compared, and the manner in which a line drawing can be extracted from a tracing or a photographic image is reviewed.
Journal ArticleDOI
Digital Straight Line Segments
TL;DR: It is shown that a digital arc S is the digitization of a straight line segment if and only if it has the "chord property:" the line segment joining any two points of S lies everywhere within distance 1 of S.
Journal ArticleDOI
Minimum-Perimeter Polygons of Digitized Silhouettes
TL;DR: It is shown that, by properly marking the virtual as well as the real vertices of an MPP, the MPP can serve as a precise representation of any regular complex, and that this representation is often an economical one.
Journal ArticleDOI
Recognition of convex blobs
TL;DR: The use of the “minimum-perimeter polygon” in an algorithm for testing the convexity of cellular blobs on a rectangular mosaic is described.
Journal ArticleDOI
Linguistic Methods for the Description of a Straight Line on a Grid
TL;DR: This paper describes the construction of strings representing straight lines in an arbitrary direction on a grid and compares some grammatical systems that generate these strings and compares them to Lindenmayer grammars, which are quite useless but still very convenient.