Results 21 to 30 of about 4,255,094 (265)
Sustainability, 2021 Precipitation is a crucial component of the water cycle, and its unpredictability may dramatically influence agriculture, ecosystems, and water resource management.
M. Achite +4 more
semanticscholar +1 more source
PARETO ENVELOPES IN SIMPLE POLYGONS [PDF]
International Journal of Computational Geometry & Applications, 2010 For a set T of n points in a metric space (X, d), a point y ∈ X is dominated by a point x ∈ X if d(x, t) ≤ d(y, t) for all t ∈ T and there exists t′ ∈ T such that d(x, t′) < d(y, t′). The set of non-dominated points of X is called the Pareto envelope of T. H.
Chepoi, Victor +3 more
openaire +2 more sources
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
Self-approaching paths in simple polygons [PDF]
Computational Geometry, 2020 We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points $a$, $b$, and $c$ that appear in that order along the curve, $|ac| \ge |bc ...
Bose, Prosenjit +2 more
openaire +9 more sources
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
The Visibility Center of a Simple Polygon [PDF]
, 2021 We introduce the \emph{visibility center} of a set of points inside a polygon -- a point $c_V$ such that the maximum geodesic distance from $c_V$ to see any point in the set is minimized. For a simple polygon of $n$ vertices and a set of $m$ points inside it, we give an $O((n+m) \log {(n+m)})$ time algorithm to find the visibility center.
Lubiw, Anna, Naredla, Anurag Murty
openaire +4 more sources
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
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
Computational Geometry, 1997 AbstractWe consider the problem of verifying a simple polygon in the plane using “test points”. A test point is a geometric probe that takes as input a point in Euclidean space, and returns “+” if the point is inside the object being probed or “−” if it is outside.
Patrice Belleville +6 more
openaire +1 more source
Stabbing information of a simple polygon
Discrete Applied Mathematics, 1996 The purpose of this paper is to investigate a new combinatorial object describing the structure of a simple polygon and compare it to other well-known objects such as the internal and external visibility graphs, the convex hull and the order type of the vertex set. We call the new object the stabbing information.
Everett, Hazel +2 more
openaire +3 more sources