📄 combine_pots.m,v
字号:
head 1.1;access;symbols;locks deventer:1.1; strict;comment @// @;1.1date 2003.03.11.16.46.19; author deventer; state Exp;branches;next ;desc@Einfuegen von reduce_pot am Anfang, um minimalen tail zu garantieren.dv, 11.3.2003@1.1log@Initial revision@text@function pot = combine_pots(pot1, pot2)
% COMBINE_POTS combine two potentials
% pot = combine_pots(pot1, pot2)
% Reduce both potentials before trying to combine them.
% Cf. "Stable Local computation with Conditional Gaussian Distributions", page 9
% Consider again two potentials with minimal tail
% Guarantee minimal tails. If pot1 or pot2 are minimal, they are not changed
pot1 = reduce_pot(pot1)
pot2 = reduce_pot(pot2)
%if the intersect set of these two potentials' head conts. combination is undifined
if ~isempty( myintersect(pot1.cheaddom, pot2.cheaddom) )
return;
end
if isempty( myintersect(pot1.domain, pot2.cheaddom) ) | isempty( myintersect(pot2.domain, pot1.cheaddom))
% if satisfy the condition of directed combine
pot = direct_combine_pots(pot1, pot2);
else
% perform recursive combine
pot = recursive_combine_pots(pot1, pot2);
end
@
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -