View of DESIGN OF ITERATIVE GRAPHIC SYSTEM FOR LINE & CIRCLE DRAWING ALGORITHMIC APPLICATIONS

(1)

ACCENT JOURNAL OF ECONOMICS ECOLOGY & ENGINEERING Peer Reviewed and Refereed Journal (International Journal) ISSN-2456-1037

Vol.04,Special Issue 05, (ICIR-2019) September 2019, Available Online: www.ajeee.co.in/index.php/AJEEE

1

DESIGN OF ITERATIVE GRAPHIC SYSTEM FOR LINE & CIRCLE DRAWING ALGORITHMIC APPLICATIONS

Mohammed Khalid Kaleem¹, M. Javed Idrisi²

1Research Scholar, Department of CSE, Dr. A.P.J. Abdul Kalam University, Indore, MP

2Assistant Professor, Department of Mathematics, Mizan Tepi University, Ethiopia

Abstract - This paper introduces the architecture of iterative graphic system for line and circle drawing algorithmic applications. Basically, in computer graphics, raster type system is most widely used. The CPU central processing unit (CPU) performs the operation by following the system bus which is most important component of computer graphic. The system bus will control the overall operation of the system. The obtained video signals are controlled by the video controller and it is displayed on the monitor. From system bus, the effective input output devices are obtained. Memory system will store the information which comes from system bus and other devices having certain guiding significance. It is good for students to master relevant knowledge and improve their professional skills. This proposed architecture is mainly used in the applications of line and circle drawing algorithm.

Keywords: Line and circle drawing algorithm, CPU (central processing unit), computer graphics, system bus, system memory, display processor.

I. INTRODUCTION

Computer Graphics involves technology to access picture elements which then process transforms and presents information in a visual form. In today life, computer graphics has now become a common element in user interfaces, T.V. commercial motion pictures [1]. Computer Graphics is the creation of pictures with the help of a computer. The end product of the computer graphics is a picture which may be a business graph, drawing, and engineering.

In computer graphics, two or three- dimensional pictures can be created that are used for research. Many hardware devices algorithm has been developing for improving the speed of picture generation with the passes of time.

It includes the creation storage of models and image of objects. These models for various fields like engineering, mathematical and so on.

Computer graphics is a more active computer science subjects, but also the computer related professional courses or elective courses, its application has been deep into all areas of society [2]. The course principles is deep, and algorithms are abstract, class is limited, and with the mathematics, linear algebra, computer science and other related disciplines very closely, if the teaching process in some of the links are not handled properly, will

make the students learning interest is not strong, weariness.

Therefore, in the teaching, how to arrange the teaching content more reasonably, what method should be taken to make the students accept and understand the algorithm and can achieve on the computer is very important. Through many years of graphics teaching, in the algorithms we achieve the process of selecting good programming software is very important. Because of Visual C + + (VC) in graphics programming has a larger advantage. Therefore, if we can combine the graphics in teaching of VC programming, can greatly improve the students' positive and initiative, so as to improve the students' learning efficiency [3].

This course involves many subjects, research contents, theory and practice.

Because computer graphics is not the core course of computer undergraduate education, most colleges and universities have not given enough attention in the curriculum setting. Elective course is less, and most of the students who just hold elective credits with the idea, to study hard, but due to the limited time, teachers in the classroom can not be on all the algorithms in-depth explanation and explanation only ability of students to understand the principle of the algorithm is simple, only on the limited class time, they failed to

(2)

2 thoroughly experience of rigorous, sophisticated algorithm and realization method; and the part of the teachers to teach the course itself did not accumulate enough graphics knowledge, also not engaged in graphics work, some content can only speak generally echo what the books say, explain unclear, some even skip, lead students do not understand, learning interest is not strong weariness. Based on this, in order to let the students learn the real knowledge, we must implement the related algorithms, deepen understanding in practice [4].

2 RELATED WORK

The improvement of PC designs, or basically alluded to as CG, has made PCs simpler to communicate with, and better for comprehension and translating numerous kinds of information. Advancements in PC illustrations have profoundly affected numerous kinds of media and have reformed the movement and computer game industry. Today, PCs and PC created images contact numerous parts of our everyday life. PC symbolism is found on TV, in papers, for instance in their climate projections, or in a wide range of therapeutic examination and surgeries [5].

