Character generation
•Download as PPT, PDF•
14 likes•25,753 views
This document discusses three methods for generating characters in computer graphics: the stroke method, bitmap method, and starburst method. The stroke method uses line and arc functions to generate characters by assigning starting and end points. The bitmap method stores characters as arrays of pixels and allows for larger font sizes but produces aliased characters. The starburst method uses a fixed 24-bit line segment pattern to generate characters but requires more memory and produces lower quality characters with limited faces compared to the other methods.
Report
Share
Report
Share
Recommended
2D transformation (Computer Graphics)
with today's advanced technology like photoshop, paint etc. we need to understand some basic concepts like how they are cropping the image , tilt the image etc.
In our presentation you will find basic introduction of 2D transformation.
Polygon filling
The document discusses different techniques for filling polygons, including boundary fill, flood fill, and scan-line fill methods. It provides details on how each technique works, such as using a seed point and filling neighboring pixels for boundary fill, replacing all pixels of a selected color for flood fill, and drawing pixels between edge intersections for each scan line for scan-line fill. Examples are given to illustrate the filling process for each method.
Character generation techniques
There are three main methods for generating characters using software: the stroke method, vector/bitmap method, and starbust method. The stroke method uses a sequence of line and arc drawing functions defined by starting and end points. The starbust method uses a fixed pattern of 24 bit line segments to represent characters. The bitmap method stores characters as arrays of 1s and 0s representing pixels, allowing for variable font sizes by increasing the array size. All the methods can create aliased characters, and the starbust method requires extra memory to store the 24 bit segment codes.
Illumination Models & Shading
An illumination model, also called a lighting model and sometimes referred to as a shading model, is used to calculate the intensity of light that we should see at a given point on the surface of an object.
Computer graphics notes
This document provides an overview of computer graphics and its applications. It discusses various types of video display devices used in computer graphics like CRTs and flat panel displays. It describes how raster scan and random scan systems work and lists common input and output devices. The document outlines different chapters that will cover topics like line and curve generation algorithms, transformations, 3D viewing, surface detection, and modeling techniques. It provides examples of how computer graphics is used in fields like CAD, presentations, entertainment, education, visualization, image processing, and graphical user interfaces.
Cohen sutherland line clipping
The Cohen-Sutherland algorithm divides the plane into 9 regions and uses 4-bit codes to encode whether each endpoint of a line segment is left, right, above, or below the clipping window. It then uses the endpoint codes to either trivially accept or reject the line segment, or perform clipping by calculating the intersection point of the line with the window boundary and replacing the outside endpoint. The main steps are to assign codes to endpoints, AND the codes to check for trivial acceptance or rejection, clip by replacing outside endpoints if needed, and repeating for other line segments.
Overview of the graphics system
It contain description about the display technologies, raster and vector scan, hard copy devices and graphics software.
Attributes of Output Primitives
This document discusses various attributes that can be used to modify the appearance of graphical primitives like lines and curves when displaying them, including line type (solid, dashed, dotted), width, color, fill style (hollow, solid, patterned), and fill color/pattern. It describes how these attributes are specified in applications and how different rendering techniques like rasterization can be used to display primitives with various attribute settings.
Recommended
2D transformation (Computer Graphics)
with today's advanced technology like photoshop, paint etc. we need to understand some basic concepts like how they are cropping the image , tilt the image etc.
In our presentation you will find basic introduction of 2D transformation.
Polygon filling
The document discusses different techniques for filling polygons, including boundary fill, flood fill, and scan-line fill methods. It provides details on how each technique works, such as using a seed point and filling neighboring pixels for boundary fill, replacing all pixels of a selected color for flood fill, and drawing pixels between edge intersections for each scan line for scan-line fill. Examples are given to illustrate the filling process for each method.
Character generation techniques
There are three main methods for generating characters using software: the stroke method, vector/bitmap method, and starbust method. The stroke method uses a sequence of line and arc drawing functions defined by starting and end points. The starbust method uses a fixed pattern of 24 bit line segments to represent characters. The bitmap method stores characters as arrays of 1s and 0s representing pixels, allowing for variable font sizes by increasing the array size. All the methods can create aliased characters, and the starbust method requires extra memory to store the 24 bit segment codes.
Illumination Models & Shading
An illumination model, also called a lighting model and sometimes referred to as a shading model, is used to calculate the intensity of light that we should see at a given point on the surface of an object.
Computer graphics notes
This document provides an overview of computer graphics and its applications. It discusses various types of video display devices used in computer graphics like CRTs and flat panel displays. It describes how raster scan and random scan systems work and lists common input and output devices. The document outlines different chapters that will cover topics like line and curve generation algorithms, transformations, 3D viewing, surface detection, and modeling techniques. It provides examples of how computer graphics is used in fields like CAD, presentations, entertainment, education, visualization, image processing, and graphical user interfaces.
Cohen sutherland line clipping
The Cohen-Sutherland algorithm divides the plane into 9 regions and uses 4-bit codes to encode whether each endpoint of a line segment is left, right, above, or below the clipping window. It then uses the endpoint codes to either trivially accept or reject the line segment, or perform clipping by calculating the intersection point of the line with the window boundary and replacing the outside endpoint. The main steps are to assign codes to endpoints, AND the codes to check for trivial acceptance or rejection, clip by replacing outside endpoints if needed, and repeating for other line segments.
Overview of the graphics system
It contain description about the display technologies, raster and vector scan, hard copy devices and graphics software.
Attributes of Output Primitives
This document discusses various attributes that can be used to modify the appearance of graphical primitives like lines and curves when displaying them, including line type (solid, dashed, dotted), width, color, fill style (hollow, solid, patterned), and fill color/pattern. It describes how these attributes are specified in applications and how different rendering techniques like rasterization can be used to display primitives with various attribute settings.
Spline representations
a spline is a flexible strip used to produce a smooth curve through a designated set of points.
Polynomial sections are fitted so that the curve passes through each control point, Resulting curve is said to interpolate the set of control points.
Raster scan system
The document describes the components and operation of a raster scan graphics display system. A video controller accesses a frame buffer in system memory to refresh the screen. It performs operations like retrieving pixel intensities from different memory areas and using two frame buffers to allow refreshing one screen while filling the other for animation. A raster scan display processor can digitize graphics into pixel intensities for storage in the frame buffer to offload this processing from the CPU.
Bresenham's line drawing algorithm
Bresenham's line algorithm is an efficient method for drawing lines on a digital display. It works by calculating the next pixel coordinate along the line using integer math only. This avoids complex floating point calculations. It starts at the initial coordinate and iteratively calculates the next x,y coordinate using integer addition and comparisons until it reaches the final endpoint.
sutherland- Hodgeman Polygon clipping
The Sutherland-Hodgman algorithm clips polygons by clipping against each edge of the clipping window in a specific order: left, top, right, bottom. It works by testing each edge of the polygon against the clipping window boundary and either keeping or discarding vertices based on whether they are inside or outside the window. The algorithm results in a clipped polygon that only includes vertices and edge intersections that are inside the clipping window.
Cohen-Sutherland Line Clipping Algorithm
Cohen-Sutherland Line Clipping Algorithm:
When drawing a 2D line on screen, it might happen that one or both of the endpoints are outside the screen while a part of the line should still be visible. In that case, an efficient algorithm is needed to find two new endpoints that are on the edges on the screen, so that the part of the line that's visible can now be drawn. This way, all those points of the line outside the screen are clipped away and you don't need to waste any execution time on them.
A good clipping algorithm is the Cohen-Sutherland algorithm for this solution.
By,
Maruf Abdullah Rion
Unit 3
The document discusses the 2D viewing pipeline. It describes how a 3D world coordinate scene is constructed and then transformed through a series of steps to 2D device coordinates that can be displayed. These steps include converting to viewing coordinates using a window-to-viewport transformation, then mapping to normalized and finally device coordinates. It also covers techniques for clipping objects and lines that fall outside the viewing window including Cohen-Sutherland line clipping and Sutherland-Hodgeman polygon clipping.
Raster scan system & random scan system
In a raster scan system, the electron beam scans across rows of the screen from top to bottom, turning intensity on and off to illuminate spots and form an image. The image definition is stored in a refresh buffer memory that holds intensity values for screen points. In a random scan system, an application and graphics package are stored in memory, and graphics commands are translated into a display file that a display processor accesses to refresh the screen. Graphics patterns are drawn by directing the electron beam along picture lines one at a time, positioning it between coordinate-defined endpoints to fill each line.
Cyrus beck line clipping algorithm
The Cyrus-Beck algorithm is used for line clipping against non-rectangular convex polygons. It uses a parametric equation to find the intersection point of the line with the polygon boundary. The algorithm calculates the time values for the line endpoints at each polygon edge, then uses those times in the parametric equation to find the clipped line segment P'0 and P'1 that is visible within the polygon clipping window.
Hidden surface removal algorithm
This document discusses algorithms for hidden surface removal in 3D computer graphics. It describes two main classifications of algorithms - object space and image space. It then provides details on various algorithms including Painter's algorithm (object space), Z-buffer algorithm (image space), and Warnock's area subdivision algorithm. The key aspects and approaches of each algorithm are summarized.
Attributes of output primitive(line attributes)
This document discusses line attributes in computer graphics, including line type (solid, dashed, dotted), width, caps (butt, round, projecting square), joins (miter, round, bevel), and color. It describes how to set these attributes using functions like setLinetype(), setLinewidthscaleFactor(), and setPolylineColourIndex(). Lines can also be displayed using pen or brush options which have properties like shape, size, and patterns.
Clipping in Computer Graphics
Clipping is a process that extracts portions of data or scenes inside a specified clipping region. It uses endpoint codes, which assign a 4-bit code to line endpoints to indicate if they are inside or outside the clipping window. One algorithm is the Cohen-Sutherland algorithm which uses these endpoint codes to test if lines are completely inside, completely outside, or intersect the clipping window. Another is the Mid-Point Subdivision algorithm which avoids directly calculating line-window intersections by performing a binary search via dividing lines at their midpoint.
Polygon filling algorithm
This presentation contains -
- Polygon Filling Algorithm
- Inside Test - Even Odd Test
- Scanline Polygon Filling Algorithm
- Seed Filling Approach
- Boundary Fill Algorihtm
- Edge Fill Algorithm
- 4-connected polygon
- 8-connected polygon
- Flood Fill Algorithm
Dda algorithm
This document discusses the Digital Differential Analyzer (DDA) algorithm, which is a basic line drawing algorithm used in computer graphics. The DDA algorithm uses slope-intercept form (y=mx+b) to incrementally calculate pixel positions along the line between two points. It handles cases where the slope is less than or greater than 1 by incrementing either the x or y coordinate by 1 at each step. The DDA algorithm is simple to implement but requires floating point calculations and has orientation dependency issues.
Frame buffer
This presentation contains -
- Frame Buffer
- Digital-to-Analog ( DAC ) Converter
- Single bit plane frame buffer
- N-bit plane frame buffer
- 3-bit color frame buffer
- 24-bit color frame buffer
Window to viewport transformation
The document discusses window to viewport transformation. It defines a window as a world coordinate area selected for display and a viewport as a rectangular region of the screen selected for displaying objects. Window to viewport mapping requires transforming coordinates from the window to the viewport. This involves translation, scaling and another translation. Steps include translating the window to the origin, resizing it based on the viewport size, and translating it to the viewport position. An example transforms a sample window to a viewport through these three steps.
Depth Buffer Method
The depth buffer method is used to determine visibility in 3D graphics by testing the depth (z-coordinate) of each surface to determine the closest visible surface. It involves using two buffers - a depth buffer to store the depth values and a frame buffer to store color values. For each pixel, the depth value is calculated and compared to the existing value in the depth buffer, and if closer the color and depth values are updated in the respective buffers. This method is implemented efficiently in hardware and processes surfaces one at a time in any order.
Attributes of output primitives( curve attributes & area fill attributes)
Curve attributes and area fill attributes in output primitives can be customized. Areas can be filled with solid colors or patterns, with options to choose specific colors and patterns. There are three basic area fill styles - hollow with a color border, filled with a solid color, or filled with a specified pattern. The fill style is selected using the setInteriorStyle function, which can set the style to hollow, solid, or pattern. Hatching patterns can also be used to fill areas.
Seed filling algorithm
The document discusses two algorithms for filling polygons: boundary fill and flood fill. Boundary fill starts at a point inside the polygon and fills pixels until it reaches the boundary color. Flood fill replaces all pixels of a specified interior color with a fill color. Both can be implemented with 4-connected or 8-connected pixels. Flood fill colors the entire area but uses more memory, while boundary fill stops at the boundary and is more efficient.
Polygons - Computer Graphics - Notes
Polygon is a figure having many slides. It may be represented as a number of line segments end to end to form a closed figure.
The line segments which form the boundary of the polygon are called edges or slides of the polygon.
The end of the side is called the polygon vertices.
Triangle is the most simple form of polygon having three side and three vertices.
The polygon may be of any shape.
Back face detection
Back-Face Detection, Algorithm for right-handed system :,normal vector, the Algorithm for left-handed system :, Limitations :
Character generation
There are three main methods for generating characters using software in computer graphics:
1) The stroke method uses a sequence of line and arc drawing functions to generate characters by assigning start and end points. It can generate various fonts but produces aliased characters for diagonals.
2) The bitmap method stores character pixel data in an array and plots each pixel to generate the character. It can easily generate various fonts and sizes but also produces aliased characters.
3) The starburst method uses a fixed pattern of 24 line segments represented by bits to highlight lines and generate characters. It requires extra memory for the bit patterns and produces lower quality characters due to its limited templates.
IRJET - Automatic Licence Plate Detection and Recognition
This document describes a system for automatic license plate detection and recognition. The system uses image processing techniques in MATLAB to capture an image of a vehicle license plate, preprocess the image by converting it to grayscale and reducing noise, segment the license plate from the image, and recognize the characters on the plate using optical character recognition. The system is proposed to identify vehicles entering a university campus and check if they are registered in the university's database. The document outlines the methodology, which involves preprocessing, segmentation, character separation, and character recognition steps. It also discusses related work on license plate detection algorithms and presents experimental results demonstrating the system's ability to accurately extract license plate numbers from images.
More Related Content
What's hot
Spline representations
a spline is a flexible strip used to produce a smooth curve through a designated set of points.
Polynomial sections are fitted so that the curve passes through each control point, Resulting curve is said to interpolate the set of control points.
Raster scan system
The document describes the components and operation of a raster scan graphics display system. A video controller accesses a frame buffer in system memory to refresh the screen. It performs operations like retrieving pixel intensities from different memory areas and using two frame buffers to allow refreshing one screen while filling the other for animation. A raster scan display processor can digitize graphics into pixel intensities for storage in the frame buffer to offload this processing from the CPU.
Bresenham's line drawing algorithm
Bresenham's line algorithm is an efficient method for drawing lines on a digital display. It works by calculating the next pixel coordinate along the line using integer math only. This avoids complex floating point calculations. It starts at the initial coordinate and iteratively calculates the next x,y coordinate using integer addition and comparisons until it reaches the final endpoint.
sutherland- Hodgeman Polygon clipping
The Sutherland-Hodgman algorithm clips polygons by clipping against each edge of the clipping window in a specific order: left, top, right, bottom. It works by testing each edge of the polygon against the clipping window boundary and either keeping or discarding vertices based on whether they are inside or outside the window. The algorithm results in a clipped polygon that only includes vertices and edge intersections that are inside the clipping window.
Cohen-Sutherland Line Clipping Algorithm
Cohen-Sutherland Line Clipping Algorithm:
When drawing a 2D line on screen, it might happen that one or both of the endpoints are outside the screen while a part of the line should still be visible. In that case, an efficient algorithm is needed to find two new endpoints that are on the edges on the screen, so that the part of the line that's visible can now be drawn. This way, all those points of the line outside the screen are clipped away and you don't need to waste any execution time on them.
A good clipping algorithm is the Cohen-Sutherland algorithm for this solution.
By,
Maruf Abdullah Rion
Unit 3
The document discusses the 2D viewing pipeline. It describes how a 3D world coordinate scene is constructed and then transformed through a series of steps to 2D device coordinates that can be displayed. These steps include converting to viewing coordinates using a window-to-viewport transformation, then mapping to normalized and finally device coordinates. It also covers techniques for clipping objects and lines that fall outside the viewing window including Cohen-Sutherland line clipping and Sutherland-Hodgeman polygon clipping.
Raster scan system & random scan system
In a raster scan system, the electron beam scans across rows of the screen from top to bottom, turning intensity on and off to illuminate spots and form an image. The image definition is stored in a refresh buffer memory that holds intensity values for screen points. In a random scan system, an application and graphics package are stored in memory, and graphics commands are translated into a display file that a display processor accesses to refresh the screen. Graphics patterns are drawn by directing the electron beam along picture lines one at a time, positioning it between coordinate-defined endpoints to fill each line.
Cyrus beck line clipping algorithm
The Cyrus-Beck algorithm is used for line clipping against non-rectangular convex polygons. It uses a parametric equation to find the intersection point of the line with the polygon boundary. The algorithm calculates the time values for the line endpoints at each polygon edge, then uses those times in the parametric equation to find the clipped line segment P'0 and P'1 that is visible within the polygon clipping window.
Hidden surface removal algorithm
This document discusses algorithms for hidden surface removal in 3D computer graphics. It describes two main classifications of algorithms - object space and image space. It then provides details on various algorithms including Painter's algorithm (object space), Z-buffer algorithm (image space), and Warnock's area subdivision algorithm. The key aspects and approaches of each algorithm are summarized.
Attributes of output primitive(line attributes)
This document discusses line attributes in computer graphics, including line type (solid, dashed, dotted), width, caps (butt, round, projecting square), joins (miter, round, bevel), and color. It describes how to set these attributes using functions like setLinetype(), setLinewidthscaleFactor(), and setPolylineColourIndex(). Lines can also be displayed using pen or brush options which have properties like shape, size, and patterns.
Clipping in Computer Graphics
Clipping is a process that extracts portions of data or scenes inside a specified clipping region. It uses endpoint codes, which assign a 4-bit code to line endpoints to indicate if they are inside or outside the clipping window. One algorithm is the Cohen-Sutherland algorithm which uses these endpoint codes to test if lines are completely inside, completely outside, or intersect the clipping window. Another is the Mid-Point Subdivision algorithm which avoids directly calculating line-window intersections by performing a binary search via dividing lines at their midpoint.
Polygon filling algorithm
This presentation contains -
- Polygon Filling Algorithm
- Inside Test - Even Odd Test
- Scanline Polygon Filling Algorithm
- Seed Filling Approach
- Boundary Fill Algorihtm
- Edge Fill Algorithm
- 4-connected polygon
- 8-connected polygon
- Flood Fill Algorithm
Dda algorithm
This document discusses the Digital Differential Analyzer (DDA) algorithm, which is a basic line drawing algorithm used in computer graphics. The DDA algorithm uses slope-intercept form (y=mx+b) to incrementally calculate pixel positions along the line between two points. It handles cases where the slope is less than or greater than 1 by incrementing either the x or y coordinate by 1 at each step. The DDA algorithm is simple to implement but requires floating point calculations and has orientation dependency issues.
Frame buffer
This presentation contains -
- Frame Buffer
- Digital-to-Analog ( DAC ) Converter
- Single bit plane frame buffer
- N-bit plane frame buffer
- 3-bit color frame buffer
- 24-bit color frame buffer
Window to viewport transformation
The document discusses window to viewport transformation. It defines a window as a world coordinate area selected for display and a viewport as a rectangular region of the screen selected for displaying objects. Window to viewport mapping requires transforming coordinates from the window to the viewport. This involves translation, scaling and another translation. Steps include translating the window to the origin, resizing it based on the viewport size, and translating it to the viewport position. An example transforms a sample window to a viewport through these three steps.
Depth Buffer Method
The depth buffer method is used to determine visibility in 3D graphics by testing the depth (z-coordinate) of each surface to determine the closest visible surface. It involves using two buffers - a depth buffer to store the depth values and a frame buffer to store color values. For each pixel, the depth value is calculated and compared to the existing value in the depth buffer, and if closer the color and depth values are updated in the respective buffers. This method is implemented efficiently in hardware and processes surfaces one at a time in any order.
Attributes of output primitives( curve attributes & area fill attributes)
Curve attributes and area fill attributes in output primitives can be customized. Areas can be filled with solid colors or patterns, with options to choose specific colors and patterns. There are three basic area fill styles - hollow with a color border, filled with a solid color, or filled with a specified pattern. The fill style is selected using the setInteriorStyle function, which can set the style to hollow, solid, or pattern. Hatching patterns can also be used to fill areas.
Seed filling algorithm
The document discusses two algorithms for filling polygons: boundary fill and flood fill. Boundary fill starts at a point inside the polygon and fills pixels until it reaches the boundary color. Flood fill replaces all pixels of a specified interior color with a fill color. Both can be implemented with 4-connected or 8-connected pixels. Flood fill colors the entire area but uses more memory, while boundary fill stops at the boundary and is more efficient.
Polygons - Computer Graphics - Notes
Polygon is a figure having many slides. It may be represented as a number of line segments end to end to form a closed figure.
The line segments which form the boundary of the polygon are called edges or slides of the polygon.
The end of the side is called the polygon vertices.
Triangle is the most simple form of polygon having three side and three vertices.
The polygon may be of any shape.
Back face detection
Back-Face Detection, Algorithm for right-handed system :,normal vector, the Algorithm for left-handed system :, Limitations :
What's hot (20)
Attributes of output primitives( curve attributes & area fill attributes)
Attributes of output primitives( curve attributes & area fill attributes)
Similar to Character generation
Character generation
There are three main methods for generating characters using software in computer graphics:
1) The stroke method uses a sequence of line and arc drawing functions to generate characters by assigning start and end points. It can generate various fonts but produces aliased characters for diagonals.
2) The bitmap method stores character pixel data in an array and plots each pixel to generate the character. It can easily generate various fonts and sizes but also produces aliased characters.
3) The starburst method uses a fixed pattern of 24 line segments represented by bits to highlight lines and generate characters. It requires extra memory for the bit patterns and produces lower quality characters due to its limited templates.
IRJET - Automatic Licence Plate Detection and Recognition
This document describes a system for automatic license plate detection and recognition. The system uses image processing techniques in MATLAB to capture an image of a vehicle license plate, preprocess the image by converting it to grayscale and reducing noise, segment the license plate from the image, and recognize the characters on the plate using optical character recognition. The system is proposed to identify vehicles entering a university campus and check if they are registered in the university's database. The document outlines the methodology, which involves preprocessing, segmentation, character separation, and character recognition steps. It also discusses related work on license plate detection algorithms and presents experimental results demonstrating the system's ability to accurately extract license plate numbers from images.
Displaying information within a window.68
The document discusses displaying information in a window in Java. It covers displaying graphics and text in a window, using the graphics capabilities in Java to draw basic shapes like lines, rectangles, ellipses, circles, arcs, and polygons. It provides examples of using the Graphics class methods like drawLine, drawRect, drawOval, drawArc, and drawPolygon to render these shapes on a window.
Graphics mod
Graphics programming in C++ requires a graphics card and monitor. Functions like initgraph() initialize graphics mode, while cleardevice() clears the screen. Text and shapes can be drawn using functions like outtext(), circle(), and line(). Additional functions control attributes like color, font, and line style.
Session11 J2ME MID-Low Level User Interface(LLUI)-graphics
- Graphics objects allow drawing on canvases and are obtained through painting methods or mutable images. They have methods for drawing lines, shapes, text and images.
- Colors are specified with red, green, blue component values or a single integer. Grayscale is also supported.
- Basic shapes, text and images can be drawn including options for strokes, fonts, anchors and clipping regions.
PARALLEL GENERATION OF IMAGE LAYERS CONSTRUCTED BY EDGE DETECTION USING MESSA...
Edge detection is one of the most fundamental algorithms in digital image processing. Many algorithms have been implemented to construct image layers extracted from the original image based on selecting threshold parameters. Changing theses parameters to get a high quality layer is time consuming. In this paper, we propose two parallel technique, NASHT1 and NASHT2, to generate multiple layers of an input
image automatically to enable the image tester to select the highest quality detected edges. In addition, the
effect of intensive I/O operations and the number of parallel running processes on the performance of the proposed techniques have also been studied.
TRAFFIC MANAGEMENT THROUGH SATELLITE IMAGING-- Part 3
in the final we have explained the matlab code and the tool used with the original satelite images of a particular place
Computer graphics
This document contains information about computer graphics including:
1. An introduction to computer graphics, its applications, and basic functions like drawing lines, circles, rectangles.
2. Details of 4 assignments - the first involves studying graphics functions, the second develops a CPU architecture GUI, the third defines a point class, and the fourth defines line and circle drawing classes.
3. The last assignment involves writing C++ classes to draw lines using DDA and Bresenham's algorithms and inheriting from the point class, and a circle class inheriting from the line class.
Computer graphics practical(jainam)
This file contains all the practicals with output regarding GTU syllabus. so it will help to IT and Computer engineering students. It is really knowledgeable so refer these for computer graphics practicals.
Open Cv Tutorial Ii
The document discusses loading an image into OpenCV, calculating a histogram of the grayscale region of the image, and displaying basic statistics. Key steps include loading an image, converting it to grayscale, calculating the histogram, drawing the histogram values on an image, and displaying the original, grayscale, and histogram images along with calculated mean, variance, and standard deviation. The document also notes cleaning up and other OpenCV histogram functions.
Open Cv Tutorial Ii
The document discusses loading an image into OpenCV, calculating a histogram of the grayscale region of the image, and displaying basic statistics. Key steps include loading an image, converting it to grayscale, calculating the histogram, drawing the histogram values on an image, and displaying the original, grayscale, and histogram images along with calculated mean, variance, and standard deviation. The document also notes cleaning up and other OpenCV histogram functions.
IRJET - Kirsch Compass Kernel Edge Detection for Vehicle Number Plate Det...
This document describes a method for vehicle number plate detection using image processing techniques. It involves preprocessing the captured vehicle image by converting it to grayscale and binary, then using Kirsch compass kernel edge detection to locate the number plate region. Morphological operations like dilation and erosion are performed for processing. The number plate is extracted using bounding box technique and characters within are segmented. Individual characters are displayed and can be recognized using template matching. The described method aims to accurately detect vehicle number plates for applications like parking access control.
Computer graphics
The document provides an algorithm and sample program to implement Bresenham's circle drawing algorithm in C.
The algorithm reads the radius of the circle, initializes the starting points and decision variable, and then uses a do-while loop to plot pixels on the circle by incrementing x and conditionally incrementing or decrementing y based on the decision variable.
The sample program includes code to read the radius, initialize graphics mode, set starting points, and implement the do-while loop to plot pixels and delay between each pixel for visualization. It plots all four quadrants of the circle.
JavaOne 2009 - 2d Vector Graphics in the browser with Canvas and SVG
How to use Canvas and SVG to do vector graphics in your web app. 2009 will be the year of openweb vector graphics.
An Intelligent approach to Pic to Cartoon Conversion using White-box-cartooni...
This document presents an intelligent approach for converting photographs to cartoons. It proposes extracting three representations from images - the surface representation containing smooth surfaces, the structure representation containing thin color blocks and flattened surfaces, and the texture representation containing high-frequency textures and contours. A generative adversarial network is trained on these extracted representations to generate cartoonized images. The approach is implemented in a web application that allows users to upload images and obtain cartoonized outputs in a few seconds. Quantitative and qualitative evaluations demonstrate the approach outperforms previous methods.
COMPARISON OF GPU AND FPGA HARDWARE ACCELERATION OF LANE DETECTION ALGORITHM
The two fundamental components of a complete computer vision system are detection and classification.
The Lane detection algorithm, which is used in autonomous driving and smart vehicle systems, is within the
computer vision detection area. In a sophisticated road environment, lane marking is the responsibility of
the lane detection system. The warning system for a car that leaves its lane also heavily relies on lane
detection. The two primary stages of the implemented lane detection algorithm are edge detection and line
detection. In order to assess the trade-offs for latency, power consumption, and utilisation, we will
compare the state-of-the-art implementation performance attained with both FPGA and GPU in this work.
Our analysis highlights the benefits and drawbacks of the two systems.
Comparison of GPU and FPGA Hardware Acceleration of Lane Detection Algorithm
The two fundamental components of a complete computer vision system are detection and classification.
The Lane detection algorithm, which is used in autonomous driving and smart vehicle systems, is within the
computer vision detection area. In a sophisticated road environment, lane marking is the responsibility of
the lane detection system. The warning system for a car that leaves its lane also heavily relies on lane
detection. The two primary stages of the implemented lane detection algorithm are edge detection and line
detection. In order to assess the trade-offs for latency, power consumption, and utilisation, we will
compare the state-of-the-art implementation performance attained with both FPGA and GPU in this work.
Our analysis highlights the benefits and drawbacks of the two systems.
Burr Size Analysis in Drilling Process for Different Alloys using Image Proce...
This document discusses analyzing burr size in drilling processes for different alloys using image processing techniques. It aims to determine different burr dimensions and types using image processing. Researchers captured images of burrs produced from drilling various alloys and thicknesses. The images were processed in MATLAB to measure burr height, thickness, and type. The study found that image processing is an effective non-contact technique for burr analysis that can reduce costs and time compared to traditional measurement methods. The technique allows burr sizes to be predicted to aid manufacturing process planning and deburring operations.
IRJET-Hardware Co-Simulation of Classical Edge Detection Algorithms using Xil...
This document describes hardware co-simulation of classical edge detection algorithms using Xilinx System Generator. It presents designs for Robert, Prewitt, and Sobel edge detection operators using minimum FPGA resources. The designs were tested on a Spartan-3E FPGA board using JTAG hardware co-simulation. Results show the Sobel operator provides the best edge detection, followed by Prewitt and Robert. Compared to prior work, the proposed designs utilize significantly fewer FPGA slices, flip flops, and lookup tables, demonstrating more efficient implementation of the classical edge detection algorithms.
Do24738741
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Similar to Character generation (20)
IRJET - Automatic Licence Plate Detection and Recognition
IRJET - Automatic Licence Plate Detection and Recognition
Session11 J2ME MID-Low Level User Interface(LLUI)-graphics
Session11 J2ME MID-Low Level User Interface(LLUI)-graphics
PARALLEL GENERATION OF IMAGE LAYERS CONSTRUCTED BY EDGE DETECTION USING MESSA...
PARALLEL GENERATION OF IMAGE LAYERS CONSTRUCTED BY EDGE DETECTION USING MESSA...
TRAFFIC MANAGEMENT THROUGH SATELLITE IMAGING-- Part 3
TRAFFIC MANAGEMENT THROUGH SATELLITE IMAGING-- Part 3
IRJET - Kirsch Compass Kernel Edge Detection for Vehicle Number Plate Det...
IRJET - Kirsch Compass Kernel Edge Detection for Vehicle Number Plate Det...
JavaOne 2009 - 2d Vector Graphics in the browser with Canvas and SVG
JavaOne 2009 - 2d Vector Graphics in the browser with Canvas and SVG
An Intelligent approach to Pic to Cartoon Conversion using White-box-cartooni...
An Intelligent approach to Pic to Cartoon Conversion using White-box-cartooni...
COMPARISON OF GPU AND FPGA HARDWARE ACCELERATION OF LANE DETECTION ALGORITHM
COMPARISON OF GPU AND FPGA HARDWARE ACCELERATION OF LANE DETECTION ALGORITHM
Comparison of GPU and FPGA Hardware Acceleration of Lane Detection Algorithm
Comparison of GPU and FPGA Hardware Acceleration of Lane Detection Algorithm
Burr Size Analysis in Drilling Process for Different Alloys using Image Proce...
Burr Size Analysis in Drilling Process for Different Alloys using Image Proce...
IRJET-Hardware Co-Simulation of Classical Edge Detection Algorithms using Xil...
IRJET-Hardware Co-Simulation of Classical Edge Detection Algorithms using Xil...
More from Ankit Garg
Introduction to computer graphics part 2
This document discusses cathode ray tubes (CRTs) and how they work as display devices for computer graphics. It explains that CRTs contain an electron gun that emits a stream of electrons which are focused into a beam and directed to specific points on the phosphor-coated front of the picture tube. When the electron beam hits a phosphor dot, it glows proportionally to the beam strength. Color CRTs use three electron guns and a shadow mask to separately excite red, green, and blue phosphor dots, allowing for color displays. The document also covers other properties of CRTs like resolution, persistence, and aspect ratio.
Introduction to computer graphics part 1
This document discusses computer graphics systems and their components. It describes video display devices like CRTs and how they work. Color is generated using techniques like beam penetration and shadow masks. Raster scan and random scan displays are covered. Input devices for graphics like mice, tablets, and gloves are also summarized. The document provides details on graphics hardware like frame buffers, refresh rates, and video controllers.
Unit 1
This document discusses computer graphics systems and their components. It describes common display devices like CRT monitors and how they work. It explains color generation techniques in monitors using beam penetration or shadow mask methods. Input devices for graphics like mice, tablets, and joysticks are also covered. The document provides details on frame buffers, resolution, refresh rates and how raster scan displays redraw images.
Projection ppt
This document discusses different types of projections used to transform 3D objects onto a 2D plane. It describes two main types: perspective projection and parallel projection. Perspective projection uses lines that converge to a single center of projection, giving a realistic representation where distant objects appear smaller. Parallel projection uses parallel lines, preserving object proportions but without realistic foreshortening. The document provides details on characteristics, terminology, and examples of different projection techniques including orthographic and oblique projections.
Polygon filling
This document discusses different algorithms for filling polygons in computer graphics, including the scan-line fill algorithm, boundary fill algorithm, and flood fill algorithm. The scan-line fill algorithm involves horizontally scanning a polygon from bottom to top and identifying edge intersections with the scan line. The boundary fill algorithm starts at an interior point and recursively fills outward until the boundary color is encountered. The flood fill algorithm replaces all pixels of a specified interior color with a fill color within connected regions. Pseudocode and examples are provided for each algorithm.
Polygon clipping
The document discusses different algorithms for clipping polygons and lines to a viewing window, including the Sutherland-Hodgman and Weiler-Atherton polygon clipping algorithms. The Sutherland-Hodgman algorithm clips polygons by processing edges against each window boundary edge but can result in disconnected line segments or extraneous lines for concave polygons. The Weiler-Atherton algorithm addresses this by following either the polygon or window boundary depending on if the vertex pair is outside to inside or vice versa.
Numerical unit 1
This document contains 5 questions about raster systems and frame buffers:
1) It asks for the frame buffer size in bytes needed to store 12 and 24 bits per pixel for raster systems with resolutions of 640x480, 1280x1024, and 2560x2048.
2) It asks for the number of pixels that can be accessed per second and the access time per pixel for raster systems with resolutions of 640x480 and 1280x1024 refreshing at 60Hz.
3) It asks for the raster size in bytes needed to store 4 and 8 bits per pixel for a 1024x1024 raster system.
4) It asks how much time is spent scanning each row of pixels for a 1280x1024 system
Line drawing algorithm and antialiasing techniques
The document discusses computer graphics and line drawing algorithms. Module 1 covers introduction to graphics hardware, display devices, and graphics software. Module 2 discusses output primitives like lines, circles, ellipses, and clipping algorithms like Cohen-Sutherland and Sutherland-Hodgeman. It then explains the Digital Differential Algorithm (DDA) and Bresenham's line drawing algorithms for scan converting lines. DDA calculates increments in the x or y direction based on the slope. Bresenham's uses only integer calculations. Both algorithms are demonstrated with examples. The document also discusses anti-aliasing techniques like supersampling and area sampling to reduce jagged edges.
Line clipping
The document discusses the Cohen-Sutherland line clipping algorithm. It describes how the algorithm performs initial tests on a line to determine if intersection calculations are needed by checking for trivial acceptance or rejection of line segments. If a line cannot be fully accepted or rejected, it is divided at a clip edge and the process is repeated iteratively until the line is fully processed. An example of applying the algorithm to clip a line against a rectangle is also provided.
Hidden surface removal
The document discusses various algorithms for visible surface detection, which is the identification and removal of surfaces that are not visible to the user based on their perspective. It describes the Z-buffer algorithm, BSP algorithm, A-buffer algorithm, scan-line algorithm, and painter's/depth sorting algorithm. For the Z-buffer algorithm, it explains how it uses two buffers (Z-buffer and refresh buffer) to compare depth values of overlapping pixels and determine which surfaces are visible. It also discusses considerations for different viewing directions. The BSP algorithm sorts polygons from back to front using a binary space partitioning tree. The A-buffer improves on Z-buffer for transparent surfaces by using linked lists at each pixel. The scan-line
Graphics software standards
This document discusses graphics software standards. It describes GKS (Graphics Kernel System) as the first graphics software standard adopted by ISO and other organizations. GKS provides standard methods for 2D graphics and was later extended by PHIGS to support 3D graphics. PHIGS includes additional functions for object modeling, color specification, surface rendering, and picture manipulation. The document also outlines key GKS primitives like polyline, polymarker, fill area, and text - describing their functions and attributes that control appearance.
Fractal introduction and applications modified version
This document discusses fractals and their properties. It provides examples of fractals commonly found in nature, such as trees, ferns, mountains and coastlines. These natural formations cannot be easily modeled using classical geometry. Fractals are defined by their self-similarity, meaning identical patterns repeat across different scales. Common fractals like the Sierpinski triangle and Koch curve are constructed through an iterative process of replacing shapes with smaller copies. Fractals can also be generated using an iterated function system by substituting shapes repeatedly according to transformation rules.
Digital image processing & computer graphics
Digital Image Processing & Computer Graphics document discusses several topics related to digital image processing including:
1. Digital image processing involves manipulating digital images using computer programs. It includes operations like geometric transformations, image refinement to remove noise, color adjustments, and combining multiple images.
2. Computer graphics is focused on constructing images, while digital image processing is focused on manipulating existing images.
3. Common digital image processing techniques discussed include image enhancement to improve image quality, image restoration to remove degradation, image segmentation to separate objects, image resizing, compression, and feature extraction.
4. Image filtering is used to reduce noise in images using techniques like convolution with filters that target different image frequency ranges like low-pass and
Concept of basic illumination model
The document discusses concepts related to basic illumination models. It covers key components like ambient light, diffuse illumination, and specular reflection that contribute to how objects are illuminated. It notes that illumination models try to approximate real world lighting in a realistic but not perfectly accurate way. The document also discusses challenges like accounting for all light rays reflected between nearby objects and having multiple light sources and viewing directions in a scene.
Circle generation algorithm
The document describes the Breshenham's circle generation algorithm. It explains that the algorithm uses a decision parameter to iteratively select pixels along the circumference of a circle. It provides pseudocode for the algorithm, which initializes x and y values, calculates a decision parameter, and increments x while decrementing y at each step, plotting points based on the decision parameter. An example of applying the algorithm to generate a circle with radius 5 is also provided.
Applications of cg
This document provides an overview of computer graphics and its applications. It defines computer graphics as the creation and manipulation of geometric objects and images through computer programs. Some key applications discussed include:
- Computer-aided design (CAD) for modeling objects like buildings, vehicles, and products.
- Presentation graphics for illustrating data through charts, graphs, and diagrams.
- Entertainment applications like movies, games, and animation through modeling and rendering techniques.
- Education and training through interactive models of systems.
- Visualization of scientific and business data.
Additional applications covered are computer art, image processing, and graphical user interfaces.
2 d transformation
1) 2D geometric transformations include translations, scaling, and rotations. They can be represented by transformation matrices.
2) Translation moves an object by adding offsets to x and y coordinates. It can be represented by a 3x3 matrix with 1s on the diagonal and offsets as the last column.
3) Scaling enlarges or shrinks an object by multiplying x and y coordinates by scaling factors. It can be represented by a 2x2 diagonal matrix with scaling factors.
4) Rotation rotates an object by applying a trigonometric transformation to x and y coordinates. It can be represented by a 2x2 rotation matrix containing cosine and sine of the rotation angle.
3 d transformations
This document discusses 3D transformations in computer graphics including translation, rotation, scaling, and shearing. Translation simply moves an object along the x, y, and z axes and can be represented by a 4x4 matrix. Rotation is more complex in 3D and involves rotating around the x, y, or z axes. Scaling enlarges or shrinks an object along the x, y, and z axes. Shearing skews an object by changing the coordinates of one axis based on the values of another axis. The document provides formulas and examples for performing each type of 3D transformation.
More from Ankit Garg (19)
Line drawing algorithm and antialiasing techniques
Line drawing algorithm and antialiasing techniques
Fractal introduction and applications modified version
Fractal introduction and applications modified version
Recently uploaded
DfMAy 2024 - key insights and contributions
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
New techniques for characterising damage in rock slopes.pdf
rock mass characterization and New techniques for characterising damage in rock slopes
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
ACEP Magazine edition 4th launched on 05.06.2024
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Embedded machine learning-based road conditions and driving behavior monitoring
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Low power architecture of logic gates using adiabatic techniques
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
22CYT12-Unit-V-E Waste and its Management.ppt
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
5214-1693458878915-Unit 6 2023 to 2024 academic year assignment (AutoRecovere...
Bigdata of technology
A review on techniques and modelling methodologies used for checking electrom...
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
Recently uploaded (20)
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
New techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdf
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
Embedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoring
2. Operations Strategy in a Global Environment.ppt
2. Operations Strategy in a Global Environment.ppt
Low power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniques
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
5214-1693458878915-Unit 6 2023 to 2024 academic year assignment (AutoRecovere...
5214-1693458878915-Unit 6 2023 to 2024 academic year assignment (AutoRecovere...
A review on techniques and modelling methodologies used for checking electrom...
A review on techniques and modelling methodologies used for checking electrom...
Generative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of content
Character generation
- 1. AMITY UNIVERSITY, HARYANA COMPUTER GRAPHICS AnkIT GARG ASSISTAnT PROfESSOR AMITy UnIvERSITy, HARyAnA
- 2. 30/9/2008 Lecture 2 2 Character Generation Techniques Computer Graphics
- 3. 30/9/2008 Lecture 2 3 Characters Generation in CG – In computer graphics character can be generated using software. – In hardware implementation of character generation limited faces of character can be generated. – A wide variety of faces of character can be generated with software implementation. – There are three methods for generating characters using software implementation. – Stroke method – Vector method or bitmap method. – Star bust method
- 4. 30/9/2008 Lecture 2 4 Stoke method • In this method we use a sequence of line drawing function and arc functions to generate characters. • We can generate a sequence of character by assigning starting and end point of line or arc. • By using this method various faces of character can be generated by changing the values (parameters) in line and arc function.
- 5. 30/9/2008 Lecture 2 5 Stoke method • The main disadvantage of this method is when we draw a diagonal line it produce aliased character.
- 6. 30/9/2008 Lecture 2 6 Bitmap Method
- 7. Program For Bitmap Method • #include<stdio.h> • #include<conio.h> • #include<graphics.h> • main() • { • int gd,gm,i,j; int a[13][9] = { • { 0, 0, 0, 0, 1, 0, 0, 0, 0}, • { 0, 0, 0, 1, 0, 1, 0, 0, 0}, • { 0, 0, 1, 0, 0, 0, 1, 0, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 1, 1, 1, 1, 1, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • { 0, 1, 0, 0, 0, 0, 0, 1, 0}, • }; • /* Initialise graphics mode */ • detectgraph(&gd,&gm); • initgraph(&gd,&gm,"c:tcbgi"); • Lecture 2 7 for(i=0;i<13;i++) { for(j=0;j<9;j++) { putpixel(200+j,200+i,15*a[i][j]); } } getch(); closegraph(); }
- 8. Bitmap Method • This method is suitable for producing various character. • Font size of character can be increased by increasing the size of array. • The main draw back of this method is this method produce aliased character. 30/9/2008 Lecture 2 8
- 9. 30/9/2008 Lecture 2 9 Starbust Method 1. In this method a fixed pattern of line is used to generate the character. 2. In this method we use a combination of 24 bit line segment. 3. In 24 bit line segment code each bit represent a single line. 4. To highlight a line we put corresponding bit 1 in 24 bit line segment code and 0 otherwise.
- 10. 30/9/2008 Lecture 2 10 Starbust Method Disadvantages of starbust method 1. Here in this method 24 bit segment code is required to put in memory for generating character. Hence extra memory is required in this method. 2. Character quality is poor due to limited face. 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 0 1 0 1 0 1 24 bit line segment code
- 11. 30/9/2008 Lecture 2 11 THANK YOU!!