PlanarGraphPlot
PlanarGraphPlot[{{x1,y1},{x2,y2},…}]
plots the Delaunay triangulation of the points {{x1,y1},…}.
PlanarGraphPlot[{{x1,y1},{x2,y2},…},g]
plots the points {{x1,y1},…} as well as the planar graph described by the vertex adjacency list or circuit g.
Details and Options
- PlanarGraphPlot functionality is now available in the built-in Wolfram Language function DelaunayMesh.
- To use PlanarGraphPlot, you first need to load the Computational Geometry Package using Needs["ComputationalGeometry`"].
- The planar graph g may be a vertex adjacency list of the form {{i,{i1,i2,…}},…} or a single circuit of the form {i,j,…}, where i refers to the point {xi,yi}.
- PlanarGraphPlot has the same options as Graphics, with the following addition:
-
LabelPoints True whether points are labeled - Valid settings for LabelPoints are True and False. With the setting LabelPoints->True, each point is labeled according to its position in the input list.
Text
Wolfram Research (2012), PlanarGraphPlot, Wolfram Language function, https://reference.wolfram.com/language/ComputationalGeometry/ref/PlanarGraphPlot.html.
CMS
Wolfram Language. 2012. "PlanarGraphPlot." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ComputationalGeometry/ref/PlanarGraphPlot.html.
APA
Wolfram Language. (2012). PlanarGraphPlot. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ComputationalGeometry/ref/PlanarGraphPlot.html