๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A triangulation algorithm for arbitrary planar domains

โœ Scribed by J.M. Nelson


Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
514 KB
Volume
2
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Simulations of dynamically triangulated
โœ S. Catterall ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 473 KB

Recent models for discrete Euclidean quantum gravity incorporate a sum over simplicial triangulations. We describe an algorithm for simulating such models in arbitrary dimension. As illustration we show results from simulations in four dimensions.

A Better Triangulation for Wright's 2n-R
โœ Chuangyin Dang; Dolf Talman ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 216 KB

We give a triangulation for Wright's 2 n -ray algorithm to compute solutions of nonlinear equations. According to measures of efficiency of triangulations, it is better than any other available triangulation for the 2 n -ray algorithm.