|Message: Determining extent of an arbitrary G4LogicalVolume||Not Logged In (login)|
Click on the Forum title, e.g. on the "Forums by Category" page, to read a sequence of postings to the Forum and its threads all in one page. If you are only interested in one thread or the thread following a specific posting, click the thread or the posting, which takes you to a smaller page, which contains only the part you are interested in and may be easier to navigate.
Messages are "chained" if there are only replies at the first level, i.e. 1/1.html, 1/1/1.html etc. In case of "chained" messages the message number is replaced by the icon and there is no indentation.
Inline: Display the subject line only or also the text of the posting(s); for the choice "All" the "Outline" choices are switched off.
|1||0||1||no text / full text of posting|
|2||1||All||text for level 1 only / text for All postings|
Outline: Choose the depth of the posting thread, successive toggle controls provide increasing detail.
|1||2||1||2 levels / 1 level (original posting)|
|2||3||2||3 levels / 2 levels|
|3||3||All||3 levels / all levels (all postings)|
I would like to be able to figure out the maximum extent of a logical volume. Put another way, I would like to know the radius of the smallest sphere that will completely contain any given logical volume.
Has anybody addressed doing something like this already? I know about G4VSolid::CalculateExtent(), but I would like a method that I can apply to any arbitrary logical volume.
If nobody's done anything like this before, here's an approach I was thinking of. Start with a sphere of, say, 1 meter, and place the logical volume at the center of that sphere. If it overlaps, double the radius of the sphere. If it doesn't overlap, halve the radius. I could use a binary search pattern until the radius of the sphere isn't changing by more than a set tolerance.
That said, if anybody's actually already coded up something like this, I'd love to know about it.
Thanks a bunch.
|Inline Depth:||Outline Depth:||Add message:|