Interval assignment for volumes with holes

International Journal for Numerical Methods in Engineering, John Wiley, Vol 49, Num 1, pp.277-288, September 10-20 2000

MESHING
RESEARCH
CORNER

Special Edition on Unstructured Mesh Generation
International Journal for Numerical Methods in Engineering, Vol 49 Number 1-2, 10-20 September 2000

Correspondence to: Jason Shepherd, Parallel Computing Sciences Department, Sandia National Laboratories, Albuquerque, NM 87185, U.S.A.
E-mail: jfsheph@sandia.gov

Abstract
This paper presents a new technique for automatically detecting interval constraints for swept volumes with loles. The technique finds true volume constraints that are not necessarily imposed by the surfaces of the lolume. A graphing algorithm finds independent, parallel paths of edges from source surfaces to target iurfaces. The number of intervals on two paths between a given source and target surface must be equal; in ~eneral, the collection of paths determine a set of linear constraints. Linear programming techniques solve he interval assignment problem for the surface and volume constraints simultaneously.