Cone is a three-dimensional structure having a circular base where a set of line segments, connect all of the points on the base to a common point called apex. A cone can be seen as a set of non-congruent circular discs that are stacked on one another such that ratio of the radius of adjacent discs remains constant. The area is a cone is computed as A = (s sin(x))? where, "s" is the slant and "x" is the angle in radian. Write a C++ program that computes the area A of Cone by reading its parameter from a text file "input.txt". Each line of the file represents the Cone name, the slant "s" and the angle "x" of a Cone, respectively. The program should read each line to compute the area A of each Cone. It should also display the minimum computed area. Your program should implement the following functions: Area(): This function receives the values of "s", and "x" then computes and returns the value of area A. Print(): This function receives the name of Cone and the computed area A then displays on the output screen. The input file and sample output are as shown below:

Cone is a three-dimensional structure having a circular base where a set of line segments, connect all of the points on the base to a common point called apex. A cone can be seen as a set of non-congruent circular discs that are stacked on one another such that ratio of the radius of adjacent discs remains constant. The area is a cone is computed as A = (s sin(x))? where, "s" is the slant and "x" is the angle in radian. Write a C++ program that computes the area A of Cone by reading its parameter from a text file "input.txt". Each line of the file represents the Cone name, the slant "s" and the angle "x" of a Cone, respectively. The program should read each line to compute the area A of each Cone. It should also display the minimum computed area. Your program should implement the following functions: Area(): This function receives the values of "s", and "x" then computes and returns the value of area A. Print(): This function receives the name of Cone and the computed area A then displays on the output screen. The input file and sample output are as shown below:

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section: Chapter Questions

Problem 4PP

See similar textbooks

Similar questions

The compass gradient operators of size 3x3 are designed to measure gradients of edges oriented in eight directions: E, NE, N, NW, W, SW, S, and SE. i) Give the form of these eight operators using coefficients valued 0, 1 or – 1. ii) Specify the gradient vector direction of each mask, keeping in mind that the gradient direction is orthogonal to the edge direction.
If there are two equal angles in a given triangle, then their corresponding opposite sides must be equal.
This problem is on Computer Graphics and is based on the topic 'Perspective Projection'. Please provide a step-by-step solution to the problem and explain the steps. The solution must include the General purpose perspective projection matrix. Question: Let a 3D point (423, -423, 423) be projected on a projection plane. Given that the center of the projection plane is (0.0, 0.0, -423.0) and the coordinate of the COP is (4, 2, 3). Determine the coordinate of that 3D point on the projection plane using a general purpose perspective projection matrix.
Let a be the angle between the vectors u=(3.0.4) and v-(4.0.3). Then* O None of these O sin(a)= 24/25 cos(a)= 24/25 cos(a)= - 24/25
One of the most important mathematical problems through all times has been to find the area of a polygon. For example, real estate areas often had the shape of polygons, and the tax was proportional to the area. Suppose we have some polygon with vertices ("corners") specified by the coordinates (x1,y1), (x2,y2), …, (xn,yn), numbered either in a clockwise or counter-clockwise fashion around the polygon. The area A of the polygon can amazingly be computed by just knowing the boundary coordinates: A=12|(x1y2+x2y3+⋯+xn−1yn+xny1)−(y1x2+y2x3+⋯+yn−1xn+ynx1)|.(17) Write a function polygon_area(x, y) that takes two coordinate lists with the vertices as arguments and returns the area. Test the function on a triangle, a quadrilateral, and a pentagon where you can calculate the area by alternative methods for comparison. Hint. Since Python lists and arrays has 0 as their first index, it is wise to rewrite the mathematical formula in terms of vertex coordinates numbered as x0,x1,…,xn−1 and…
please solve in matrix form (computer graphics) Translate object ABCD with co-ordinates A(0, 0, 0), B(3, 0, 0), C(3, 3, 3), D(0, 3, 0) by 2 units in all direction and then scale it by 1 units in x direction and - units in y direction and no change along z-direction about (1, 2, 1). 4
Let v be a vector whose coordinates are given as v = [vx, Vy, Vz. If the quaternion Q represents a rotation, show that the new, rotated coordinates of v are given by Q(0, Vx, Vy, Vz)Q*, where (0, vx, Vy, Vz) is a quaternion with zero as its real component.
3) Show that the set of three-dimensional coordinates {(x, y, z)|x, y, z E Z} has size equal to N.
Translate a triangle with coordinates A(2, 2), B(6, 2) and C(4, 4) with translation vector [4 7] (T).
Suppose images f(x,y) and g(x,y) have histograms h; and hg. Suppose you form image k(x,y) as the sum of these two images: k(x,y) = f(x,y) + g(x,y). (a) Under what conditions (on images f and g) can you determine the histogram hų of image k in terms of the histograms hf and hg? (That is, under what conditions can you determine hu if you are only given hj and he? Hint: this turns out to be fairly restrictive.) (b) Explain how you would derive hỵ in this case.
On a chess board of r rows and c columns there is a lone white rook surrounded by a group of opponent's black knights. Each knight attacks 8 squares as in a typical chess game, which are shown in the figure - the knight on the red square attacks the 8 squares with a red dot. The rook can move horizontally and vertically by any number of squares. The rook can safely pass through an empty square that is attacked by a knight, but it must move to a square that is not attacked by any knight. The rook cannot jump over a knight while moving. If the rook moves to a square that contains a knight, it may capture it and remove it from the board. The black knights. never move. Can the rook eventually safely move to the designated target square? The figure illustrates how the white rook can move to the blue target square at the top-right corner in the first sample case. The rook captures one black knight at the bottom-right of the board on its way. Rok nd kight lcoes by Chunen Input The first line…
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B