message: Fix an issue in aabb tree self intersection.
diff: @@ -281,7 +281,8 @@ namespace RINGMesh {
  * - nearest_point the nearest point on the closest edge.
  * - distance the distance between \p query and \p nearest_point.
  */
  - std::tuple< index_t, vecn< DIMENSION >, double > closest_edge( const vecn< DIMENSION >& query ) const;
  + std::tuple< index_t, vecn< DIMENSION >, double > closest_edge(
  + const vecn< DIMENSION >& query ) const;
  private:
  /*!
  * @brief Gets an element point from its box
  @@ -495,6 +496,7 @@ namespace RINGMesh {
  // Leaf case
  if( is_leaf( element_begin, element_end ) ) {
  + // @todo Check if the box is not intersecting itself
  index_t cur_box = mapping_morton_[element_begin];
  action( cur_box );
  return;
  @@ -540,6 +542,9 @@ namespace RINGMesh {
  // Simple case: leaf - leaf intersection.
  if( is_leaf( element_begin1, element_end1 )
  && is_leaf( element_begin2, element_end2 ) ) {
  + if( node_index1 == node_index2 ) {
  + return;
  + }
  action( mapping_morton_[element_begin1],
  mapping_morton_[element_begin2] );
  return;
  