Results 11 to 20 of about 5,737 (222)
Minkowski Sums of Monotone and General Simple Polygons [PDF]
Discrete & Computational Geometry, 2005 Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons, all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of l simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ź Q is O(klmnź(min{m,n})
Eduard Oks, Micha Sharir
openalex +3 more sources
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. The sweep line algorithm also known as the plane sweep algorithm uses an imaginary line or a plain surface on the Euclidean plain to perform various ...
S.M. Azoad Ahnaf +2 more
openalex +3 more sources
Lion and Man with Visibility in Monotone Polygons [PDF]
The International Journal of Robotics Research, 2013 In the original version of the lion and man game, a lion tries to capture a man who is trying to escape in a circular arena. The players have equal speeds. They can observe each other at all times. We study a new variant of the game in which the lion has only line-of-sight visibility.
Narges Noori, Volkan Isler
openalex +2 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 +3 more sources
Witness Set in Monotone Polygons: Exact and Approximate [PDF]
40 pages, 24 ...
Udvas Das +4 more
openalex +3 more sources
The Complexity of Guarding Monotone Polygons
, 2012 A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection with P. A set G of points inside P or on the boundary of P is said to guard the polygon if every point inside P or on the boundary of P is seen by a point in G. An interior guard can lie anywhere inside or on the boundary of the polygon. Using a reduction
Erik Krohn, Bengt J. Nilsson
openalex +3 more sources
Approximating monotone polygonal curves using the uniform metric [PDF]
Proceedings of the twelfth annual symposium on Computational geometry - SCG '96, 1996 Kasturi Varadarajan
openalex +2 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 ...
Marzieh Eskandari +2 more
doaj +1 more source
Q-Curve and Area Rules for Choosing Heuristic Parameter in Tikhonov Regularization
Mathematics, 2020 We consider choice of the regularization parameter in Tikhonov method if the noise level of the data is unknown. One of the best rules for the heuristic parameter choice is the quasi-optimality criterion where the parameter is chosen as the global ...
Toomas Raus, Uno Hämarik
doaj +1 more source
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +1 more source