边或节点加权图上的分水岭“par l'apple”
Watersheds on edge or node weighted graphs "par l'exemple"
摘要:
分水岭已被定义为节点和边加权图。我们证明了它们是相同的:对于每个边(分别),节点)加权图存在节点(分别为边)加权图具有相同的最小值和汇水盆。
英文摘要:
Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp.\ node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。