Abstract
The paper presents a new approach for triangulating trimmed surfaces. The basic idea is to perform the triangulation completely in parametric space. The trimmed regions of the surfaces are first mapped into parametric space and approximated by 2D polygonal regions, which are then pretriangulated by a restricted Delaunay triangulation algorithm. The generated triangles are subdivided further until each edge of the triangles is smaller than the allowed length that results from the surface definition and the specified tolerance. All the triangles are finally mapped back into Euclidean space so that the coordinate triples for the triangle vertices can be calculated. This approach makes the triangulation more reliable and faster, and it is also easy to avoid cracks between patches and surfaces. Thus, the algorithm is particularly suitable for the generation of a valid triangulation model for many engineering applications, for example stereolothography.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
