Typical methods for the triangulation of parametric surfaces use a sampling of the parameter space, and the wrong choice of parameterization can spoil a triangulation or even cause the algorithm to fail. We present a new method that uses a local tessellation primitive for almost-uniformly sampling and triangulating a surface, so that its parameterization becomes irrelevant. If sampling density or triangle shape has to be adaptive, the uniform mesh can be used either as an initial coarse mesh for a refinement process, or as a fine mesh to be reduced
Low-discrepancy point distributions exhibit excellent uniformity properties for sampling in applicat...
AbstractMany algorithms for reducing the number of triangles in a surface model have been proposed, ...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
A quadtree algorithm is developed to triangulate deformed, intersecting parametric surfaces. The big...
Triangulation of parametric surfaces is important for visualization and finite element analysis. The...
Many application areas in CAD/CAM are concerned with triangulation of surfaces, and require an error...
Triangulations of a connected subset F of parametric surfaces S(u,v) (with continuity C2 or higher) ...
. We present a new method for adaptive polygonization of parametric surfaces. The method combines re...
Many remeshing techniques sample the input surface in a meaningful way and then triangulate the samp...
This paper presents an algorithm for sampling and triangulating a smooth surface ∑ ⊂ ℝ<sup>3</sup> w...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
ABSTRACT. Triangulations of a connected subset F of parametric surfaces S(u,v) (with continuity C2 o...
Triangulations are an ubiquitous input for the finite element community. However, most raw triangula...
NURBS surfaces are widely used in computer graphics, due to their great accuracy of design and reduc...
A quadtree algorithm is developed to render deformed, intersecting parametric surfaces with inside-o...
Low-discrepancy point distributions exhibit excellent uniformity properties for sampling in applicat...
AbstractMany algorithms for reducing the number of triangles in a surface model have been proposed, ...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
A quadtree algorithm is developed to triangulate deformed, intersecting parametric surfaces. The big...
Triangulation of parametric surfaces is important for visualization and finite element analysis. The...
Many application areas in CAD/CAM are concerned with triangulation of surfaces, and require an error...
Triangulations of a connected subset F of parametric surfaces S(u,v) (with continuity C2 or higher) ...
. We present a new method for adaptive polygonization of parametric surfaces. The method combines re...
Many remeshing techniques sample the input surface in a meaningful way and then triangulate the samp...
This paper presents an algorithm for sampling and triangulating a smooth surface ∑ ⊂ ℝ<sup>3</sup> w...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
ABSTRACT. Triangulations of a connected subset F of parametric surfaces S(u,v) (with continuity C2 o...
Triangulations are an ubiquitous input for the finite element community. However, most raw triangula...
NURBS surfaces are widely used in computer graphics, due to their great accuracy of design and reduc...
A quadtree algorithm is developed to render deformed, intersecting parametric surfaces with inside-o...
Low-discrepancy point distributions exhibit excellent uniformity properties for sampling in applicat...
AbstractMany algorithms for reducing the number of triangles in a surface model have been proposed, ...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...