Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F78259607
triangle.hh
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Mon, Aug 19, 11:29
Size
2 KB
Mime Type
text/x-c++
Expires
Wed, Aug 21, 11:29 (2 d)
Engine
blob
Format
Raw Data
Handle
19957649
Attached To
rAKA akantu
triangle.hh
View Options
/**
* @file triangle.hh
*
* @author Lucas Frérot <lucas.frerot@epfl.ch>
*
* @date creation: Thu Feb 19 2015
* @date last modification: Thu Feb 19 2015
*
* @brief Triangle primitive
*
* @section LICENSE
*
* Copyright (©) 2015 EPFL (Ecole Polytechnique Fédérale de Lausanne)
* Laboratory (LSMS - Laboratoire de Simulation en Mécanique des Solides)
*
* Akantu is free software: you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* Akantu 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 Lesser General Public License for more
* details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Akantu. If not, see <http://www.gnu.org/licenses/>.
*
*/
/* -------------------------------------------------------------------------- */
#ifndef __AKANTU_TRIANGLE_HH__
#define __AKANTU_TRIANGLE_HH__
#include "aka_common.hh"
#include "geometrical_primitive.hh"
#include "point.hh"
__BEGIN_AKANTU__
template<UInt d, typename T>
class Triangle : public GeometricalPrimitive {
public:
/// Default constructor
Triangle();
/// Construct triangle from 3 points
Triangle(const Point<d, T> & a, const Point<d, T> & b, const Point<d, T> & c);
public:
/// Check if a point is on the triangle boundary
virtual bool hasOnBoundary(const Point<d, T> & point) const;
/// Check if the point is inside the triangle
virtual bool hasOnBoundedSide(const Point<d, T> & point) const;
/// Check if the point is outside the triangle
virtual bool hasOnUnboundedSide(const Point<d, T> & point) const;
public:
/// Equality operator
virtual bool operator==(const Triangle<d, T> & other) const;
/// Inequality operator
virtual bool operator!=(const Triangle<d, T> & other) const;
};
__END_AKANTU__
#endif // __AKANTU_TRIANGLE_HH__
Event Timeline
Log In to Comment