CTrapezoidalMap Class Reference

Trapezoidal map for finding the triangle containing a query point in a 2D triangulation. More...

#include <CTrapezoidalMap.hpp>

Public Member Functions
	CTrapezoidalMap ()=default
bool	Build (unsigned long num_points, unsigned long num_triangles, const su2double *x, const su2double *y, const unsigned long *connectivity)
	Build the trapezoidal map from a triangulation.
bool	FindTriangle (su2double val_x, su2double val_y, unsigned long &triangle_id, std::array< su2double, 3 > &bary_coords) const
	Find the triangle containing a query point.
double	GetMemoryFootprint () const
	Get the memory footprint of the map in MB.

Detailed Description

Trapezoidal map for finding the triangle containing a query point in a 2D triangulation.

Constructor & Destructor Documentation

CTrapezoidalMap()

CTrapezoidalMap::CTrapezoidalMap ( )

default

Member Function Documentation

Build()

bool CTrapezoidalMap::Build ( unsigned long  num_points, unsigned long  num_triangles, const su2double *  x, const su2double *  y, const unsigned long *  connectivity  )

inline

Build the trapezoidal map from a triangulation.

Returns

True on success.

FindTriangle()

bool CTrapezoidalMap::FindTriangle ( su2double  val_x, su2double  val_y, unsigned long &  triangle_id, std::array< su2double, 3 > &  bary_coords  ) const

inline

Find the triangle containing a query point.

Returns

True if the point is inside the triangulation.

GetMemoryFootprint()

double CTrapezoidalMap::GetMemoryFootprint ( ) const

inline

Get the memory footprint of the map in MB.

---

The documentation for this class was generated from the following file:

• Common/include/containers/CTrapezoidalMap.hpp