DTK_BoxGeometry.cpp

Go to the documentation of this file.

//---------------------------------------------------------------------------//
/*
  Copyright (c) 2012, Stuart R. Slattery
  All rights reserved.

  Redistribution and use in source and binary forms, with or without
  modification, are permitted provided that the following conditions are
  met:

  *: Redistributions of source code must retain the above copyright
  notice, this list of conditions and the following disclaimer.

  *: Redistributions in binary form must reproduce the above copyright
  notice, this list of conditions and the following disclaimer in the
  documentation and/or other materials provided with the distribution.

  *: Neither the name of the University of Wisconsin - Madison nor the
  names of its contributors may be used to endorse or promote products
  derived from this software without specific prior written permission.

  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
//---------------------------------------------------------------------------//
//---------------------------------------------------------------------------//

#include "DTK_BoxGeometry.hpp"
#include "DTK_BoxGeometryImpl.hpp"
#include "DTK_DBC.hpp"

namespace DataTransferKit
{
//---------------------------------------------------------------------------//
BoxGeometry::BoxGeometry()
{
    this->b_entity_impl = Teuchos::rcp( new BoxGeometryImpl() );
}

//---------------------------------------------------------------------------//
BoxGeometry::BoxGeometry( const EntityId global_id, const int owner_rank,
                          const int block_id, const double x_min,
                          const double y_min, const double z_min,
                          const double x_max, const double y_max,
                          const double z_max )
{
    this->b_entity_impl = Teuchos::rcp(
        new BoxGeometryImpl( global_id, owner_rank, block_id, x_min, y_min,
                             z_min, x_max, y_max, z_max ) );
}

//---------------------------------------------------------------------------//
BoxGeometry::BoxGeometry( const EntityId global_id, const int owner_rank,
                          const int block_id,
                          const Teuchos::Tuple<double, 6> &bounds )
{
    this->b_entity_impl = Teuchos::rcp(
        new BoxGeometryImpl( global_id, owner_rank, block_id, bounds ) );
}

//---------------------------------------------------------------------------//
BoxGeometry::~BoxGeometry() { /* ... */}

//---------------------------------------------------------------------------//
bool BoxGeometry::checkForIntersection( const BoxGeometry &box_A,
                                        const BoxGeometry &box_B )
{
    Teuchos::Tuple<double, 6> bounds_A;
    box_A.boundingBox( bounds_A );
    Teuchos::Tuple<double, 6> bounds_B;
    box_B.boundingBox( bounds_B );

    return !( ( bounds_A[0] > bounds_B[3] || bounds_A[3] < bounds_B[0] ) ||
              ( bounds_A[1] > bounds_B[4] || bounds_A[4] < bounds_B[1] ) ||
              ( bounds_A[2] > bounds_B[5] || bounds_A[5] < bounds_B[2] ) );
}

//---------------------------------------------------------------------------//
bool BoxGeometry::intersectBoxes( const BoxGeometry &box_A,
                                  const BoxGeometry &box_B,
                                  BoxGeometry &box_intersection )
{
    // Check for intersection.
    if ( !checkForIntersection( box_A, box_B ) )
    {
        return false;
    }

    Teuchos::Tuple<double, 6> bounds_A;
    box_A.boundingBox( bounds_A );
    Teuchos::Tuple<double, 6> bounds_B;
    box_B.boundingBox( bounds_B );

    double x_min, y_min, z_min, x_max, y_max, z_max;

    // Get overlap in X.
    if ( bounds_A[0] > bounds_B[0] )
    {
        x_min = bounds_A[0];
    }
    else
    {
        x_min = bounds_B[0];
    }
    if ( bounds_A[3] > bounds_B[3] )
    {
        x_max = bounds_B[3];
    }
    else
    {
        x_max = bounds_A[3];
    }

    // Get overlap in Y.
    if ( bounds_A[1] > bounds_B[1] )
    {
        y_min = bounds_A[1];
    }
    else
    {
        y_min = bounds_B[1];
    }
    if ( bounds_A[4] > bounds_B[4] )
    {
        y_max = bounds_B[4];
    }
    else
    {
        y_max = bounds_A[4];
    }

    // Get overlap in Z.
    if ( bounds_A[2] > bounds_B[2] )
    {
        z_min = bounds_A[2];
    }
    else
    {
        z_min = bounds_B[2];
    }
    if ( bounds_A[5] > bounds_B[5] )
    {
        z_max = bounds_B[5];
    }
    else
    {
        z_max = bounds_A[5];
    }

    box_intersection = BoxGeometry( dtk_invalid_entity_id, box_A.ownerRank(), 0,
                                    x_min, y_min, z_min, x_max, y_max, z_max );
    return true;
}

