MathGroup Archive 1997

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Intersecting volumes

  • To: mathgroup at smc.vnet.net
  • Subject: [mg9802] Re: Intersecting volumes
  • From: Daniel Lichtblau <danl>
  • Date: Fri, 28 Nov 1997 05:35:15 -0500
  • Organization: Wolfram Research, Inc.
  • Sender: owner-wri-mathgroup at wolfram.com

Gerry Flanagan wrote:
> 
> Can someone point me to a reference for an algorithm that determines if
> two volumes (say defined by a list of polygons) intersect. I only need
> to know the magnitude of the volume that intersects, not the actual
> boundaries. People that do CAD must have some clever methods for this.
> Thanks,
> Gerry F


I do not have a clever method. If no such is forthcoming, a pedestrian
approach might be to write primitives to determine if a given point
lies in each volume. Then break the region containing the possible
intersection into small cubes and "integrate" over it by summing the
cube size times number of cubes whose center lies in both volumes.


Daniel Lichtblau
Wolfram Research


  • Prev by Date: RE: Re[2]: StoppingTest does not work ?
  • Next by Date: Re: Book recommendation for
  • Previous by thread: Intersecting volumes
  • Next by thread: Matrix Inversion Method ?