A data modeling abstraction for describing triangular mesh algorithms
- 44 Downloads
-conventional structured pseudocode,
-the mesh conceived as a globally accessible database,
-variables typed using the data model, and
-commands based on a database query and modification syntax.
It is argued that the resulting paradigm supports descriptions that are precise, complete, and relatively representation independent. It thus supports the role of algorithms in providing templates for coding, while also supporting the role of algorithms as vehicles for the communication and documentation of ideas.
A simple data model for planar triangular meshes is defined. Using it, the technique is demonstrated by a suite of familiar algorithms for constructing the Delaunay triangulation, using the divide-and-conquer and incremental approaches. Data dependencies in the model of triangular meshes are noted, and their implications for relating the model to several standard mesh representations is discussed.
AMS subject classificationG.4 I.3.5
Key wordsTriangulation algorithms Delaunay triangulation relational model divide-and-conquer finite element mesh
- 3.R. E. Bank, A. H. Sherman, and A. Weiser,Refinement algorithms and data structures for regular local mesh refinement, in Scientific Computing; IMACS Conference, R. S. Stepleman ed., North Holland, 1983, pp. 3–18.Google Scholar
- 4.E. Bruzzone and L. De Floriani,An efficient data structure for three-dimensional triangulations, in Proceedings of CG International 90, T. S. Chua and T. L. Kunii, eds., Springer-Verlag, June 1990, pp. 425–441.Google Scholar
- 10.D. P. Dobkin and M. J. Laszlo,Primitives for the manipulation of three-dimensional subdivisions, in Proceedings of Third Annual Symposium on Computational Geometry, ACM Press, 1987, pp. 246–259.Google Scholar
- 12.S. Fortune,Numerical stability of algorithms for 2d Delaunay triangulations, Proceedings of Eighth Annual Symposium on Computational Geometry, ACM Press, 1992, pp. 208–217.Google Scholar
- 16.C. M. Hoffmann,Geometric and Solid Modeling: An Introduction, Morgan Kaufmann, San Mateo, CA, 1989.Google Scholar
- 21.C. L. Lawson,Software for c1 surface interpolation, in Mathematical Software III, J. R. Rice, ed., Academic Press, 1977.Google Scholar
- 24.J. O'Rourke,Computational Geometry in C, Cambridge University Press, 1994.Google Scholar
- 26.F. P. Preparata and M. I. Shamos,Computational Geometry: an Introduction, Springer-Verlag, New York, 1985.Google Scholar
- 28.R. B. Simpson,A database abstraction for unstructured triangular mesh algorithms, CERFACS, Tech. Report TR/PA/92/66, January 1992, Toulouse, France.Google Scholar
- 29.D. C. Tsichritzis and F. H. Lochovsky,Data Models, Prentice-Hall, Englewood Cliffes, NJ, 1982.Google Scholar
- 30.G. E. Weddell,Rdm reference manual, Tech. Report CS-89-41, Computer Science Department, University of Waterloo, Canada, 1989.Google Scholar
- 33.T. C. Woo and J. D. Wolter,A constant expected time, linear storage data structure for representing three-dimensional objects, IEEE Transactions on Systems, Man and Cybernetics, SMC-14(3 (1984), pp. 510–515.Google Scholar