Results 1 to 10 of about 117,700 (279)
On link diameter of a simple rectilinear polygon [PDF]
Computer Science Journal of Moldova, 1993 The rectilinear link distance between two points inside a simple rectilinear polygon P is defined to be the minimum number of edges of a path consisting of axis-parallel segments lying inside P. The link diameter of P is the maximum link distance between
V. Chepoi, F. Dragan
doaj +1 more source
An Upper Bound for Min-Max Angle of Polygons [PDF]
Mathematics Interdisciplinary Research, 2023 Let $S$ be a set of $n$ points in the plane, $\nabla(S)$ the set of all simple polygons crossing $S$, $\gamma_P$ the maximum angle of polygon $P \in \nabla(S)$ and $\theta =min_{P\in\nabla(S)} \gamma_P$.
Saeed Asaeedi +2 more
doaj +1 more source
Innovation Characteristics in Configuring Farmers’ Digital Literacy on E-Reporting Polygon in Wukirsari Indonesia [PDF]
BIO Web of Conferences, 2023 The e-reporting polygon is an effort of the Ministry of Agriculture to maximize agricultural cultivation activities, especially on the availability of subsidized fertilizers.
Shania Alya Hisna +2 more
doaj +1 more source
A simple polygon-polygon basis method to compare categorical raster maps [PDF]
International Journal for Simulation and Multidisciplinary Design Optimization, 2009 In this paper we present a method for comparing categorical raster maps based on comparing categories at the polygon level. In contrast with the most commonly used pixel-level methods of comparison, the proposed method reduces both possible map ...
Ordóñez Celestino +3 more
doaj +1 more source
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete ...
Sergio Cabello, Maria Saumell
doaj +1 more source
Generation of simple polygons from ordered points using an iterative insertion algorithm.
PLoS ONE, 2020 To construct a simple polygon from a set of plane points, we propose an iterative inserting ordered points (IIOP) algorithm. Using a given a set of ordered non-collinear points, a simple polygon can be formed and its shape is dependent on the sorting ...
Hongyun Zhang, Quanhua Zhao, Yu Li
doaj +1 more source
Calculations of Dihedral Groups Using Circular Indexation [PDF]
Mathematics Interdisciplinary Research, 2019 In this work, a regular polygon with n sides is described by a periodic (circular) sequence with period n. Each element of the sequence represents a vertex of the polygon.
Reza Dianat, Mojgan Mogharrab
doaj +1 more source
Incremental Construction of Motorcycle Graphs
Algorithms, 2022 We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast.
Franz Aurenhammer +2 more
doaj +1 more source
Buckling of Tapered Columns with Polygon Cross-Section [PDF]
Computational Engineering and Physical Modeling, 2018 This paper is concerned with the elastic stability of slender tapered columns of regular polygon cross-section with constant volume is presented. Various end conditions of the tapered columns such as pinned ends, clamped -pinned ends and clamped ends are
Magdy Salama
doaj +1 more source
Forms of Crossed and Simple Polygons
Science & Philosophy, 2019 In this paper the author presents a new form of hexagon and the solution of the open problem of classifying plane hexagons. In particular are illustrated the forms of crossed and simple n-gons for n = 3, 4, 5, 6 and also the forms of simple ones for n ...
Luigi Togliani
doaj +1 more source