Premium
Interval assignment for volumes with holes
Author(s) -
Shepherd Jason,
Benzley Steven,
Mitchell Scott
Publication year - 2000
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/1097-0207(20000910/20)49:1/2<277::aid-nme933>3.0.co;2-v
Subject(s) - national laboratory , library science , operations research , government (linguistics) , citation , computer science , engineering physics , engineering , philosophy , linguistics
This paper presents a new technique for automatically detecting interval constraints for swept volumes with holes. The technique finds true volume constraints that are not necessarily imposed by the surfaces of the volume. A graphing algorithm finds independent, parallel paths of edges from source surfaces to target surfaces. The number of intervals on two paths between a given source and target surface must be equal; in general, the collection of paths determine a set of linear constraints. Linear programming techniques solve the interval assignment problem for the surface and volume constraints simultaneously. Published in 2000 by John Wiley & Sons, Ltd.