The below figure (1) shows that, computer graphics is divided into two types. They are iterative computer graphic and non iterative computer graphic. Iterative computer graphic will change the produced image and in the same way, non iterative computer graphic is used to control the image.

Fig. 1: types of computer graphics (a) Non-Interactive or Passive Computer Graphics:

In non-interactive designs, the image is delivered on the screen, and the client

doesn't have any controlled over the picture, i.e., the client can't roll out any improvement in the rendered picture. One case of its Titles appeared on T.V.

Non-interactive Graphics includes only single direction correspondence between the PC and the client, User can see the delivered picture, and he can't roll out any improvement in the picture.

(b) Interactive Computer Graphics:

In interactive Computer Graphics client have a few powers over the image, i.e., the client can roll out any improvement in the created picture. One case of it is the ping- pong game. Intuitive Computer Graphics require two-path correspondence between the PC and the client. A User can see the picture and roll out any improvement by sending his order with an info gadget.

The cutting edge illustrations show is exceptionally straightforward in development. It consists of three components:

1. Frame Buffer or Digital Memory 2. A Monitor likes a home T.V. set

without the tuning and receiving electronics.

3. Display Controller or Video Controller: It passes the contents of the frame buffer to the monitor.

Raster illustrations, likewise called bitmap designs, a sort of computerized picture that utilizations small rectangular pixels, or picture components, masterminded in a framework development to speak to a picture. Since the configuration can bolster a wide scope of hues and delineate unobtrusive graduated tones, it is appropriate for showing constant tone pictures, for example, photos or concealed drawings, alongside other nitty gritty pictures.

Basically, straight line may be defined by two endpoints & an equation. In fig the two endpoints are described by (x1, y1) and (x2, y2). The equation of the line is used to determine the x, y coordinates of all the points that lie between these two endpoints.

We must appropriate the line by choosing addressable points close to it. If we choose well, the line will appear straight, if not, we shall produce crossed lines. The lines must

(3)

3 be generated parallel or at 45° to the x and y-axes. Other lines cause a problem: a line segment through it starts and finishes at addressable points, may happen to pass through no another addressable points in between.

3 ARCHITECTURE OF ITERATIVE GRAPHIC SYSTEM

Originally, a raster graphics system merely was a dedicated section of system memory, the so called frame buffer, connected to a video controller (sometimes called display controller). This basic system is shown in figure 1. The host CPU needed to play out all the preparing expected to create a picture. Indeed, even on a quick PC nonetheless, picture age takes substantially more time than the industriousness time of the phosphor of the screen (commonly 10- 60 milliseconds). Accordingly, coming about shading estimations of individual picture components (pixels) are put away in the edge cushion from which a screen invigorate process, dealt with by the video controller, can be started. At an adequately quick rate, regularly 60-100Hz, the video controller peruses in the advanced pixel information from the edge cradle and creates from that information the simple video signal. The pixel information changes relying upon the sort of framework: a monochrome framework has one piece for every pixel, a full shading framework may have up to 36 bits for every pixel (12 bits for every one of the red, green and blue video signals).

Fig. 2: Architecture of Iterative Graphics System

The foundation of the proposed framework, appeared in Fig. 2 is a synchronous illustrations transport (system bus) which

gives the correspondence way between various modules in the framework. The transport is adequately wide (24 bits) that all data for one rudimentary exchange is moved in one transport cycle. This rudimentary exchange would then be able to move three 8 piece pixel segments to three picture memory banks in on cycle.

The transport is "position autonomous" so that there are no committed positions or openings, and it doesn't force a convention on the substance of the information. In this way, when another module is characterized, the convention for correspondence among it and the controller is totally private to the source and goal modules. Just the procedures of handshaking and need calculation are obtained.

The display processor has a huge memory apportioned into planes. Each plane contains one piece for each x,y facilitate point, or pixel, on the screen.

IOherefore a memory pla~8 for a high goals (2 10 x 2 ) show contains 2 bits. A memory

