Surface algorithms using bounds on derivatives
Computer Aided Geometric Design
Real-time rendering of trimmed surfaces
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis
Computer Aided Geometric Design
Directional adaptive surface triangulation
Computer Aided Geometric Design
A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation
A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation
| Hi-index | 0.00 |
In this paper two curvature adaptive methods of surface triangulation are presented. Both methods are based on edge refinement to obtain a triangulation compatible with the curvature requirements. The first method applies an incremental and constrained Delaunay triangulation and uses curvature bounds to determine if an edge of the triangulation is admissible. The second method uses this function also in the edge refinement process, i.e. in the computation of the location of a refining point, and in the re-triangulation needed after the insertion of this refining point. Results are presented, comparing both approaches.