Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Theoretical Computer Science,Software
Reference12 articles.
1. C. L. Lawson, C1-compatible Interpolation Over a Triangle,Jet Propulsion Lab., Technical Memo. pp. 33?770 (May 1976).
2. J. C. Cavendish, Automatic Triangulation of Arbitrary Planar Domains for the Finite Element Method,Intl. J. Numer. Methods Eng.,8:679?696 (1974).
3. T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility Polygon Search and Euclidean Shortest Paths,Proc. of 26th Annual Symp. on Found. of Computer Sci., Portland, pp. 155?164 (October 1985).
4. M. I. Shamos, Computational Geometry, Ph.D. Dissertation, Yale University (May 1978).
5. H. ElGindy, An Optimal Parallel Algorithm for Triangulating Simplicial Points Sets in Space,Internal Report, University of Pennsylvania (April 1986).
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献