---

gugr_triangulate.h

Go to the documentation of this file.

/* LIBGUL - Geometry Utility Library
 * Copyright (C) 1998-1999 Norbert Irmer
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */

#ifndef GUGR_TRIANGULATE_H
#define GUGR_TRIANGULATE_H

namespace gugr {

/* ------------------------------------------------------------------------
  Triangulates the regions of a graph. E must be regularized, and V
  sorted. For this purpose the graph is divided into monotone chains.
  Between two monontone chains lies a monotone polygone.
  Only those triangles are calculated, whose edges have a positive face
  index on the inward side 
------------------------------------------------------------------------- */
void Triangulate( graph_edge_list *E, graph_vertex_list *V,
                  const rational& far_left, triangle_list *T );
                     
/* ------------------------------------------------------------------------
  Triangulates a monotone polygon

  The vertices in V1 and V2, and the edges in E are deleted
  in this function! 
-------------------------------------------------------------------------- */
void TriangulateMonotonePolygon(
              graph_vertex_list2 *V1, graph_vertex_list2 *V2,
              graph_edge_list *E, triangle_list *T );

}

#endif

---