Volume Bound By Multiple Solids

NullSpaceMan
Messages
8
Reaction score
0
Hi,

I have a question regarding appropriate methods of finding volumes bound by geometric solids. I can work through the math in MatLab by finding points in common within each solid volume...but it is very laborious and I thought that I'd ask you math people how you would tackle this problem. I am just a poor helpless fizzer.

I am working on designing a detector for my undergrad thesis, and the cones represent a sensor's aperture and the spheres an event.


A basic example of the type of problem I am looking at in cylindrical co-ords:

A cylinder's axis is parallel to \hat{z}-direction and is placed at the origin where its radius = 'R'. The centres of three sphere are placed in the cylinder all with different radii (a1, a2, a3), all of which can exceed 'R'. At the surface of the cylinder are the apex of three cones and normal vectors of each cone base point in the -\hat{r}-direction.

I am interested in finding the volume of the overlapping shapes and the "overlapping density" (OD)..i.e how many solids are binding a bound volume...

..e.g
see: http://www.daviddarling.info/images/Venn_diagram.gif
See the centre area of three overlapping circles, the OD = 3
 
Mathematics news on Phys.org
No ideas??
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top