About: Apothem is a research topic. Over the lifetime, 89 publications have been published within this topic receiving 909 citations. The topic is also known as: apo & Apothem.
TL;DR: In this article, two polygon fill algorithms are presented for filling polygons on a graphics display, one for strictly convex polygons and the other for a larger class of polygons.
Abstract: Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second polygon fill algorithm stores both a minimum value and maximum value for each scan line of the polygon for each line of the polygon. A fill line is then drawn from the least minimum value to the greatest maximum value for each scan line of the polygon.
TL;DR: An approach for representing polygons in an integrated circuit (IC) layout is provided in this article, where polygons are represented by one or more wires, which in turn are each represented by a pair of directed line segments.
Abstract: An approach for representing polygons in an integrated circuit (IC) layout is provided. Polygons are represented by one or more wires, which in turn are each represented by one or more wire segments. Each wire segment is represented by a pair of directed line segments. A data structure hierarchy includes polygon data, wire data, wire segment data and branch data. The polygon data represents a set of IC devices to be represented in the IC layout. The wire data represents the wires that represent the polygons and specifies the associated wire segments and associated polygons. The wire segment data represents the wire segments and specifies the associated directed line segments for each wire segment that represent the wires and references the wire data. The branch data specifies connections between wires by specifying the connecting wire segments in the wires. A spacing check between a first polygon and a second polygon involves determining the canonical direction from the first polygon to the second polygon and testing the two closest faces between the polygons. To satisfy a spacing violation, an exclusion zone is constructed around the first polygon and the second polygon is moved a distance outside the exclusion zone which causes the minimum spacing required by a set of predetermined spacing criteria to be satisfied.
TL;DR: In this article, a method for rendering adjacent polygons is proposed, which includes determining when a first polygon and a second polygon have an abutting edge and assigning a majority status to a pixel on the edge.
Abstract: A method for rendering adjacent polygons. The method includes determining when a first polygon and a second polygon have an abutting edge. If an abutting edge exists, a majority status is assigned to a pixel on the abutting edge. A first color of the first polygon or a second color of the second polygon is then allocated to the pixel in accordance with the majority status.
TL;DR: In this article, a line may be added by selecting a line of a polygon and adding a point to the line, thereby defining two lines with the point as their vertex, and a new line is drawn between the now-free endpoints of the lines which were respectively adjacent the removed lines.
Abstract: Polygon reshaping methods either add or subtract sides of lines of a polygon around an object of a digitized frame of picture stock. A line may be added by selecting a line of a polygon and adding a point to the line, thereby defining two lines with the point as their vertex. The point may be move along the line and away from the line to create an angle between the two lines on either side of the vertex. A line may be subtracted from a polygon either by selecting a line of the polygon and simply deleting it or by selecting a vertex of the polygon and deleting the two lines which shared the vertex. In the former line-removal case, the now-free endpoints of the lines adjacent to the removed line are moved and connected at a point defined along the removed line. In the latter vertex-removal case, a new line is drawn between the now-free endpoints of the lines which were respectively adjacent the removed lines. Any of the changes made to a particularly polygon may be propagated or interpolated through other frames of the shot.