我在1100 * 1100平方米的涡流协方差系统上有2D足迹结果,其域名为
library(OpenStreetMap)
library(rgdal)
map <- openmap(c(36.05778,-97.19250), c(36.05444,-97.18861),type='bing')
plot(map)
域(每个网格)的单元格大小为2米,相应的原点(0,0)位于此位置:
library(fields)
str(FFP$fclim_2d)
image.plot(FFP$x_2d[1,],FFP$y_2d[,1],FFP$fclim_2d)
这里附有一个示例数据(9.01 Mb)。 FFP.rds
然后我可以在我的网站上绘制Bing地图:
interface IBar extends IFoo {
methodOne(a: any, b?: any, c?: any);
}
我使用包“字段”中的image.plot()用以下代码绘制足迹:
namespace Algos {
template <typename T>
struct LinkedListData{
struct Node {
std::unique_ptr<Node> next;
Node *prev = nullptr;
T data;
};
std::unique_ptr<Node> root;
Node *last = nullptr;
int size = 0;
LinkedListData() {
root = std::make_unique<Node>();
root->prev = nullptr; //last virtual element
root->next = std::make_unique<Node>();
last = root->next.get();
last->prev = root.get();
last->next = nullptr;
}
//deferr pointers manually to avoid stackoverflow due to
//recursion explosion
static void cleanup(LinkedListData<T> *data) {
#ifdef DEBUG_TXT
int nodeCount=0;
#endif
Node *n = data->last;
if(n==nullptr) { return; }
while(n) {
#ifdef DEBUG_TXT
if(n->next.get())
std::cout << "Release {n->next()} [" << ++nodeCount <<
"]: "<< n->next.get() << std::endl;
#endif
n->next.release();
ALGO_ASSERT(n->next.get() == nullptr, "Node reference not deferred");
n = n->prev;
}
data->size = 0;
#ifdef DEBUG_TXT
std::cout << "Release {Root} [" << ++nodeCount << "]: "<< data->root.get() << std::endl;
#endif
data->root.release();
}
};
template <class T>
class LinkedList {
typedef typename LinkedListData<T>::Node node_type;
std::shared_ptr<LinkedListData<T> > d;
public:
LinkedList() : d(new LinkedListData<T>(), LinkedListData<T>::cleanup){}
/* Code omitted .... */
};
}
但我想知道如何将我的足迹结果的每个网格缩放到Bing地图(或谷歌地图)。
任何建议都将不胜感激。