From: wolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Thu, 20 Sep 2001 09:31:16 +0000 (+0000)
Subject: The Triangulation class now provides the infrastructure to resolve
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=1c83df44e22c4cb0243c14aff8c836882a19b8de;p=dealii-svn.git

The Triangulation class now provides the infrastructure to resolve
this TODO: use the vertex list the triangulation exports, rather than
building one on our own.


git-svn-id: https://svn.dealii.org/trunk@5028 0785d39b-7218-0410-832d-ea1e28bc413d
---

diff --git a/deal.II/deal.II/source/grid/grid_out.cc b/deal.II/deal.II/source/grid/grid_out.cc
index 58424c7641..dabc4c5f16 100644
--- a/deal.II/deal.II/source/grid/grid_out.cc
+++ b/deal.II/deal.II/source/grid/grid_out.cc
@@ -31,25 +31,18 @@ template <int dim>
 void GridOut::write_ucd (const Triangulation<dim> &tria,
 			 std::ostream             &out) 
 {
-//TODO:[WB] In GridOut::write_ucd, a vector of vertices is built along with
-//    another vector stating which of these are used. These are actually
-//    the same arrays as exist already in the triangulation, but I did not
-//    want to write just another access function. However, someone should
-//    take a look whether re-building these arrays is a large waste of
-//    computing time and memory, or whether it is justifiable.
-  
   AssertThrow (out, ExcIO());
 
-  typename Triangulation<dim>::active_cell_iterator        cell=tria.begin_active();
-  const typename Triangulation<dim>::active_cell_iterator  endc=tria.end();
+				   // get the positions of the
+				   // vertices and whether they are
+				   // used.
+  const std::vector<Point<dim> > &vertices    = tria.get_vertices();
+  const std::vector<bool>        &vertex_used = tria.get_used_vertices();
+  
+  const unsigned int n_vertices = tria.n_used_vertices();
 
-				   // first loop over all cells to
-				   // find out the vertices which
-				   // are in use. copy them for fast
-				   // output
-  std::vector<Point<dim> > vertices (tria.n_vertices());
-  std::vector<bool> vertex_used (tria.n_vertices(), false);
-  unsigned int        n_vertices = 0;
+  typename Triangulation<dim>::active_cell_iterator       cell=tria.begin_active();
+  const typename Triangulation<dim>::active_cell_iterator endc=tria.end();
 
   for (cell=tria.begin_active(); cell!=endc; ++cell)
     for (unsigned int vertex=0; vertex<GeometryInfo<dim>::vertices_per_cell;