csg.hh

/*===========================================================================*\
 *                                                                           *
 *                                IsoEx                                      *
 *        Copyright (C) 2002 by Computer Graphics Group, RWTH Aachen         *
 *                         www.rwth-graphics.de                              *
 *                                                                           *
 *---------------------------------------------------------------------------* 
 *                                                                           *
 *                                License                                    *
 *                                                                           *
 *  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, version 2.                              *
 *                                                                           *
 *  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., 675 Mass Ave, Cambridge, MA 02139, USA.                *
 *                                                                           *
\*===========================================================================*/

//=============================================================================
//
//  CLASS CSGUnion, CSGIntersection, CSGDifference
//
//=============================================================================


#ifndef ISOEX_CSG_HH
#define ISOEX_CSG_HH


//== INCLUDES =================================================================

#include "Implicit.hh"

//== NAMESPACES ===============================================================

namespace IsoEx {
namespace CSG {

//== CLASS DEFINITION =========================================================


template< class Vec3>
class Union : public Implicit<Vec3>
{
public:

  typedef typename Vec3::value_type real;
   
  Union(const Implicit<Vec3>& _implicit1, const Implicit<Vec3>& _implicit2)
    : implicit1_(_implicit1), implicit2_(_implicit2)
  {}




  bool   is_inside(const Vec3& _p) const {
    return implicit1_.is_inside(_p) || implicit2_.is_inside(_p);
  }

  real  scalar_distance(const Vec3& _p) const {
    return std::min(implicit1_.scalar_distance(_p), 
                    implicit2_.scalar_distance(_p));
  }

  bool   directed_distance(const Vec3&  _p0,
                           const Vec3&  _p1,
                           Vec3&        _point,
                           Vec3&        _normal,
                           real&                  _distance) const
  {
    bool             ok1, ok2;
    Vec3  p1, n1, p2, n2;
    real            d1, d2;

    ok1 = implicit1_.directed_distance(_p0, _p1, p1, n1, d1);
    ok2 = implicit2_.directed_distance(_p0, _p1, p2, n2, d2);

    if (ok1 && ok2) { if (d1 < d2) ok2 = false; else ok1 = false; }
    
    if      (ok1)  { _point = p1; _normal = n1; _distance = d1; return true; }
    else if (ok2)  { _point = p2; _normal = n2; _distance = d2; return true; }
    
    return false;
  }


private:

  const Implicit<Vec3>& implicit1_;
  const Implicit<Vec3>& implicit2_;
};



//=============================================================================



template< class Vec3>
class Intersection : public Implicit<Vec3>
{
public:
   
  typedef typename Vec3::value_type real;

  Intersection(const Implicit<Vec3>& _implicit1, const Implicit<Vec3>& _implicit2)
    : implicit1_(_implicit1), implicit2_(_implicit2)
  {}




  bool   is_inside(const Vec3& _p) const {
    return (implicit1_.is_inside(_p) && implicit2_.is_inside(_p));
  }

  real  scalar_distance(const Vec3& _p) const {
    return std::max(implicit1_.scalar_distance(_p), 
                    implicit2_.scalar_distance(_p));
  }

  bool   directed_distance(const Vec3&  _p0,
                           const Vec3&  _p1,
                           Vec3&        _point,
                           Vec3&        _normal,
                           real&                  _distance) const
  {
    bool             ok1, ok2;
    Vec3  p1, n1, p2, n2;
    real            d1, d2;

    ok1 = implicit1_.directed_distance(_p0, _p1, p1, n1, d1);
    ok2 = implicit2_.directed_distance(_p0, _p1, p2, n2, d2);

    if (ok1 && ok2) { if (d1 > d2) ok2 = false; else ok1 = false; }
    
    if      (ok1)  { _point = p1; _normal = n1; _distance = d1; return true; }
    else if (ok2)  { _point = p2; _normal = n2; _distance = d2; return true; }
    
    return false;
  }
  


private:

  const Implicit<Vec3>& implicit1_;
  const Implicit<Vec3>& implicit2_;
};



//=============================================================================



template< class Vec3>
class Difference : public Implicit<Vec3>
{
public:
   
  typedef typename Vec3::value_type real;

  Difference(const Implicit<Vec3>& _implicit1, const Implicit<Vec3>& _implicit2)
    : implicit1_(_implicit1), implicit2_(_implicit2)
  {}




  bool   is_inside(const Vec3& _p) const {
    return implicit1_.is_inside(_p) && !implicit2_.is_inside(_p);
  }

  real  scalar_distance(const Vec3& _p) const {
    return std::max(implicit1_.scalar_distance(_p), 
                    -implicit2_.scalar_distance(_p));
  }

  bool   directed_distance(const Vec3&  _p0,
                           const Vec3&  _p1,
                           Vec3&        _point,
                           Vec3&        _normal,
                           real&                  _distance) const
  {
    bool             ok1, ok2;
    Vec3  p1, n1, p2, n2;
    real            d1, d2;

    ok1 = implicit1_.directed_distance(_p0, _p1, p1, n1, d1);
    ok2 = implicit2_.directed_distance(_p0, _p1, p2, n2, d2);
    d2 = -d2;

    if (ok1 && ok2) { if (d1 > d2) ok2 = false; else ok1 = false; }
    
    if      (ok1)  { _point = p1; _normal = n1; _distance = d1; return true; }
    else if (ok2)  { _point = p2; _normal = n2; _distance = d2; return true; }
    
    return false;
  }
  

private:

  const Implicit<Vec3>& implicit1_;
  const Implicit<Vec3>& implicit2_;
};



//=============================================================================
} // namespace CSG
} // namespace IsoEx
//=============================================================================
#endif // ISOEX_CSG_HH defined
//=============================================================================