Despite ample research, understanding plant spread and predicting their ability to track projected climate changes remain a formidable challenge to be confronted. We modelled the spread of North American wind-dispersed trees in current and future (c. 2060) conditions, accounting for variation in 10 key dispersal, demographic and environmental factors affecting population spread. Predicted sprea...

In this paper we explore the dynamical behaviour of the qdeformed versions of widely studied 1D nonlinear map-the Gaussian map and another famous 2D nonlinear map-the Henon map. The Gaussian map is perhaps the only 1D nonlinear map which exhibits the co-existing attractors. In this study we particularly, compare the dynamical behaviour of the Gaussian map and q-deformed Gaussian map with a spec...

In this paper, we present a novel method for surface sampling and remeshing with good blue-noise properties. Our approach is based on the farthest point optimization (FPO), a relaxation technique that generates high quality blue-noise point sets in 2D. We propose two important generalizations of the original FPO framework: adaptive sampling and sampling on surfaces. A simple and efficient algor...

We show that the planar dual to the Euclidean farthest point Voronoi diagram for the set of vertices of a convex polygon has the lexicographic minimum possible sequence of triangle angles, sorted from sharpest to least sharp. As a consequence, the sharpest angle determined by three vertices of a convex polygon can be found in linear time.

A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into two subsets whose centroids are farthest from each other, and the process is repeated recursively on each subset. The bisection task can be formulated as an integer programming problem, which is NP-hard. Instead, an ap...

K. S. Lau had shown that a reflexive Banach space has the Mazur Intersection Property (MIP) if and only if every closed bounded convex set is the closed convex hull of its farthest points. In this work, we show that in general this latter property is equivalent to a property stronger than the MIP. As corollaries, we recapture the result of Lau and characterize the w*-MIP in dual of RNP spaces.

The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional space is discussed under three comon distance metrics -Euclidean, rectilinear, and L . co By employing a subroutine that -=. solves the post office problem, we show that, for fixed k 2 3 , such a minimum spanning tree can be found in time O(n2’&Ck)(log n)l-a(k)) 9 where a(k) = 2 -(k+l) 1.8 . The bound can be ...