Hull (Computational Geometry Package Symbol)

Hull is an option to DelaunayTriangulation that specifies whether the convex hull hull is to be returned in addition to the vertex adjacency list val describing the ...

LabelPoints (Computational Geometry Package Symbol)

LabelPoints is an option to DiagramPlot and PlanarGraphPlot that specifies whether to label points according to their position in the input list.

PlanarGraphPlot (Computational Geometry Package Symbol)

PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots the Delaunay triangulation of the points {{x_1, y_1}, ...}.PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}, g] plots the ...

Ray (Computational Geometry Package Symbol)

Ray[{x_1, y_1}, {x_2, y_2}] is an object representing the infinite ray beginning at {x_1, y_1}in the direction of the point {x_2, y_2}.

TileAreas (Computational Geometry Package Symbol)

TileAreas[{{x_1, y_1}, {x_2, y_2}, ...}, {q_1, q_2, ...}, val] finds the areas of the tiles centered on {x_i, y_i} and having vertices q_j as stipulated by the vertex ...

TriangularSurfacePlot (Computational Geometry Package Symbol)

TriangularSurfacePlot[{{x_1, y_1, z_1}, {x_2, y_2, z_2}, ...}] plots the surface according to the Delaunay triangulation established by projecting the points onto the x-y ...

TrimPoints (Computational Geometry Package Symbol)

TrimPoints is an option to DiagramPlot that specifies which diagram outlier vertex lies on the PlotRange limit.

VoronoiDiagram (Computational Geometry Package Symbol)

VoronoiDiagram[{{x_1, y_1}, {x_2, y_2}, ...}] yields the planar Voronoi diagram of the points {x_1, y_1}, {x_2, y_2}, ....VoronoiDiagram[{{x_1, y_1}, {x_2, y_2}, ...}, val] ...

Computational Geometry Package (Computational Geometry Package Tutorial)

Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...

Computer Arithmetic Package (Computer Arithmetic Package Guide)