ㅤㅤㅤㅤㅤ874 2023-06-03 11:17 采纳率: 0%
浏览 4

在二维化网格平面找出山峰山谷和溪流的位置

img


在二维网格化化平面找位置,可以用网格化二元插值法法吗?应该怎样做?

  • 写回答

1条回答 默认 最新

  • threenewbee 2023-06-03 15:52
    关注
    import numpy as np 
    
    # create matrix with altitude values 
    matrix = np.array([[1, 3, 5], [2, 4, 6], [7, 8, 9]])
    
    # create empty dictionary to store peaks, valleys, and canyons
    results = {'peak': [], 'valley': [], 'canyon': []} 
    
    # find index of minimum and maximum values in matrix
    min_row, min_col = np.unravel_index(matrix.argmin(), matrix.shape) 
    max_row, max_col = np.unravel_index(matrix.argmax(), matrix.shape) 
    
    # iterate over each position in matrix and compare to neighboring positions 
    for i in range(matrix.shape[0]): 
      for j in range(matrix.shape[1]): 
        if i > 0 and i < matrix.shape[0]-1 and j > 0 and j < matrix.shape[1]-1: 
          if matrix[i,j] > matrix[i-1,j] and matrix[i,j] > matrix[i+1,j] and matrix[i,j] > matrix[i,j-1] and matrix[i,j] > matrix[i,j+1]: 
            results['peak'].append((i,j)) 
          elif matrix[i,j] < matrix[i-1,j] and matrix[i,j] < matrix[i+1,j] and matrix[i,j] < matrix[i,j-1] and matrix[i,j] < matrix[i,j+1]: 
            results['valley'].append((i,j)) 
          elif matrix[i,j] > matrix[i-1,j] and matrix[i,j] < matrix[i+1,j] and matrix[i,j] < matrix[i,j-1] and matrix[i,j] < matrix[i,j+1]: 
            results['canyon'].append((i,j)) 
    
    print('Peaks:', results['peak']) 
    print('Valleys:', results['valley']) 
    print('Canyons:', results['canyon'])
    
    
    评论

报告相同问题?

问题事件

  • 创建了问题 6月3日

悬赏问题

  • ¥15 如何在scanpy上做差异基因和通路富集?
  • ¥20 关于#硬件工程#的问题,请各位专家解答!
  • ¥15 关于#matlab#的问题:期望的系统闭环传递函数为G(s)=wn^2/s^2+2¢wn+wn^2阻尼系数¢=0.707,使系统具有较小的超调量
  • ¥15 FLUENT如何实现在堆积颗粒的上表面加载高斯热源
  • ¥30 截图中的mathematics程序转换成matlab
  • ¥15 动力学代码报错,维度不匹配
  • ¥15 Power query添加列问题
  • ¥50 Kubernetes&Fission&Eleasticsearch
  • ¥15 報錯:Person is not mapped,如何解決?
  • ¥15 c++头文件不能识别CDialog