text: /*==================================================================================
      Copyright (c) 2008, binaryzebra
      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 binaryzebra 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 binaryzebra 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 binaryzebra 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.
  =====================================================================================*/
  
  /*
  Bullet Continuous Collision Detection and Physics Library
  Copyright (c) 2003-2009 Erwin Coumans  http://bulletphysics.org
  
  This software is provided 'as-is', without any express or implied warranty.
  In no event will the authors be held liable for any damages arising from the use of this software.
  Permission is granted to anyone to use this software for any purpose, 
  including commercial applications, and to alter it and redistribute it freely, 
  subject to the following restrictions:
  
  1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
  2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
  3. This notice may not be removed or altered from any source distribution.
  */
  
  #include "btConvex2dShape.h"
  
  btConvex2dShape::btConvex2dShape(btConvexShape* convexChildShape)
      : btConvexShape()
      , m_childConvexShape(convexChildShape)
  {
      m_shapeType = CONVEX_2D_SHAPE_PROXYTYPE;
  }
  
  btConvex2dShape::~btConvex2dShape()
  {
  }
  
  btVector3 btConvex2dShape::localGetSupportingVertexWithoutMargin(const btVector3& vec) const
  {
      return m_childConvexShape->localGetSupportingVertexWithoutMargin(vec);
  }
  
  void btConvex2dShape::batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors, btVector3* supportVerticesOut, int numVectors) const
  {
      m_childConvexShape->batchedUnitVectorGetSupportingVertexWithoutMargin(vectors, supportVerticesOut, numVectors);
  }
  
  btVector3 btConvex2dShape::localGetSupportingVertex(const btVector3& vec) const
  {
      return m_childConvexShape->localGetSupportingVertex(vec);
  }
  
  void btConvex2dShape::calculateLocalInertia(btScalar mass, btVector3& inertia) const
  {
      ///this linear upscaling is not realistic, but we don't deal with large mass ratios...
      m_childConvexShape->calculateLocalInertia(mass, inertia);
  }
  
  ///getAabb's default implementation is brute force, expected derived classes to implement a fast dedicated version
  void btConvex2dShape::getAabb(const btTransform& t, btVector3& aabbMin, btVector3& aabbMax) const
  {
      m_childConvexShape->getAabb(t, aabbMin, aabbMax);
  }
  
  void btConvex2dShape::getAabbSlow(const btTransform& t, btVector3& aabbMin, btVector3& aabbMax) const
  {
      m_childConvexShape->getAabbSlow(t, aabbMin, aabbMax);
  }
  
  void btConvex2dShape::setLocalScaling(const btVector3& scaling)
  {
      m_childConvexShape->setLocalScaling(scaling);
  }
  
  const btVector3& btConvex2dShape::getLocalScaling() const
  {
      return m_childConvexShape->getLocalScaling();
  }
  
  void btConvex2dShape::setMargin(btScalar margin)
  {
      m_childConvexShape->setMargin(margin);
  }
  btScalar btConvex2dShape::getMargin() const
  {
      return m_childConvexShape->getMargin();
  }
  
  int btConvex2dShape::getNumPreferredPenetrationDirections() const
  {
      return m_childConvexShape->getNumPreferredPenetrationDirections();
  }
  
  void btConvex2dShape::getPreferredPenetrationDirection(int index, btVector3& penetrationVector) const
  {
      m_childConvexShape->getPreferredPenetrationDirection(index, penetrationVector);
  }
  