This paper proposes a novel methodology for creating efficient polygon models for spatial datasets. A comprehensive analysis framework is proposed that takes a spatial cluster as an input and generates a polygon model for the cluster as an output. The framework creates a visually appealing, simple, and smooth polygon for the cluster by minimizing a fitness function. We propose a novel polygon f...

Polygon-based classification was performed on multi-scale images of SPOT4 XS, SPOT5 XS, IKONOS XS, QuickBird XS and QuickBird Pansharpaned (PS) covering an agricultural area located in Karacabey, Turkey. The objective of the study was to assess the classification accuracies of different spatial resolution images on an agricultural land using the polygon-based classification techniques. The exis...

We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well. In our version, we employ restricted angle guards so that these modern guards can visit α-degree of their surroundings. If α is between 0 and 180 degree, we demonstrate that the strong chromatic guarding number is constant. Then we use orthogonal 90-degree guards for...

The paper presents a parallel algorithm for polygon approximation targeted at reconfigurable multi-ring hardware. The proposed algorithm grows the edges of polygon approximation that is based on principle of merging. The edge/s are grown simultaneously at point/s where the minimum merging error is produced. The merging process is made faster by carrying it out in two stages: i) During first sta...

Let Fq be a finite field of cardinality q and characteristic p. Let P (x) be any one-variable Laurent polynomial over Fq of degree (d1, d2) respectively and p d1d2. For any fixed s ≥ 1 coprime to p, we prove that the q-adic Newton polygon of the L-functions of exponential sums of P (xs) has a tight lower bound which we call HodgeStickelberger polygon, depending only on the d1, d2, s and the res...

Given a graph G with n vertices and a set S of n points in the plane, a point-set embedding of G on S is a planar drawing such that each vertex of G is mapped to a distinct point of S. A straight-line point-set embedding is a point-set embedding with no edge bends or curves. The point-set embeddability problem is NP-complete, even when G is 2-connected and 2-outerplanar. It has been solved poly...

The shapes of malignant breast tumors are more complex than the benign lesions due to their nature of infiltration into surrounding tissues. We investigated the efficacy of shape features and presented a method using polygon shape complexity to improve the discrimination of benign and malignant breast lesions on ultrasound. First, 63 lesions (32 benign and 31 malignant) were segmented by K-way ...

The article is about the politics of birth control in Central and Eastern Europe (CEE). I will map abortion and contraception policies and discourses during and after state socialism, with Russia, Poland and Romania as main cases. Furthermore, historical and contemporary constructions of birth control in these countries are contrasted to western European debates, in order to denaturalise implic...

It is difficult to imagine a student approaching the history of the Early Church who would not, at an early stage of his involvement with this subject, be struck by the observation that he is dealing with an age of innumerable controversies. From every new page of any textbook he (or she, for that matter) is greeted by yet another name of yet another conflict that appears to have all but torn a...