Results 171 to 180 of about 148,856 (241)
Some of the next articles are maybe not open access.
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 ...
Sanjib Sadhu +4 more
openaire +3 more sources
Triangulating a monotone polygon in parallel
Workshop on Computational Geometry, 1988Given a simple n-sided polygon, the triangulation problem is to partition the interior of the polygon into n — 2 triangles by adding n — 3 nonintersecting diagonals. We propose an O(log n)-time algorithm for triangulating monotone n-sided polygons using only n/log n processors in the CREW-PRAM model.
H. Wagener
openaire +3 more sources
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.
B. Zhu
openaire +4 more sources
Euler Polygonal Lines for Itô Equations with Monotone Coefficients
Theory of Probability & Its Applications, 1988 See the review in Zbl 0624.60072.
L. A. Alyushina
openalex +4 more sources
A monotone combination scheme of diffusion equations on polygonal meshes
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 2020 AbstractWe present a novel monotone scheme which is a combination of linear scheme and nonlinear monotone scheme for solving diffusion problems on general polygonal meshes. It will be called as a combination scheme and consists of two steps. Firstly, a second‐order accurate linear scheme is used to obtain an approximate solution.
Fei Zhao, Zhiqiang Sheng, Guangwei Yuan
openalex +3 more sources
International Journal of Computational Geometry & Applications, 2001 We present efficient algorithms for the problems of matching red and blue disjoint geometric obstacles in the plane and connecting the matched obstacle pairs with mutually nonintersecting paths that have useful geometric properties. We first consider matching n red and n blue disjoint rectilinear rectangles and connecting the n matched rectangle pairs ...
Mikhail J. Atallah, Danny Z. Chen
openalex +4 more sources
Rectilinear Duals Using Monotone Staircase Polygons
, 2014 A 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
openalex +3 more sources
Monotone path queries and monotone subdivision problems in polygonal domains
, 2010 In this thesis, we explore two problems in geometry, both related to monotonicity. The problem of finding monotone paths between two given points has useful applications in path planning, and in particular it is useful to look for minimum link paths.
Xiangzhi Wei
openalex +3 more sources
Disk potential functions for polygon spaces
The Journal of Symplectic Geometry, 2022We derive a Floer theoretical SYZ mirror for an equilateral and generic polygon space. The disk potential function of the monotone torus fiber of the caterpillar bending system is calculated by computing non-trivial open Gromov--Witten invariants from ...
Yoosik Kim, Siu-Cheong Lau, Xiao Zheng
semanticscholar +1 more source
Polygon Overlay Analysis Algorithm Based on Monotone Chain and STR Tree in the Simple Feature Model
International Conference on Electrical and Control Engineering, 2010 Zhanlong Chen, Lina Ma, Liang Wu
openalex +2 more sources