Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- 31 October 1985
- journal article
- Published by Elsevier in Computer Vision, Graphics, and Image Processing
- Vol. 32 (1) , 127-140
- https://doi.org/10.1016/0734-189x(85)90005-2
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- A triangular finite element mesh generator for fluid dynamic systems of arbitrary geometryInternational Journal for Numerical Methods in Engineering, 1980
- Automatic extraction of Irregular Network digital terrain modelsACM SIGGRAPH Computer Graphics, 1979
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- A piecewise c1 interpolant to arbitrarily spaced dataComputer Graphics and Image Processing, 1978
- Triangulating a simple polygonInformation Processing Letters, 1978
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- On the Angle Condition in the Finite Element MethodSIAM Journal on Numerical Analysis, 1976
- Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1975
- Triangular elements in the finite element methodMathematics of Computation, 1970