Algorithm and data structure for triangulating multiply connected polygonal domains
- 31 October 1993
- journal article
- Published by Elsevier in Computers & Graphics
- Vol. 17 (5), 563-574
- https://doi.org/10.1016/0097-8493(93)90007-v
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Triangulation of trimmed surfaces in parametric spaceComputer-Aided Design, 1992
- Three dimensional apparel CAD systemACM SIGGRAPH Computer Graphics, 1992
- Smooth surface reconstruction from scattered data pointsComputers & Graphics, 1991
- Real-time rendering of trimmed surfacesACM SIGGRAPH Computer Graphics, 1989
- Approaches to the Automatic Generation and Control of Finite Element MeshesApplied Mechanics Reviews, 1988
- Finite element mesh generation methods: a review and classificationComputer-Aided Design, 1988
- Generalized delaunay triangulation for planar graphsDiscrete & Computational Geometry, 1986
- A new mesh generation scheme for arbitrary planar domainsInternational Journal for Numerical Methods in Engineering, 1985
- Triangulation of planar regions with applicationsThe Computer Journal, 1978
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974