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

State algorithm to insert node p at the end of a linked list, Algo rithm t...

Algo rithm to Insert a Node p at the End of a Linked List is explained below Step1:   [check for space] If new1= NULL output "OVERFLOW" And exit Step2:   [Allocate fr

Mcs-021, #questWrite an algorithm for multiplication of two sparse matrices...

#questWrite an algorithm for multiplication of two sparse matrices using Linked Lists.ion..

Deletion of an element from the linear array, Program will demonstrate dele...

Program will demonstrate deletion of an element from the linear array /* declaration of delete_list function */ voiddelete_list(list *, int); /* definition of delete_list

Algorithm of binary search, Step 1: Declare array 'k' of size 'n' i.e. k(n)...

Step 1: Declare array 'k' of size 'n' i.e. k(n) is an array which stores all the keys of a file containing 'n' records Step 2: i←0 Step 3: low←0, high←n-1 Step 4: while (l

Representation of sets?, A set s is conveniently shown in a computer store ...

A set s is conveniently shown in a computer store by its characteristic function C(s). This is an array of logical numbers whose ith element has the meaning "i is present in s". As

Programs, Develop a program that accepts the car registration( hint: LEA 43...

Develop a program that accepts the car registration( hint: LEA 43242010)

Procedure to delete all terminal nodes of the tree, Q. Let a binary tree 'T...

Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.       A n s . fun ction to Delete Terminal Nodes from Binary Tree

Two-dimensional array, Two-dimensional array is shown in memory in followin...

Two-dimensional array is shown in memory in following two ways:  1.  Row major representation: To achieve this linear representation, the first row of the array is stored in th

Explain the array and linked list implementation of stack, Question 1. ...

Question 1. How can you find out the end of a String? Write an algorithm to find out the substring of a string. 2. Explain the insertion and deletion operation of linked lis

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