*/ 00073 /* */ 00074 /* Triangle's Delaunay refinement algorithm for quality mesh generation is */ 00075 /* a hybrid of one due to Jim Ruppert, "A Delaunay Refinement Algorithm */ 00076 /* for Quality 2-Dimensional Mesh Generation," Journal of Algorithms */ 00077 /* 18(3):548-585, May 1995, and one due to L. Shewchuk, and Jifeng Xu, */ 00070 /* "Large-scale Simulation of Elastic Wave Propagation in Heterogeneous */ 00071 /* Media on Parallel Computers," Computer Methods in Applied Mechanics */ 00072 /* and Engineering 152(1-2):85-102, 22 January 1998. For further */ 00068 /* information, see Hesheng Bao, Jacobo Bielak, Omar Ghattas, Loukas F. */ 00065 /* */ 00066 /* Triangle was created as part of the Quake Project in the School of */ 00067 /* Computer Science at Carnegie Mellon University. thesis, Technical Report */ 00063 /* CMU-CS-97-137, School of Computer Science, Carnegie Mellon University, */ 00064 /* Pittsburgh, Pennsylvania. */ 00060 /* */ 00061 /* More detail about the data structures may be found in my dissertation: */ 00062 /* "Delaunay Refinement Mesh Generation," Ph.D. */ 00056 /* */ 00057 /* The algorithms are discussed in the greatest detail in "Delaunay */ 00058 /* Refinement Algorithms for Triangular Mesh Generation," Computational */ 00059 /* Geometry: Theory and Applications 22(1-3):21-74, May 2002. Lin and Dinesh */ 00053 /* Manocha, editors, Lecture Notes in Computer Science volume 1148, */ 00054 /* pages 203-222, Springer-Verlag, Berlin, May 1996 (from the First ACM */ 00055 /* Workshop on Applied Computational Geometry). A short */ 00050 /* overview appears in "Triangle: Engineering a 2D Quality Mesh */ 00051 /* Generator and Delaunay Triangulator," in Applied Computational */ 00052 /* Geometry: Towards Geometric Engineering, Ming C. */ 00045 /* These references are available for downloading from the Web page */ 00046 /* */ 00047 /* */ 00048 /* */ 00049 /* Three papers discussing aspects of Triangle are available. */ 00043 /* */ 00044 /* Some of the references listed below are marked with an asterisk. (If you are not directly supplying this code to a */ 00034 /* customer, and you are instead telling them how they can obtain it for */ 00035 /* free, then you are not required to make any arrangement with me.) */ 00036 /* */ 00037 /* Hypertext instructions for Triangle are available on the Web at */ 00038 /* */ 00039 /* */ 00040 /* */ 00041 /* Disclaimer: Neither I nor Carnegie Mellon warrant this code in any way */ 00042 /* whatsoever. Distribution of this code as */ 00032 /* part of a commercial system is permissible ONLY BY DIRECT ARRANGEMENT */ 00033 /* WITH THE AUTHOR. You may distribute modified versions of this code UNDER */ 00028 /* THE CONDITION THAT THIS CODE AND ANY MODIFICATIONS MADE TO IT IN THE */ 00029 /* SAME FILE REMAIN UNDER COPYRIGHT OF THE ORIGINAL AUTHOR, BOTH SOURCE */ 00030 /* AND OBJECT CODE ARE MADE FREELY AVAILABLE WITHOUT CHARGE, AND CLEAR */ 00031 /* NOTICE IS GIVEN OF THE MODIFICATIONS. Private, research, and institutional */ 00027 /* use is free.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |