"Optimized" Plane

*To*: mathgroup at smc.vnet.net*Subject*: [mg4617] "Optimized" Plane*From*: TTCJ34A at prodigy.com (DR JOHN C ERB)*Date*: Wed, 21 Aug 1996 03:25:34 -0400*Sender*: owner-wri-mathgroup at wolfram.com

August 09, 1996 1:50 P.M. (CDT) Greetings; I have a 3D array of values -- that is, for the x,y,z rectangular coordinate system I have an array of values (e.g., air densities) at each x,y,z coordinate in a given volume of space. Question: How do I find a plane which, if one adds up all the values in that plane (values in the plane are determined by the value assgined to the volume elements which the plane intersects), such that the sum of all the values in the plane are greater than the sum of values for all other planes? Stating the problem another way -- how does one find the "densest" plane? Thank you. John C. Erb ==== [MESSAGE SEPARATOR] ====