Results 21 to 30 of about 4,303,118 (363)
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
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
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
New Algorithm of Joining a Set of Segments into a Simple Polygon
Journal of Harbin University of Science and Technology, 2018 For the problem of how to link a set of segments to a simple polygon with the shortest whole length, a sufficient condition that a given set of segments can be joined into a simple polygon is given.It is proved that the nearest point or second nearest ...
JIN Hui, LIU Run-tao
doaj +1 more source
Enumeration of the Additive Degree–Kirchhoff Index in the Random Polygonal Chains
Axioms, 2022 The additive degree–Kirchhoff index is an important topological index. This paper we devote to establishing the explicit analytical expression for the simple formulae of the expected value of the additive degree–Kirchhoff index in a random polygon. Based
Xianya Geng, Wanlin Zhu
doaj +1 more source
On $r$-Guarding Thin Orthogonal Polygons [PDF]
, 2016 Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a point $q$ if ...
Biedl, Therese, Mehrabi, Saeed
core +2 more sources