Search results
Results From The WOW.Com Content Network
Point in polygon queries with respect to a monotone polygon may be answered in logarithmic time after linear time preprocessing (to find the leftmost and rightmost vertices). [1] A monotone polygon may be easily triangulated in linear time. [4] For a given set of points in the plane, a bitonic tour is a
The following is a selection from the large body of literature on absolutely/completely monotonic functions/sequences. René L. Schilling, Renming Song and Zoran Vondraček (2010). Bernstein Functions Theory and Applications. De Gruyter. pp. 1– 10. ISBN 978-3-11-021530-4. (Chapter 1 Laplace transforms and completely monotone functions)
A simple polygon is monotone with respect to a line L, if any line orthogonal to L intersects the polygon at most twice. A monotone polygon can be split into two monotone chains. A polygon that is monotone with respect to the y-axis is called y-monotone. A monotone polygon with n vertices can be triangulated in O(n) time. Assuming a given ...
A polygonal chain is called monotone if there is a straight line L such that every line perpendicular to L intersects the chain at most once. Every nontrivial monotone polygonal chain is open. In comparison, a monotone polygon is a polygon (a closed chain) that can be partitioned into exactly two monotone chains. [2]
A polygonalization is a simple polygon having a given set of points in the Euclidean plane as its set of vertices. A polygon may be described by a cyclic order on its vertices, which are connected in consecutive pairs by line segments, the edges of the polygon.
Modern implementations for Boolean operations on polygons tend to use plane sweep algorithms (or Sweep line algorithms). A list of papers using plane sweep algorithms for Boolean operations on polygons can be found in References below. Boolean operations on convex polygons and monotone polygons of the same direction may be performed in linear ...
In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a piecewise-linear Jordan curve consisting of finitely many line segments. These polygons include as special cases the convex polygons, star-shaped polygons, and monotone polygons.
Monotone class theorem, in measure theory; Monotone convergence theorem, in mathematics; Monotone polygon, a property of a geometric object; Monotonic function, a property of a mathematical function; Monotonicity of entailment, a property of some logical systems; Monotonically increasing, a property of number sequence