Topologically Reliable Approximation of Trimmed Polynomial Surface Patches

DOI10.1006/gmip.1999.0483zbMath0979.68582OpenAlexW2061244121MaRDI QIDQ4262736

Wonjoon Cho, Takashi Maekawa, Nicholas M. Patrikalakis, Jaime Peraire

Publication date: 24 February 2002

Published in: Graphical Models and Image Processing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bfa3e6e6450f0d3fe024c5aa2884247a62b07a56

zbMATH Keywords

Delaunay triangulationtriangular mesh generation algorithm

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Network design and communication in computer systems (68M10)

Related Items (2)

Linear perturbation methods for topologically consistent representations of free-form surface intersections ⋮ Topologically consistent trimmed surface approximations based on triangular patches

This page was built for publication: Topologically Reliable Approximation of Trimmed Polynomial Surface Patches