Add to ORKGA new criterion is given for constructing an optimal triangulation of surfaces and bodies. The triangulation, called the {\em tight} triangulation, is convexity preserving and accepts long, thin triangles whenever they are useful. Both properties are not shared by the maxmin triangulation, which in the plane is called the Delaunay triangulation
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A new criterion is given for constructing an optimal triangulation of surfaces and bodies. The trian...
Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangula...
Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangula...
Given a set of points in the Euclidean plane, we are interested in its triangulations, i.e., the max...
Given a set of points in the Euclidean plane, we are interested in its triangulations, i.e., the max...
AbstractWhen reconstructing a surface from irregularly spaced data we need to decide how to identify...
Let Σ be a strictly convex (hyper-)surface, Sm an optimal triangulation (piecewise linear in ambient...
Let Σ be a strictly convex (hyper-)surface, Sm an optimal triangulation (piecewise linear in ambient...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
Let Σ be a strictly convex (hyper-)surface, Sm an optimal triangulation (piecewise linear in ambient...
AbstractThis paper discusses optimization of quality measures over first order Delaunay triangulatio...
We introduce the restricted constrained Delaunay triangulation (restricted CDT), a generalization of...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A new criterion is given for constructing an optimal triangulation of surfaces and bodies. The trian...
Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangula...
Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangula...
Given a set of points in the Euclidean plane, we are interested in its triangulations, i.e., the max...
Given a set of points in the Euclidean plane, we are interested in its triangulations, i.e., the max...
AbstractWhen reconstructing a surface from irregularly spaced data we need to decide how to identify...
Let Σ be a strictly convex (hyper-)surface, Sm an optimal triangulation (piecewise linear in ambient...
Let Σ be a strictly convex (hyper-)surface, Sm an optimal triangulation (piecewise linear in ambient...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point...
Let Σ be a strictly convex (hyper-)surface, Sm an optimal triangulation (piecewise linear in ambient...
AbstractThis paper discusses optimization of quality measures over first order Delaunay triangulatio...
We introduce the restricted constrained Delaunay triangulation (restricted CDT), a generalization of...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...
A rapidly growing number of applications requires to deal with three-dimensional objects on a comput...