Results 161 to 170 of about 5,704 (200)
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
Approximate Guarding of Monotone and Rectilinear Polygons [PDF]
Algorithmica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bengt J Nilsson
exaly +7 more sources
Some of the next articles are maybe not open access.
Testing a simple polygon for monotonicity
Information Processing Letters, 1981Franco P Preparata, Kenneth J Supowit
exaly +2 more sources
Covering a Simple Polygon by Monotone Directions
Lecture Notes in Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hee-Kap Ahn +2 more
exaly +5 more sources
On decomposing polygons into uniformly monotone parts
Information Processing Letters, 1988We present an \(O(n^ 3)\) algorithm for finding a maximum set of independent chords in a circle with n vertices on its circumference. We use this result to partition simple polygons into the minimum number of uniformly monotone polygons. Two or more polygons are uniformly monotone if they are monotone with respect to a common axis.
Simeon Ntafos
exaly +3 more sources
Triangulating a monotone polygon in parallel
Lecture Notes in Computer Science, 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.
exaly +2 more sources
Uniformly monotone partitioning of polygons
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hee-Kap Ahn
exaly +3 more sources
Optimal uniformly monotone partitioning of polygons with holes
CAD Computer Aided Design, 2012Polygon partitioning is an important problem in computational geometry with a long history. In this paper we consider the problem of partitioning a polygon with holes into a minimum number of uniformly monotone components allowing arbitrary Steiner points. We call this the MUMC problem.
Ajay Joneja, David M Mount
exaly +3 more sources
A new linear algorithm for triangulating monotone polygons
Pattern Recognition Letters, 1984Summary: 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
exaly +2 more sources