Explain the concept of colouring, Data Structure & Algorithms

Assignment Help:

Colouring

The use of colours in CAD/CAM has two main objectives : facilitate creating geometry and display images. Colours can be used in geometric construction. In this case, various wireframe, surface, or solid entities can be assigned different colours to distinguish them. Colour is one of the two main ingredients (the second being texture) of shaded images produced by shading algorithms. In some engineering applications such as finite element analysis, colours can be used effectively to display contour images such as stress or heat-flux contours. 

Black and white raster displays provide achromatic colours while colour displays (or television sets) provide chromatic colour. Achromatic colors are described as black, various levels of gray (dark or light gray), and white. The only attribute of achromatic light is its intensity, or amount. A scalar value between 0 (as black) and 1 (as white) is usually associated with the intensity. Thus, a medium gray is assigned a value of 0.5. For multiple-plane displays, different levels (scale) of gray can be produced. F

 

286_data structure.png


Related Discussions:- Explain the concept of colouring

Array implementation of a queue, Since the stack is list of elements, the q...

Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

HUFFMAN CODING, Ask question 1. Indicate whether each of the following prop...

Ask question 1. Indicate whether each of the following properties is true for every Huffman code. a. The codewords of the two least frequent symbols have the same length. b. The

What are the dynamic arrays, What are the Dynamic arrays Dynamic arrays...

What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Maximum degree of any vertex in a simple graph, The maximum degree of any v...

The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

Dijkstra's algorithm, Q. Explain Dijkstra's algorithm for finding the short...

Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

Define data model, Define data model?  A data model is a collection of ...

Define data model?  A data model is a collection of conceptual tools for explaning data, data relationships, data semantics and consistency constraints.

Explain about the doubly linked list with neat diagram, Problem 1. Expl...

Problem 1. Explain about the doubly linked list with neat diagram. Diagram Explaining doubly linked list 2. Explain what are the criteria to be used in evaluatin

Threaded binary tree, i need the full concept of it... please can anyone pr...

i need the full concept of it... please can anyone provide

Algorithm, Example of worse case of time

Example of worse case of time

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd