What is solid modeling, Data Structure & Algorithms

Assignment Help:

What is Solid modeling

Solid modeling is the most powerful of the 3-D modeling technique. It provides the user with complete information about the model. Defining an object with a solid model is the easiest of the available three modelling techniques (curves, surfaces and solids). Solid models can be quickly created without having to define individual locations as with wire-frames, unlike wire-frame and surface models, which contain only geometric data. Solid models contain both geometric and topological information of the object. Some of the potential advantages of solid modeling are :

(i)  Mass properties such as area, volume, weight, centre of gravity and moment of inertia can be determined quickly.

(ii)  It allows the design engineer to develop and evaluate alternative concepts for parts and assemblies while the design is still a theoretical model. Solid models are non-ambiguous.

(iii)  Cross sections can be cut through the three-dimensional models with colour used to identify and highlight different materials and various other features.

(iv)  It helps in interference checking of moving parts and the action of moving parts in three-dimensions in complex assemblies.

(v)  It is useful for preparing the technical illustrations used in manuals and other documentation because solid modeling can produce very impressive visual displays of objects, using perspective, colour shading and highlighting to create images of photographic quality.

 


Related Discussions:- What is solid modeling

Programming information system, Describe an algorithm to play the Game of N...

Describe an algorithm to play the Game of Nim using all of the three tools (pseudocode, flowchart, hierarchy chart)

Program segment for insertion of an element into the queue, Program: Progra...

Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val

Advanced data structures, In this unit, the following four advanced data st...

In this unit, the following four advanced data structures have been practically emphasized. These may be considered as alternative to a height balanced tree, i.e., AVL tree.

Nonrecursive implementation of a recursive algorithm?, What data structure ...

What data structure would you mostly likely see in a nonrecursive execution of a recursive algorithm? Stack

Polynomials - represented by using arrays, /* the program accepts two polyn...

/* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

Applications of the queue, Write down any four applications of the queues. ...

Write down any four applications of the queues.                                                            Ans. A pp li cation of Queue is given below (i)  Queue is

Determine the types of java, Determine the types of JAVA Java has two p...

Determine the types of JAVA Java has two parts... 1. Core language -- variables, arrays, objects o Java Virtual Machine (JVM) runs the core language o Core language is

Types of a linked list, A linked list can be of the following types:- ...

A linked list can be of the following types:-  Linear linked list or one way list Doubly linked list or two way list. Circular linked list Header linked list

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