ComputationalGeometry`
ComputationalGeometry`

DelaunayTriangulationQ

As of Version 10, all the functionality of the ComputationalGeometry package is built into the Wolfram System. »

DelaunayTriangulationQ[{{x1,y1},{x2,y2},…},val]

gives True if the triangulation of the points {{x1,y1},…} represented by the vertex adjacency list val is a Delaunay triangulation and False otherwise.

DelaunayTriangulationQ[{{x1,y1},{x2,y2},…},val,hull]

takes hull to be the convex hull index list.

更多信息和选项

  • To use DelaunayTriangulationQ, you first need to load the Computational Geometry Package using Needs["ComputationalGeometry`"].
  • The convex hull index list hull and the elements of the vertex adjacency list val must both list vertices in counterclockwise order.
Wolfram Research (2012)，DelaunayTriangulationQ，Wolfram 语言函数，https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html.

文本

Wolfram Research (2012)，DelaunayTriangulationQ，Wolfram 语言函数，https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html.

CMS

Wolfram 语言. 2012. "DelaunayTriangulationQ." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html.

APA

Wolfram 语言. (2012). DelaunayTriangulationQ. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html 年

BibTeX

@misc{reference.wolfram_2024_delaunaytriangulationq, author="Wolfram Research", title="{DelaunayTriangulationQ}", year="2012", howpublished="\url{https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html}", note=[Accessed: 22-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_delaunaytriangulationq, organization={Wolfram Research}, title={DelaunayTriangulationQ}, year={2012}, url={https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html}, note=[Accessed: 22-November-2024 ]}