No abstract uploaded!

No abstract uploaded!

Let $k$ be a field and $k(x_0,\ldots,x_{p-1})$ be the rational function field of $p$ variables over $k$ where $p$ is a prime number. Suppose that $G=\langle\sigma\rangle \simeq C_p$ acts on $k(x_0,\ldots,x_{p-1})$ by $k$-automorphisms defined as $\sigma:x_0\mapsto x_1\mapsto\cdots\mapsto x_{p-1}\mapsto x_0$. Denote by $P$ the set of all prime numbers and define $P_0=\{p\in P:\bm{Q}(\zeta_{p-1})$ is of class number one$\}$ where $\zeta_n$ a primitive $n$-th root of unity in $\bm{C}$ for a positive integer $n$; $P_0$ is a finite set by \cite{MM}. Theorem. Let $k$ be an algebraic number field and $P_k=\{p\in P: p$ is ramified in $k\}$. Then $k(x_0,\ldots,x_{p-1})^G$ is not stably rational over $k$ for all $p\in P\backslash (P_0\cup P_k)$.

No abstract uploaded!

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