Technical sectionAlgorithm and data structure for triangulating multiply connected polygonal domains
References (25)
- et al.
Triangulation of trimmed surfaces in parametric space
Computer-Aided Des.
(1992) - et al.
Delaunay based representation of surfaces defined over arbitrary shaped domains
Shape reconstruction from planar cross sections
- et al.
Smooth surface reconstruction from scattered data points
Comp. Graph.
(1991) A triangulation algorithm for arbitrary planar domains
Appl. Math. Mod.
(1978)- et al.
Delaunay triangulation of arbitrary shaped planar domains
Computer-Aided Geometric Des.
(1991) - et al.
Real-time rendering of trimmed surfaces
Comp. Graph.
(1989) - et al.
Three dimensional apparel CAD system
Comp. Graph.
(1992) Approaches to the automatic finite element generation and control of finite element meshes
Appl. Mech. Rev.
(1988)- K. Ho-Le, Finite element mesh generation methods: a review and classification. Computer-Aided Des.20,...
Fast planar mesh generation using the Delaunay triangulation
General Motors Res. Publ. GMR-4555
(1983)
Computational Geometry—An Introduction
(1985)
Cited by (18)
Incremental tessellation of trimmed parametric surfaces
2000, CAD Computer Aided DesignGeometry-based triangulation of trimmed NURBS surfaces
1998, CAD Computer Aided DesignProcedural method for terrain surface interpolation
1996, Computers and Graphics (Pergamon)Tessellating trimmed nurbs surfaces
1995, Computer-Aided DesignAn edge-prior DEM construction algorithm for open-pit coal mine
2015, Meitan Xuebao/Journal of the China Coal SocietyA NURBS-based triangulation method for 3D ship hull simulation
2013, International Journal of Online Engineering
- †
On leave from Renault Direction de la Recherche, France.
Copyright © 1993 Published by Elsevier Ltd.