Results 51 to 60 of about 4,255,094 (265)
Geodesic-Preserving Polygon Simplification [PDF]
, 2013 Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve
Aichholzer, Oswin +4 more
core +1 more source
PLoS ONE, 2021 Dissolved organic matter (DOM) is a ubiquitous component of aquatic systems, impacting aquatic health and drinking water quality. These impacts depend on the mixture of organic molecules that comprise DOM.
Pieter J K Aukes, Sherry L Schiff
doaj +1 more source
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons [PDF]
, 2015 We consider the following motion-planning problem: we are given $m$ unit discs in a simple polygon with $n$ vertices, each at their own start position, and we want to move the discs to a given set of $m$ target positions.
A Dumitrescu +12 more
core +2 more sources
Reconstruction of Weakly Simple Polygons from their Edges [PDF]
, 2016 Given n line segments in the plane, do they form the edge set of a weakly simple polygon; that is, can the segment endpoints be perturbed by at most epsilon, for any epsilon > 0, to obtain a simple polygon?
Akitaya, Hugo A.
core +1 more source
Nature Communications, 2023 Pen-drawing is an intuitive, convenient, and creative fabrication method for delivering emergent and adaptive design to real devices. To demonstrate the application of pen-drawing to robot construction, we developed pen-drawn Marangoni swimmers that ...
Seo Woo Song +10 more
doaj +1 more source
Optimal Cover of Points by Disks in a Simple Polygon
SIAM journal on computing (Print), 2010 Let P be a simple polygon, and let Q be a set of points in P. We present an almost-linear time algorithm for computing a minimum cover of Q by disks that are contained in P.
Haim Kaplan +3 more
semanticscholar +1 more source
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
Algorithms, 2018 Let R denote a connected region inside a simple polygon, P. By building barriers (typically straight-line segments) in P \ R
Rolf Klein +2 more
doaj +1 more source
Positive geometry, local triangulations, and the dual of the Amplituhedron
Journal of High Energy Physics, 2021 We initiate the systematic study of local positive spaces which arise in the context of the Amplituhedron construction for scattering amplitudes in planar maximally supersymmetric Yang-Mills theory. We show that all local positive spaces relevant for one-
Enrico Herrmann +3 more
doaj +1 more source
Decomposing a simple polygon into pseudo-triangles and convex polygons
Computational Geometry, 2008 AbstractIn this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseudo-triangles and convex polygons. We call the resulting decomposition PT-convex.
Stefan Gerdjikov, Alexander Wolff
openaire +3 more sources
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem [PDF]
Discrete Mathematics & Theoretical Computer ScienceGiven a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a minimum size set $G\subset P$ of guards that sees $P$ completely.
Simon Hengeveld, Tillmann Miltzow
doaj +1 more source