An efficient algorithm for cutting multiply connected regions

IEEE Transactions on Magnetics

Volumn 40, Issue 2 II, 2004, Pages 707-709

  Simkin, John ^a   Taylor, Simon C ^a   Xu, Edward X ^a  

^a Vector Fields Ltd   (United Kingdom)

Author keywords

Automatic cuts; Multiply connected; Scalar potential; Simply connected; Unite element

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; FINITE ELEMENT METHOD; GEOMETRY; MATHEMATICAL MODELS; SET THEORY; VECTORS;

AUTOMATIC CUTS; DISCRETIZATIONS; SCALAR POTENTIAL; VOLUME INTEGRATION;

ELECTROMAGNETIC FIELDS;

EID: 2342634624     PISSN: 00189464     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMAG.2004.825037     Document Type: Article

References (5)

1. C. S. Harrold and J. Simkin, ''Cutting multiply connected domains," IEEE Trans. Magn., vol. 21, pp. 2495-2498, Nov. 1985.
2. Z. Ren, "T-ω formulation for eddy current problems in multiply connected regions," IEEE Trans. Magn., vol. 38, pp. 557-560, Mar. 2002.
3. S. Suuriniemi and L. Keltunen, "Trade-off between information and computability: A technique for automated topological computations," COMPEL, vol. 22, no. 3, pp. 481-494, 2003.
4. T. Frankel, The Geometry of Physics, revised ed. Cambridge, U.K.: Cambridge Univ. Press, 1997, ch. 13, pp. 333-360.
5. L. Kettunen, private communication.