"bank" is comprised of 8 planes, and accordingly contains 8 bits for every pixel. A total redgreen-blue picture requires three memory banks, one for each shading. The memory can be thought of as a 3D shape with the X and Y tomahawks relating to the X and Y tomahawks on the presentation and the Z hub spreading over the memory planes, as appeared in fig. 2. The memory can be perused from or composed into in two legitimately various ways . The primary gets to a solitary piece from each plane, from up to 24 plane~ in three banks. In this manner, one read cycle gets to the three shading parts at one arrange area.

The arrangement of directions comprises of two gatherings supporting the two fields in which we are intrigued:

intuitive illustrations and picture preparing.

Intuitive illustrations are bolstered with directions that yield lines or 'zones to the casing cradle. These lines and territories may have uniform, or consistently decreased force and shading. A few directions are fit to building the picture object by item. Others are examine line arranged. The decision is managed by the calculations used to produce the picture.

Picture preparing is upheld by an enormous collection of pixel activities which grant the transmission of qualities to or from the edge

(4)

4 cradle. The directions work on important elements - line or segment of pixels, square neighborhood or discretionarily characterized districts.

Each command endeavors to execute straightforwardly the capacities that one would characterize in call groupings in an all around structured help bundle. Thusly, the connection between the call from an application program and the processor guidance is basic and direct. The type of the direction is appeared in Fig. 2.

The direction itself comprises of a couple of 16 piece woru3. The first contains the activity code and a modifier. The subsequent word, when required contains the information mean the square of information words that pursues.

We have stayed away from the normal routine with regards to including order bits and banners in information words. Show directions might be passed from the host PC to the showcase controller in one of two modes. In the essential mode each direction is executed as it is gotten 'and isn't held. The controller goes about as though it were designed. The subsequent mode licenses putting away successions of directions in the full scale memory as subroutines. Ensuring directions can summon every one of the subroutines.

Since most directions can utilize either relative or outright row section tending to, the put away subroutine grants rehashed tasks on pixel neighborhoods. Such activities are experienced every now and again in picture preparing.

4 CONCLUSIONS

In this paper, the architecture of iterative graphic system is implemented for the line and circle drawing applications. The basic algorithm, completed the program design language to graphical images revealed that the transformation. We developed the graphics experiment platform, in certain procedures which can meet the demand of computer graphics, has provided the condition for the combination development of late algorithm, and has a certain theoretical and practical significance. Hence the proposed architecture gives effective result and most widely used in various applications.

REFERENCES

1. Zhang Yi, Li Changhua. Filling algorithm for arbitrary shape based on boundary tracking [J]. Computer engineering and design, 2015, 36(3):725-728.

2. Wang Jiexiong, Chen Guodong, Chen Yi.

Liver CT image segmentation algorithm based on improved B-adder model [J]. computer

engineering and

application,2015，51（9）:152-157

3. Xu shengpan, Liu Zhengjun, ZuoZhiquan.

Improved active-edge-table area filling algorithm [J]. Computer Engineering and Applications, 2014, 50(17):178-181.

4. Li Honglin, Liu Kun. Circle area filling based on the line drawing algorithm of circle symmetrical equidistant points [J]. Journal of Yunnan Nationalities University: Natural Science Edition, 2013, 22 (4) 292-294.

5. Du Jianjun, Guo Xinyu, Sheng Lian Lu etc.

Based on optimal neighborhood region filling algorithm [J]. China stereo and image analysis. 2013, 18 (2): 109-114.

6. Du Jianjun, Guo Xinyu, Lu Shenglian. A region filling algorithm based on optimal neighborhood relativity [J]. Chinese journal of stereology and image analysis, 2013, 18(2):109-114.

7. Yin Hongxia, Du Sichun, Cai Lijun. Computer graphics [M]. Beijing: China Water Conservancy and Hydropower Press, 2005.

8. Rosenfeld A，Pfaltz J L.Sequential operations in digitalpicture processing［J］.Journal of the ACM，1966，13( 4) : 471-494.．

9. Zhang Yikuan. Computer graphics [M]. Xi'an:

Xi'an Electronic and Science University press, 2006:58-64.

10. Fu Yuchen, Zhou Dong Ru. Computer graphics: principle, method and application.

Wuhan: Huazhong University of Science and Technology press, 2003 248-249.