Matches in DBpedia 2015-10 for { ?s ?p "A triangulation of a set of points P in the plane is a triangulation of the convex hull of P, with all points from P being among the vertices of the triangulation. It can alternatively be defined as a subdivision of the plane determined by a maximal set of non-crossing edges whose vertex set is P. Triangulations are special cases of planar straight-line graphs.There are special triangulations like the Delaunay triangulation which is the geometric dual of the Voronoi diagram. Subsets of the Delaunay triangulation are the Gabriel graph, nearest neighbor graph and the minimal spanning tree.Triangulations have a number of applications, and there is an interest to find a "good" triangulation for a given point set under some criteria. One of them is a minimum-weight triangulation. Sometimes it is desirable to have a triangulation with special properties, e.g., in which all triangles have large angles (long and narrow ("splinter") triangles are avoided).Given a set of edges that connect some pairs of the points, the problem to determine whether they contain a triangulation is NP-complete ."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Point_set_triangulation abstract "A triangulation of a set of points P in the plane is a triangulation of the convex hull of P, with all points from P being among the vertices of the triangulation. It can alternatively be defined as a subdivision of the plane determined by a maximal set of non-crossing edges whose vertex set is P. Triangulations are special cases of planar straight-line graphs.There are special triangulations like the Delaunay triangulation which is the geometric dual of the Voronoi diagram. Subsets of the Delaunay triangulation are the Gabriel graph, nearest neighbor graph and the minimal spanning tree.Triangulations have a number of applications, and there is an interest to find a "good" triangulation for a given point set under some criteria. One of them is a minimum-weight triangulation. Sometimes it is desirable to have a triangulation with special properties, e.g., in which all triangles have large angles (long and narrow ("splinter") triangles are avoided).Given a set of edges that connect some pairs of the points, the problem to determine whether they contain a triangulation is NP-complete .".