## 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.

#### Calculation of time complexity, Example: Assume the following of code: ...

Example: Assume the following of code: x = 4y + 3 z = z + 1 p = 1 As we have been seen, x, y, z and p are all scalar variables & the running time is constant irrespective

#### Hashing, explain collision resloving techniques in hasing

explain collision resloving techniques in hasing

#### Comparisions and assignments in worst case, Q. Calculate that how many key ...

Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case?        Ans: The worst case performance occurs in insertion

#### Spanning trees, Spanning Trees: A spanning tree of a graph, G, refer to a ...

Spanning Trees: A spanning tree of a graph, G, refer to a set of |V|-1 edges which connect all vertices of the graph. There are different representations of a graph. They are f

#### Define chaining process of hashing, Chaining In this method, instead of...

Chaining In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element havi

#### Determine the stereo vision, Determine the stereo vision There is still...

Determine the stereo vision There is still one more major item missing, before we can look at a computer display or plot and perceive it just as we see a real object, namely th

#### Arithmetic expression, How to convert infix postfix and prefix??

How to convert infix postfix and prefix??

#### Primitive data structure, Primitive Data Structure These are the basic ...

Primitive Data Structure These are the basic structure and are directly operated upon by the machine instructions. These in general have dissimilar representations on different

#### Stacks, Q. Explain w hat are the stacks? How can we use the stacks  to chec...

Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

#### Ruby implements range of t abstract data type, Ruby implements Range of T A...

Ruby implements Range of T Abstract data type Ruby implements Range of T ADT in its Range class. Elements of carrier set are represented in Range instances by recording interna  