No abstract uploaded!

No abstract uploaded!

Let $K$ be a self-similar set satisfying the open set condition. Following Kaimanovich’s elegant idea, it has been proved that on the symbolic space $X$ of $K$ a natural augmented tree structure $E$ exists; it is hyperbolic, and the hyperbolic boundary $\partial_H X$ with the Gromov metric is H\"older equivalent to $K$. In this paper we consider certain reversible random walks with return ratio $0 < \lambda < 1$ on $(X,E)$. We show that the Martin boundary ${\mathcal M}$ can be identified with $\partial_H X$ and $K$. With this setup and a device of Silverstein, we obtain precise estimates of the Martin kernel and the Na\"im kernel in terms of the Gromov product. Moreover, the Naïm kernel turns out to be a jump kernel satisfying the estimate $\Theta (\xi,\eta) \asymp |\xi-\eta|^{-(\alpha+\beta)}$, where $\alpha$ is the Hausdorff dimension of $K$ and $\beta$ depends on $\lambda$. For suitable $\beta$, the kernel defines a regular non-local Dirichlet form on $K$. This extends the results of Kigami concerning random walks on certain trees with Cantor-type sets as boundaries.

We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary. We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.

No abstract uploaded!