any idea on this

nash_81

hello grp....

is there any algorithm of findin the total area of an intersecting plane. i have tried with set theory if a n b r two planes,
area(a)+Area(b)-Area(a intersection b)

but it takes such a long computation when u go on adding planes to the existing ones. I want to have something which cud b easily programmable....without takin much longer 4 computations(by the processor)...

So is there any new method.....

thnx in advance

mathwonk

what do, you mean by a plane? To me a euclidean plane has infinite euclidean area.

and the intersection of two general planes in three space is a line, which has zero area, although it has infinite length.

nash_81

hi mathwonk,

sorry 4 not makin it clear...i wanna calculate the volume in principle of two intersecting cubes and mainly the volume of two intersecting regions which may have its intersection point anywhere.....jus like stemnitz solid r an intersecting cylinder..hope that makes it clear...but its not result of jus two intersecting cubes but a lot more cud b added r deleted and it may jus be anywhere...

mathwonk

i'm still pretty much in the dark as to what you want.

robphy

nash_81, let me see if I understand your question.

Given polygons A and B, calculate the total area of the union of those (possibly overlapping) polygons.

More generally, given polyhedrons A and B, calculate the total volume of the union of those (possibly overlapping) polyhedrons.

Are these your questions?

nash_81

dats wat i wan xactly