Results 161 to 170 of about 5,737 (222)
A counterexample regarding a two-phase problem for harmonic measure in VMO
Tolsa X.
europepmc +1 more source
Extreme point and halving edge search in abstract order types.
Comput Geom, 2013 Aichholzer O, Miltzow T, Pilz A.
europepmc +1 more source
An alternative approach for computing monotone polygon
2015 International Conference on Advances in Computer Engineering and Applications, 2015 An 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.
Priyam Dhanuka +4 more
openalex +2 more sources
Triangulating a monotone polygon in parallel
, 1988 Given 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.
Hubert Wagener
openalex +2 more sources
Monotone labelings in polygonal tilings
Journal of Heuristics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas K�mpke
openalex +2 more sources
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Lingas +2 more
openalex +2 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 +2 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
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
A new linear algorithm for triangulating monotone polygons
Pattern Recognition Letters, 1984 Summary: Let \(P=(p_ 1,p_ 2,...,p_ n)\) be a monotone polygon whose vertices are specified in terms of cartesian coordinates in order. A new simple two-step procedure is presented for triangulating P, without the addition of new vertices, in O(n) time.
Godfried T. Toussaint
openalex +2 more sources