Bresenham's algorithm with Grey scale

Pitteway, M. L. V.; Watkinson, David

doi:10.1145/359024.359027

Cited by 65 publications

(17 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm achieves its speed by using table lookup to avoid complex filtering computations. The computations are so simple that it is not reasonable to exploit gray-scale and not filter properly (e.g., in [5]). …”

Section: Resultsmentioning

confidence: 99%

Filtering edges for gray-scale displays

Gupta

Sproull

1981

Proceedings of the 8th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '81

View full text Add to dashboard Cite

While simple line-drawing techniques produce "jagged" lines on raster images, more complex anti-aliasing, or filtering, techniques use gray-scale to give the appearance of smooth lines and edges. Unfortunately, these techniques are not frequently used because filtering is thought to require considerable computation. This paper presents a simple algorithm that can be used to draw filtered lines; the inner loop is a variant of the Bresenham point-plotting algorithm. The algorithm uses table lookup to reduce the computation required for filtering. Simple variations of the algorithm can be used to draw lines with different thicknesses and to smooth edges of polygons.

show abstract

Section: Resultsmentioning

confidence: 99%

Filtering edges for gray-scale displays

Gupta

Sproull

1981

Proceedings of the 8th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '81

View full text Add to dashboard Cite

show abstract

“…Another line is computed from the ending of the anchored fragment to that of the two sequences. These two lines are then discretized using Bresenhams [18] algorithm. The Bresenhams algorithm will define a discrete succession of numbers that represent the guides for the alignment procedure.…”

Section: Computation Of Alignmentsmentioning

confidence: 99%

Accelerating Exhaustive Pairwise Metagenomic Comparisons

Pérez-Wohlfeil

Torreño

Trelles

2017

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Abstract. In this manuscript, we present an optimized and parallel version of our previous work IMSAME, an exhaustive gapped aligner for the pairwise and accurate comparison of metagenomes. Parallelization strategies are applied to take advantage of modern multiprocessor architectures. In addition, sequential optimizations in CPU time and memory consumption are provided. These algorithmic and computational enhancements enable IMSAME to calculate near optimal alignments which are used to directly assess similarity between metagenomes without requiring reference databases. We show that the overall efficiency of the parallel implementation is superior to 80% while retaining scalability as the number of parallel cores used increases. Moreover, we also show that sequential optimizations yield up to 8x speedup for scenarios with larger data. BackgroundA metagenome is defined as a collection of genetic material directly recovered from the environment. In particular, a metagenome is composed of a large number of reads (DNA strings) drawn from the species present in the original population. To this day, the field of comparative metagenomics has become big-data driven [1] due to new technological improvements in high-throughput sequencing. However, the analysis of large metagenomic datasets represents a computational challenge and poses several processing bottlenecks, specially to sequence comparison algorithms.Traditional metagenomics comparison involve intermediate pairwise (and individual) comparisons against a reference database. This procedure allows to extract a mapping distribution between reads and species, and thus enables to later on compare these distributions. A similarity measure can then be computed from the two distributions. However, due to the unknown and complex composition Corresponding author.

show abstract

“…Barken [7] proposed an algorithm in parallel computation to reduce aliasing. Antialiasing techniques are discussed in Pitteway and Watkinson [8], and Chen and Ching. Parallel methods [7] for generating lines are discussed in Pang et al [9].…”

Section: Introductionmentioning

confidence: 99%

Antialiased Digital Pixel Plotting for Raster Scan Lines Using Area Evaluation

Mamatha

Reddy

Prasad

2016

Emerging Research in Computing, Information, Communication and Applications

View full text Add to dashboard Cite

A picture in digital form can be described as a formation of pixels that are to be specified by the set intensities in the display device. In engineering and design architectures drawing of the linear form of the curves predominates especially in wire frame objects. Although line plotting is a minimal concept in drawing, minimizing a fraction of the computation is considerable because objects contain enormous linear wire frames. In this paper an algorithm is proposed to plot a curve by minimizing calculations which is valued for any generalized curve.

show abstract

Bresenham's algorithm with Grey scale

Cited by 65 publications

References 3 publications

Filtering edges for gray-scale displays

Filtering edges for gray-scale displays

Accelerating Exhaustive Pairwise Metagenomic Comparisons

Antialiased Digital Pixel Plotting for Raster Scan Lines Using Area Evaluation

Contact Info

Product

Resources

About