Tiny tim :o
1) the length of the vector you get by the cross product of the vector from point p to point b and normal n equals to r, the radius of the cylinder.
2) the vector you get by the cross product above equals to the vector you get by multiplying scalar r with vector e, which is a unit...
If I have a cylinder with a radius r and an axis that passes through point b with the
direction of vector n, show that its equation can be written in any of the following forms:
1) ||(p-b) X n|| = r
2) (p - b) X n = r.e (where e s ia unit vector orthogonal to n)
3) ||(p-b) - ((p-b).n)n|| =...
Right, I'm sorry for the mess...
p and b are points, n is a vector and e is a unit vector as described.
Also, the | | indicates size of vector...
I'm confused with all the definitions so that's the reason for the wrong titling, sorry again...
If I have a cylinder with a radius r and an axis that passes through point b with the
direction of vector n, show that its equation can be written in any of the following forms:
1) |(p-b) X n| = r
2) (p - b) X n = r.e (where e s ia unit vector orthogonal to n)
3) |(p-b) - ((p-b).n).n| = r...
Hi there,
The two given lines:
1) x / 2 = (y-1) / 2 = z
2) x + 1 = y – 2 = (z + 4) / 2
I need to find the common perpendicular between them.
Though when I tried to calculate the distance between them, I get 0.
Can someone please help?
Thanks in advance
Hi there,
The two given lines:
1) x / 2 = (y-1) / 2 = z
2) x + 1 = y – 2 = (z + 4) / 2
I need to find the common perpendicular between them.
Though when I tried to calculate the distance between them, I get 0.
Can someone please help?
Thanks in advance
A data file contains a sequence of 8-bit characters such that all 256 characters are about as common: the maximum character frequency is less than twice the minimum character frequency. Prove that Huffman coding in this case is not more efficient than using an ordinary 8-bit fixed-length code...
I'm having problem to solve this problem in DP:
Given 2 subsequences:
X = {x1, x2,..., xm} and Y = {y1, y2, ... , yn}
so `n <= m` and also `y1 <= y2 <= ... <= yn`.
The goal is to find a sub-sequence of `X` (xi1, xi2, ... , xin) such that:
sum(k is 1 to n) | xik - yk | is...
If I need to write a c program which get a string from the stdin and prints it after a certain manipulation, the program is called that way:
echo "Hello, World. bla bla bla" | program <arg>
How can I save the string in my program before working on it?
Thanks in advance