An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the
An Isodata algorithm for straight line fitting
โ Scribed by Tsai-Yun Phillips; Azriel Rosenfeld
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 575 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper presents two parallel algorithms for generating graphics primitives on a raster scan display device. The first algorithm is for drawing straight lines and the second is for drawing circles. The line algorithm requires three integer multiplies and one or two integer divides in its setup an
Recently, a crisp robust median-of-intercept (MI) straight-line fitting algorithm was devised for use in image-processing applications. The algorithm is specifically designed for use in noisy images when the input data is corrupted with both noise and outliers. In this article we describe a fuzzy MI
In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the