Basic Features-Computer Aided Design-Lecture Slides, Slides of Computer Aided Design (CAD)

Prof. Ujesh Chauhan delivered this lecture at Agra University for Computer Aided Design. It includes: Basic, Features, Rasterization, DDA, Breseham, Algorithm, Antialiasing, Raster, Display, Database

Typology: Slides

2011/2012

Uploaded on 07/19/2012

shabo-rani
shabo-rani 🇮🇳

4.3

(27)

97 documents

1 / 7

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Rasterization
Vectorial information to Equivalent raster format
such that the frame buffer can be filled with that
info.
DDA Algorithm
Eqn. of a straight line. ( Computations
cumbersome/long)
Simplified Calculation procedure
Breseham’s Algorithm
Further improvement in calculations
Same line eqn.
Basic argument for positioning the pixel here is
the amount of deviation by which the Calculated
position is from the actual position.
docsity.com
pf3
pf4
pf5

Partial preview of the text

Download Basic Features-Computer Aided Design-Lecture Slides and more Slides Computer Aided Design (CAD) in PDF only on Docsity!

Rasterization Vectorial information to Equivalent raster formatsuch that the frame buffer can be filled with thatinfo. DDA Algorithm Eqn. of a straight line. ( Computationscumbersome/long)Simplified Calculation procedure Breseham’s Algorithm Further improvement in calculationsSame line eqn.Basic argument for positioning the pixel here isthe amount of deviation by which the Calculatedposition is from the actual position.

Antialiasing Lines Due to rasterization; Roundoff

staircase effect

worse for low angle lines; low resolution screensEffect decreased byANTI-ALIASING: Intensity of pixel madeproportional to the area covered by line thickness(Computationally intensive)RASTER DISPLAY ulilizes unequal no. of pixelsdepending on the orientation in space.Solution-

brightness of pixels based on inclination

Database Structures for Graphics Modelling Major functions of a database are1. To manipulate data on screen; zoom/pan2. To interact with user; filleting, streching,trimming3. To evaluate properties like areas, volumes,MOI-^

Complexity of database depends on type ofmodelling & Info. Retrieving capabilities built in it.

-^

Info. Contained is interdependent & access thrulabels and pointers from interconnected files

-^

  1. Organizational data & Tecnological data -^

Modelling/drawing generation requires databasestructure which is simple and easy to amend.

-^

Sequential form with. Random access files

-^

Same data required at a no. of places

  • BREPBoundary

faces

edges (curves/lines)

vertices

RELATIONAL DatabaseGraphical database is organized in terms of number oftables that are interlinked by relations

3D Transformations

  • Translation• Scaling• Reflection

Projections • Orthographic• Isometric• Perspective ClippingHidden lines