Calculate the area intersected by a sphere and a rectangular prism

guv
Messages
122
Reaction score
22
Homework Statement
I am trying to figure out the area on the surface of a sphere as a result of the sphere intersecting a much smaller rectangular prism.
Relevant Equations
N/A
Think of a 3D rectilinear grid made of these rectangular cells, some of the cells will intersect with the sphere. I am trying to compute each intersecting area and the total sum. Ideally the total sum of the intersecting area should be close to ##4 \pi r^2##. I have not found any literature discussing this problem. Part of the problem is that the polygon on the sphere as a result of the intersection is not necessarily made of geodesics. Moreover, part of the rectangular prism can embed inside the sphere causing irregular intersecting shape. I am looking for ideas how to get this done correctly. Has anyone seen any problem. I would imagine this might be useful in computer science, but obviously people there are not too concerned with accuracy of the result. Thanks!
 
Physics news on Phys.org
guv said:
Homework Statement: I am trying to figure out the area on the surface of a sphere as a result of the sphere intersecting a much smaller rectangular prism.
Relevant Equations: N/A

Think of a 3D rectilinear grid made of these rectangular cells, some of the cells will intersect with the sphere. I am trying to compute each intersecting area and the total sum. Ideally the total sum of the intersecting area should be close to ##4 \pi r^2##. I have not found any literature discussing this problem. Part of the problem is that the polygon on the sphere as a result of the intersection is not necessarily made of geodesics. Moreover, part of the rectangular prism can embed inside the sphere causing irregular intersecting shape. I am looking for ideas how to get this done correctly. Has anyone seen any problem. I would imagine this might be useful in computer science, but obviously people there are not too concerned with accuracy of the result. Thanks!
If the polyhedron is inside the sphere the only possible points of intersections will be at points or edges on the polyhedron where two or more polygons meet. At least that's what I come up with based on your description.
 
How are these figures given? Do you have their equations, or are they given in a different format?
 
guv said:
Has anyone seen any problem. I would imagine this might be useful in computer science, but obviously people there are not too concerned with accuracy of the result.
They call it interface reconstruction and are very concerned with accuracy vs. computational cost.
 
Take a look at the pictures attached, I am guessing 'interface construction' is the algorithm that results in what we see in the pictures. How about area calculation? Is there any literature on how to find the intersection and area in the general case? The intersection looks like a simpler problem, the area seems difficult.
 

Attachments

  • Selection_183.png
    Selection_183.png
    147.8 KB · Views: 61
  • Selection_182.png
    Selection_182.png
    143.3 KB · Views: 89
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top