//---------------------------------------------------------------------------//
void BoxGeometry::uniteBoxes( const BoxGeometry &box_A,
                              const BoxGeometry &box_B, BoxGeometry &box_union )
{
    Teuchos::Tuple<double, 6> bounds_A;
    box_A.boundingBox( bounds_A );
    Teuchos::Tuple<double, 6> bounds_B;
    box_B.boundingBox( bounds_B );

    double x_min, y_min, z_min, x_max, y_max, z_max;

    // Get overlap in X.
    if ( bounds_A[0] < bounds_B[0] )
    {
        x_min = bounds_A[0];
    }
    else
    {
        x_min = bounds_B[0];
    }
    if ( bounds_A[3] < bounds_B[3] )
    {
        x_max = bounds_B[3];
    }
    else
    {
        x_max = bounds_A[3];
    }

    // Get overlap in Y.
    if ( bounds_A[1] < bounds_B[1] )
    {
        y_min = bounds_A[1];
    }
    else
    {
        y_min = bounds_B[1];
    }
    if ( bounds_A[4] < bounds_B[4] )
    {
        y_max = bounds_B[4];
    }
    else
    {
        y_max = bounds_A[4];
    }

    // Get overlap in Z.
    if ( bounds_A[2] < bounds_B[2] )
    {
        z_min = bounds_A[2];
    }
    else
    {
        z_min = bounds_B[2];
    }
    if ( bounds_A[5] < bounds_B[5] )
    {
        z_max = bounds_B[5];
    }
    else
    {
        z_max = bounds_A[5];
    }

    box_union = BoxGeometry( dtk_invalid_entity_id, box_A.ownerRank(), 0, x_min,
                             y_min, z_min, x_max, y_max, z_max );
}

//---------------------------------------------------------------------------//
BoxGeometry &BoxGeometry::operator+=( const BoxGeometry &rhs )
{
    *this = *this + rhs;
    return *this;
}

//---------------------------------------------------------------------------//
BoxGeometry operator+( const BoxGeometry &box_1, const BoxGeometry &box_2 )
{
    BoxGeometry union_box;
    BoxGeometry::uniteBoxes( box_1, box_2, union_box );
    return union_box;
}

//---------------------------------------------------------------------------//
std::ostream &operator<<( std::ostream &os,
                          const DataTransferKit::BoxGeometry &b )
{
    Teuchos::Tuple<double, 6> bounds;
    b.boundingBox( bounds );

    os << "BoxGeometry: d_global_id=" << b.id()
       << ",d_owner_rank=" << b.ownerRank() << ",d_x_min=" << bounds[0]
       << ",d_y_min=" << bounds[1] << ",d_z_min=" << bounds[2]
       << ",d_x_max=" << bounds[3] << ",d_y_max=" << bounds[4]
       << ",d_z_max=" << bounds[5];

    return os;
}

//---------------------------------------------------------------------------//
double BoxGeometry::measure() const
{
    return Teuchos::rcp_dynamic_cast<BoxGeometryImpl>( this->b_entity_impl )
        ->measure();
}

//---------------------------------------------------------------------------//
void BoxGeometry::centroid( const Teuchos::ArrayView<double> &centroid ) const
{
    Teuchos::rcp_dynamic_cast<BoxGeometryImpl>( this->b_entity_impl )
        ->centroid( centroid );
}

//---------------------------------------------------------------------------//
bool BoxGeometry::mapToReferenceFrame(
    const Teuchos::ArrayView<const double> &point,
    const Teuchos::ArrayView<double> &reference_point ) const
{
    return Teuchos::rcp_dynamic_cast<BoxGeometryImpl>( this->b_entity_impl )
        ->mapToReferenceFrame( point, reference_point );
}

//---------------------------------------------------------------------------//
bool BoxGeometry::checkPointInclusion(
    const double tolerance,
    const Teuchos::ArrayView<const double> &reference_point ) const
{
    return Teuchos::rcp_dynamic_cast<BoxGeometryImpl>( this->b_entity_impl )
        ->checkPointInclusion( tolerance, reference_point );
}

//---------------------------------------------------------------------------//
void BoxGeometry::mapToPhysicalFrame(
    const Teuchos::ArrayView<const double> &reference_point,
    const Teuchos::ArrayView<double> &point ) const
{
    Teuchos::rcp_dynamic_cast<BoxGeometryImpl>( this->b_entity_impl )
        ->mapToPhysicalFrame( reference_point, point );
}

//---------------------------------------------------------------------------//

} // end namespace DataTransferKit

//---------------------------------------------------------------------------//
// end DTK_BoxGeometry.cpp
//---------------------------------------------------------------------------//