In this work, we introduce two sets of algorithms inspired by the ideas from modern geometry. One is computational conformal geometry method, including harmonic maps, holomorphic 1-forms and Ricci flow. The other one is optimization method using affine normals.

Laser scanning is an effective tool for acquiring geometric attributes of trees and vegetation, which lays a solid foundation for 3-dimensional tree modelling. Existing studies on tree modelling from laser scanning data are vast. However, some works cannot guarantee sufficient modelling accuracy, while some other works are mainly rule-based and therefore highly depend on user inputs. In this paper, we propose a novel method to accurately and automatically reconstruct detailed 3D tree models from laser scans. We first extract an initial tree skeleton from the input point cloud by establishing a minimum spanning tree using the Dijkstra shortest-path algorithm. Then, the initial tree skeleton is pruned by iteratively removing redundant components. After that, an optimization-based approach is performed to fit a sequence of cylinders to approximate the geometry of the tree branches. Experiments on various types of trees from different data sources demonstrate the effectiveness and robustness of our method. The overall fitting error (i.e., the distance between the input points and the output model) is less than 10 cm. The reconstructed tree models can be further applied in the precise estimation of tree attributes, urban landscape visualization, etc. The source code of this work is freely available at https://github.com/tudelft3d/adtree

In this paper, we propose novel algorithms for inpainting and refinement of diffeomorphisms. We first represent a diffeomorphism by its Beltrami coefficient. Then it is possible to refine and inpaint the diffeomorphism by processing this Beltrami coefficient. With the inpainted/refined Beltrami coefficient, we construct a new diffeomorphism using the exact Beltrami holomorphic flow algorithm proposed in this paper. We apply our algorithms on several practical applications, which include the inpainting of a highly distorted diffeomorphism, the inpainting of image sequences of deforming shapes, the super-resolution of diffeomorphisms and the global parameterization of cortical surfaces by combining local parameterizations. Experiments show that our algorithm can solve these problems with natural and smooth results. We demonstrate how our proposed method can be widely applied in areas from texture mapping to video processing, and from computer graphics to medical imaging.

In this paper, we study intermittent behaviors of coupled piecewise-expanding map lattices with two nodes and a weak coupling. We show that the successive phase transition between ordered and disordered phases occurs for almost every orbit. That is, we prove $\liminf_{n\rightarrow \infty}| x_1(n)-x_2(n)|=0$ and $\limsup_{n\rightarrow \infty}| x_1(n)-x_2(n)|\ge c_0>0$, where $x_1(n), x_2(n)$ correspond to the coordinates of two nodes at the iterative step $n$. We also prove the same conclusion for weakly coupled tent-map lattices with any multi-nodes.

No abstract uploaded!