On Divergence-based Distance Functions for Multiply-connected Domains

MaRDI QIDQ6296761zbMATH OpenFDO

Authors Renjie Chen, Craig Gotsman, Kai Hormann

Publication date 14 January 2018

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Given a finitely-connected bounded planar domain $Omega$, it is possible to define a {it divergence distance} $D(x,y)$ from $xinOmega$ to $yinOmega$, which takes into account the complex geometry of the domain. This distance function is based on the concept of $f$-divergence, a distance measure traditionally used to measure the difference between two probability distributions. The relevant probability distributions in our case are the Poisson kernels of the domain at $x$ and at $y$. We prove that for the $ch{i}^2$-divergence distance, the gradient by $x$ of $D$ is opposite in direction to the gradient by $x$ of $G(x,y)$, the Green's function with pole $y$. Since $G$ is harmonic, this implies that $D$, like $G$, has a single extremum in $Omega$, namely at $y$ where $D$ vanishes. Thus $D$ can be used to trace a gradient-descent path within~$Omega$ from $x$ to $y$ by following $abl{a}_{x}D(x,y)$, which has significant computational advantages over tracing the gradient of $G$. This result can be used for robotic path-planning in complex geometric environments.

This page was built for publication: On Divergence-based Distance Functions for Multiply-connected Domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6296761)