next up previous contents index
Next: Graphics Up: Basic Data Types for Previous: 3D Convex Hull Algorithms   Contents   Index


3D Triangulation and Voronoi Diagram Algorithms ( d3_delaunay )

void D3_TRIANG(const list<d3_rat_point>& L, GRAPH<d3_rat_point,int>& G)
    computes a triangulation G of the points in L.

void D3_DELAUNAY(const list<d3_rat_point>& L, GRAPH<d3_rat_point,int>& G)
    computes a delaunay triangulation G of the points in L.

void D3_VORONOI(const list<d3_rat_point>& L0, GRAPH<d3_rat_sphere,int>& G)
    computes the voronoi diagramm G of the points in L.