Monotone polygon

Known as: Monotone 
In geometry, a polygon P in the plane is called monotone with respect to a straight line L, if every line orthogonal to L intersects P at most twice… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2014
2014
In this paper, we propose an inertial forward-backward splitting algorithm to compute a zero of the sum of two monotone operators… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2012
2012
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection with P . A set G of points… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2010
2010
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We present a statistical machine translation model that uses hierarchical phrasesphrases that contain subphrases. The model is… (More)
Is this relevant?
1999
1999
This paper considers reconngurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the… (More)
Is this relevant?
1989
1989
In this paper we present a.n efficient pa.ra.Ilel algorithm. for polygon tria.ngu.Ia.tion. The algo-rithm we present runs in O… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1988
1988
The decomposition of polygons into simpler shapes is an important branch of computational geometry with many applications [5,10… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The problem of decomposing a polygon into simpler components is of interest in fields such as computational geometry, syntactic… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
Is this relevant?
1984
1984
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone formulae with restricted depth… (More)
Is this relevant?