Results 171 to 180 of about 5,704 (200)
Some of the next articles are maybe not open access.
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Lingas +2 more
openaire +1 more source
Computing the shortest diagonal of a monotone polygon in linear time
Information Processing Letters, 1992We improve the results of \textit{B. Zhu} and \textit{A. Mirzaian} [A linear time algorithm to find the shortest diagonal of a unimonotone polygon, Tech. Rept. CS-90-8, Dept. of Computer Science, York University (1990)] to present a linear time algorithm for an arbitrary monotone polygon.
Binhai Zhu
exaly +3 more sources
Monotone labelings in polygonal tilings
Journal of Heuristics, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An alternative approach for computing monotone polygon
2015 International Conference on Advances in Computer Engineering and Applications, 2015An algorithm has been designed to compute a random monotone polygon from an input set of points lying on a 2-D dimensional plane. Our algorithm is based on sweep line method with some modifications and it computes monotone polyogn in O(nlogn) time complexity and O(n) space complexity. LEDA software has been used to execute our algorithm.
Kamaljit Kaur, Manas Kumar Mohanty
exaly +2 more sources
Separation of two monotone polygons in linear time
Robotica, 1984SUMMARYLet 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, Hossam A. ElGindy
openaire +1 more source
Partitioning Polygons into Tree Monotone and Y -monotone Subpolygons
2003A polygon Q is tree monotone if, for some highest or lowest point p on Q and for any point q interior to Q, there is a y-monotone curve from p to q whose interior is interior to Q. We show how to partition an n vertex polygon P in Θ(n) time into tree monotone subpolygons such that any y-monotone curve interior to P intersects at most two of the ...
Ralph P. Boland, Jorge Urrutia
openaire +1 more source
The VC-dimension of visibility on the boundary of monotone polygons
Computational Geometry, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matt Gibson 0001 +2 more
openaire +1 more source
Rectilinear Duals Using Monotone Staircase Polygons
2014A rectilinear dual of a plane graph refers to a partition of a rectangular area into nonoverlapping rectilinear polygonal modules, where each module corresponds to a vertex such that two modules have side-contact iff their corresponding vertices are adjacent.
Yi-Jun Chang, Hsu-Chun Yen
openaire +1 more source
GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
International Journal of Computational Geometry & Applications, 2005A simple polyhedron is weakly-monotonic in direction [Formula: see text] provided that the intersection of the polyhedron and any plane with normal [Formula: see text] is simply-connected (i.e. empty, a point, a line-segment or a simple polygon). Furthermore, if the intersection is a convex set, then the polyhedron is said to be weakly-monotonic in ...
Prosenjit Bose, Marc J. van Kreveld
openaire +3 more sources
Monotone polygons using linked list
2015 International Conference on Advances in Computer Engineering and Applications, 2015Two heuristics have been designed to generate a random monotone polygon from a given set of ‘n’ points lying on a 2-Dimensional plane. The first algorithm runs in O(n2) time using constant work space algorithm. The second algorithm is designed using dynamic memory allocation to generate x-monotone in O(n) time with a preprocessing time complexity of O ...
Manas Kumar Mohanty
exaly +2 more sources