
- An79 Andrew, A.M. "Another efficient algorithm for convex hulls in two dimensions," lnfo. Proc. Letters, 9, pp. 216- 219 (1979).Google Scholar
Cross Ref
- Br88 Brown, M.H. "Exploring algorithms usirlg Balsa-I/," Computer, May 1988, pp 14-36 (1988). Google Scholar
Digital Library
- DP87a DePano, N.A.A. Polygon approximation with optimized polygonal enclosures" applications and algorithms, Ph.D. thesis, Dept. of Computer Science, The Iohns Hopkins University, April 1987.Google Scholar
- DP87b DePano, N.A.A. "Rotating calipers revisited: optimal polygonal enclosures in optimal time," ACM South Central Regional Conf., Lafayette LA, November 1987.Google Scholar
- DP88 DePano, N.A.A. "Algorithmic Paradigms: Examples in Computational Geomtery," Proc. ACM SIGCSE Technical Symposium, Atlanta GA, February 1988, pp. 83 -87. Google Scholar
Digital Library
- LD89 LeSage, M. and N.A.A.DePano, "Minimum enclosing rectangles -- a comparative investigation of two optimizing criteria," Proc. 1EEE Southeastcon '89, Columbia SC, April 1989, pp. 233-237.Google Scholar
- Fr88 Frenkel, K. A. "The art and science of visualizing data," Communications of the ACM, February 1988, pp. 110- 121. Google Scholar
Digital Library
- FS75 Freeman, H. and R. Shapira. "Determining the minimum-area rectangle for an arbitrary closed curve," Communications of the ACM, 18, pp. 409-413 (1975). Google Scholar
Digital Library
- OR87 O'Rourke, J. Art gallery theorems and algorithms. Oxford Univ. Press, New York, 1987. Google Scholar
Digital Library
- Ra70 Raynaud, H. "Sur renveloppe convexe des nuages des points aleatoires dans Rn, I, J. Appl. Prob. 7, pp. 35-48 (1970).Google Scholar
Cross Ref
- PS85 Preparata, F.P and M.I. Shamos. Computational geometry -- an introduction. Springer-Verlag, New York, 1985. Google Scholar
Digital Library
Index Terms
Algorthmic pradigms: examples in computational geometry II
Recommendations
Overlapping finite elements for a new paradigm of solution
A new paradigm of solution is considered.We give the formulation of new overlapping finite elements.The numerical integration of the element matrices is efficient.The new elements are quite distortion insensitive.We illustrate the complete solution ...
Quadrilateral overlapping elements and their use in the AMORE paradigm
Highlights- We give the formulation of new 4-node overlapping quadrilateral finite elements.
AbstractWe give the formulation of new 4-node overlapping quadrilateral finite elements and demonstrate their performance in several numerical examples. The elements are insensitive to mesh distortions and lead overall to accurate numerical ...
The finite element method with overlapping elements A new paradigm for CAD driven simulations
A new paradigm is presented for finite element analysis in CAD environments.The focus is, firstly, on operating directly with clean-up on the CAD geometry.The focus is, secondly, on establishing efficiently a finite element mesh.Overlapping finite ...






Comments