Results 131 to 140 of about 142,034 (198)
Extreme point and halving edge search in abstract order types.
Comput Geom, 2013 Aichholzer O, Miltzow T, Pilz A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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.
Priyam Dhanuka +4 more
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 ...
Sanjib Sadhu +4 more
openaire +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
Partitioning Polygons into Tree Monotone and Y -monotone Subpolygons
, 2003 A 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
openalex +3 more sources
An improved monotone finite volume scheme for diffusion equation on polygonal meshes
Journal of Computational Physics, 2012 We construct a new nonlinear monotone finite volume scheme for diffusion equation on polygonal meshes. The new scheme uses the cell-edge unknowns instead of cell-vertex unknowns as the auxiliary unknowns in order to improve the accuracy of monotone scheme. Our scheme is locally conservative and has only cell-centered unknowns.
Zhiqiang Sheng, Guangwei Yuan
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 +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
Computing the shortest diagonal of a monotone polygon in linear time
Information Processing Letters, 1992B. Zhu
openaire +3 more sources