Skip Navigation

The Computer Journal 1978 21(4):324-332; doi:10.1093/comjnl/21.4.324
© 1978 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (23)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lewis, B. A.
Right arrow Articles by Robinson, J. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Triangulation of planar regions with applications

B. A. Lewis * and J. S. Robinson

Department of Mathematics and Statistics, Teesside Polytechnic, Middlesbrough, Cleveland, UK

An algorithm is presented for triangulating efficiently a set of points within any planar region. This technique can deal with multiply-connected regions and is optimal, in the sense that it avoids triangles with small angles wherever possible. Two fields of applications are presented; first, in contouring, where an algorithm for producing contours is outlined, and secondly, in finite element analysis, where the triangulation algorithm makes a significant contribution towards automatic mesh generation.

Received November 1976.

* Now at: Department of Mathematics and Statistics, Teesside Polytechnic, Middlesbrough, Cleveland TS1 3BA

§ British Steel Corporation, Teesside Laboratories, Ladgate Lane, Middlesbrough, Cleveland TS8 9EG


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.