Results 11 to 20 of about 142,034 (198)
PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM
Khulna University Studies, 2022 In the field of computational geometry, pseudo-triangulation of a polygon is an interesting topic. Breaking a polygon into pseudo-triangles reduces the calculation cost and increases computational power.
S.M. Azoad Ahnaf +2 more
openalex +3 more sources
Lower Bound for Sculpture Garden Problem: Localization of IoT Devices
Applied Sciences, 2023 The purpose of the current study is to investigate a special case of art gallery problem, namely a sculpture garden problem. In this problem, for a given polygon P, the ultimate goal is to place the minimum number of guards (landmarks) to define the ...
M. Eskandari +2 more
semanticscholar +3 more sources
Planar lower envelope of monotone polygonal chains [PDF]
Information Processing Letters, 2015 A simple linear search algorithm running in $O(n+mk)$ time is proposed for constructing the lower envelope of $k$ vertices from $m$ monotone polygonal chains in 2D with $n$ vertices in total. This can be applied to output-sensitive construction of lower envelopes for arbitrary line segments in optimal $O(n\log k)$ time, where $k$ is the output size ...
Daniel L. Lu
openalex +4 more sources
Any Monotone Function Is Realized by Interlocked Polygons [PDF]
Algorithms, 2012 Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked).
Erik D. Demaine +2 more
+9 more sources
Modem illumination of monotone polygons [PDF]
Computational Geometry, 2017 We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number $k$ of walls. We call these objects $k$-modems and study the minimum number of $k$-modems sufficient and sometimes necessary to illuminate monotone and monotone
Oswin Aichholzer +5 more
openalex +3 more sources
Altitude terrain guarding and guarding uni-monotone polygons [PDF]
Computational Geometry, 2019 We present an optimal, linear-time algorithm for the following version of terrain guarding: given a 1.5D terrain and a horizontal line, place the minimum number of guards on the line to see all of the terrain. We prove that the cardinality of the minimum guard set coincides with the cardinality of a maximum number of ``witnesses'', i.e., terrain points,
Ovidiu Daescu +4 more
openalex +5 more sources
Line-of-Sight Pursuit in Monotone and Scallop Polygons [PDF]
International Journal of Computational Geometry & Applications, 2019 We study a turn-based game in a simply connected polygonal environment [Formula: see text] between a pursuer [Formula: see text] and an adversarial evader [Formula: see text]. Both players can move in a straight line to any point within unit distance during their turn.
Lindsay Berry +6 more
openalex +5 more sources
Approximate Guarding of Monotone and Rectilinear Polygons [PDF]
, 2005 We show a constant factor approximation algorithm for interior guarding of monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon.
Bengt J. Nilsson
openalex +5 more sources
Separation of two monotone polygons in linear time [PDF]
Robotica, 1984 SUMMARYLet P= (p1, p2, …, pn) and Q= (q1, q2, …, qm) be two simple polygons monotonic in directions θs and φ respectively. It is shown that P and Q are separable with a single translation in at least one of the directions: ,. Furthermore, a direction for carrying out such a translation can be determined in O(m + n) time.
Godfried T. Toussaint +1 more
openalex +3 more sources
Linear-time algorithms for weakly-monotone polygons
Computational Geometry, 1993 AbstractWe introduce the class of weakly-monotone polygons, and give an optimal triangulation algorithm for the class. We also present a simple linear-time detection algorithm, which for input polygon P returns the set of directions in which P is weakly-monotone.
Paul J. Heffernan
openalex +3 more sources