A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time [PDF]
Discrete & Computational Geometry, 2001 N. Amato, M. Goodrich, E. Ramos
semanticscholar +2 more sources
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
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts [PDF]
Algorithmica, 2006 Jae-Sook Cheong +2 more
semanticscholar +2 more sources
Dynamic Algorithms for Visibility Polygons in Simple Polygons [PDF]
International Journal of Computational Geometry & Applications, 2020 We devise the following dynamic algorithms for both maintaining as well as querying for the visibility and weak visibility polygons amid vertex insertions and deletions to the simple polygon. A fully-dynamic algorithm for maintaining the visibility polygon of a fixed point located interior to the simple polygon amid vertex insertions and deletions to
R. Inkulu, K. Sowmya, Nitish P. Thakur
openaire +3 more sources
An efficient algorithm for finding the CSG representation of a simple polygon [PDF]
International Conference on Computer Graphics and Interactive Techniques, 1988 D. Dobkin +3 more
semanticscholar +2 more sources
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
Recognizing Weakly Simple Polygons [PDF]
Discrete & Computational Geometry, 2017 35 pages, 28 figures. A 15-page extended abstract has appeared in the Proceeding of the 32nd International Symposium on Computational Geometry (Boston, MA, 2016)
Akitaya, Hugo A. +3 more
openaire +5 more sources
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
Computing a Geodesic Two-Center of Points in a Simple Polygon [PDF]
Latin American Symposium on Theoretical Informatics, 2016 Given a simple polygon P and a set Q of points contained in P, we consider the geodesic k-center problem in which we seek to find k points, called centers, in P to minimize the maximum geodesic distance of any point of Q to its closest center.
Eunjin Oh, S. Bae, Hee-Kap Ahn
semanticscholar +1 more source