
Home  Search Forums  Register  Forum Rules  Man Pages  Unix Commands  Linux Commands  FAQ  Members  Search  Today's Posts  Mark Forums Read 
Shell Programming and Scripting BSD, Linux, and UNIX shell scripting — Post awk, bash, csh, ksh, perl, php, python, sed, sh, shell scripts, and other shell scripting languages questions here. 

Thread Tools  Search this Thread  Display Modes 
#1




Returns points of an ellipse
Hi, Dose any one know, How can i return a 3D ellipse points if i have these information about the ellipse? All 3 length of axes, dip of each plane and azimuth of each axes. Code:
i.e., axes length=(1 cm, 2 cm, 3cm);dip of planes=(15 deg, 80 deg);azimuth of each axes=(10 deg,50 deg, 120 deg). I think at first i have to solve the ellipse equations and then returns it's points. I want to use these point to plot a 3D ellipse with GMT package. 
Sponsored Links  

#2




Is a 3d ellipse a 2d ellipse on a plane in 3D? Standard rotation, translation and scaling would return you to a unit ellipse in the xy z=0 plane. And viceversa, in reverse order.

The Following User Says Thank You to DGPickett For This Useful Post:  
saeed.soltani (03272013) 
Sponsored Links  

#3




yes, it's a 3d ellipse and i want to draw it in a 2D plane. [in three 2D plane, XY,XZ,YZ]

#4




Not an ellipsoidal solid (an ellipse spun on the line through its axes), then, just an ellipse in a plane.
I guess an ellipse reduced to a unit ellipse is a circle, so not so much scaling as rotation and translation. Do you start with just a few points? Takes three to set the plane, which sets the rotation need, and then I expect a couple more to fix the ellipse in position, size and orientation. Having the axes is so much more concise than having random edge points. Obviously, some points might be redundant in fixing the ellipse, such as 4 points of a rectangle, which the solution must be robust in detecting. The characteristic of an ellipse is that the reflection angles of rays from one axis hit the other, but trig is processing expensive and not friendly for gaussjordan reduction. More friendly is that all points have the same sum of distances from the two axes, and are in the surface of a cone. ThreeD distance is not friendly, but after rotation it is 2d. The 2d distance calc is polynomial, but with the right scaling, separately for x and y, and translation, the first order terms might be zeroed, so the squares become substitute terms in the GJ. It is reminiscent of deriving the binomial theorem, if you recall back then! There are colections of solutions for most geometric problems, but doing it yourself is so much nicer. I recall regenerating the binomial theorem while taking a math SAT (got 800), but since then for some reason it has stuck! I never liked the trig in calculus, as there were so many identities to memorize, but most Integral Calculus tests were open book. Last edited by DGPickett; 03272013 at 11:55 AM.. 
Sponsored Links  

Thread Tools  Search this Thread 
Display Modes  
More UNIX and Linux Forum Topics You Might Find Helpful  
Thread  Thread Starter  Forum  Replies  Last Post 
Points?  candlejack  Post Here to Contact Site Administrators and Moderators  1  01252009 06:23 AM 
mount points  JamesByars  UNIX for Advanced & Expert Users  9  08162008 08:36 AM 
How can I get entries between two points  openspark  Shell Programming and Scripting  3  08072008 05:31 PM 
Gnuplot question: how to plot 3D points as colored points in map view?  karman  UNIX and Linux Applications  0  09242007 08:03 AM 
mount points  manderson19  UNIX for Advanced & Expert Users  3  04292002 04:11 PM 
