We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
For a set P of points in the plane, we introduce a class of triangulations that is an
extension of the Delaunay triangulation. Instead of requiring that for each triangle the
circle through its vertices contains no points of P inside, we require that at most k points
are inside the circle. Since there are many different higher-order Delaunay triangulations
for a point set, other useful criteria for triangulations can be incorporated without sacrificing
the well-shapedness too much. Applications include realistic terrain modelling and
mesh generation
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.