intersectiondetector.cpp

利用C

// Copyright (C) 2006 Anders Logg.
// Licensed under the GNU LGPL Version 2.1.
//
// Modified by Johan Jansson 2006.
// Modified by Ola Skavhaug 2006.
// Modified by Dag Lindbo 2008.
//
// First added:  2006-06-21
// Last changed: 2008-02-18

#include <algorithm>
#include <dolfin/log/dolfin_log.h>
#include <dolfin/common/Array.h>
#include "Mesh.h"
#include "Facet.h"
#include "Vertex.h"
#include "Cell.h"
#include "GTSInterface.h"
#include "IntersectionDetector.h"

using namespace dolfin;

//-----------------------------------------------------------------------------
IntersectionDetector::IntersectionDetector(Mesh& mesh) : gts(mesh) {}
//-----------------------------------------------------------------------------
IntersectionDetector::~IntersectionDetector() {}
//-----------------------------------------------------------------------------
void IntersectionDetector::overlap(Cell& c, Array<uint>& cells)
{
  cells.clear();
  gts.overlap(c, cells);
}
//-----------------------------------------------------------------------------
void IntersectionDetector::overlap(Point& p, Array<uint>& cells)
{
  cells.clear();
  gts.overlap(p, cells);
}
//-----------------------------------------------------------------------------
void IntersectionDetector::overlap(Point& p1, Point& p2, Array<uint>& cells)
{
  cells.clear();
  gts.overlap(p1, p2, cells);
}
//-----------------------------------------------------------------------------
void IntersectionDetector::overlap(Array<Point>& points, 
				   Array<uint>& cells) 
{
  // Intersect each segment with mesh
  Array<uint> cc;
  for (uint i = 0; i < points.size() - 1; i++)
    gts.overlap(points[i],points[i+1],cc);

  // sort cells
  std::sort(cc.begin(),cc.end());

  // remove repeated cells
  cells.clear();
  //uint k = 0;
  cells.push_back(cc[0]);
  uint k = cc[0];
  for (uint i = 1; i < cc.size(); i++)
  {
    if (cc[i] > k)
    {
      cells.push_back(cc[i]);
      k = cc[i];
    }
  }
}
//-----------------------------------------------------------------------------