## any idea on this

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.....

 PhysOrg.com science news on PhysOrg.com >> 'Whodunnit' of Irish potato famine solved>> The mammoth's lament: Study shows how cosmic impact sparked devastating climate change>> Curiosity Mars rover drills second rock target
 Recognitions: Homework Help Science Advisor 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.
 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...

Recognitions:
Homework Help