SIMPLIFYING A POLYGON
First Claim
1. A process comprising:
- receiving, by one or more computing devices, first data representing a first polygon having a first set of vertices;
generating a resulting polygon at least in part by;
using polygon expanding logic of the one or more computing devices, causing determining a second polygon having a second set of vertices, such that the second polygon encompasses the first polygon, by determining, for each particular vertex in the first set of vertices, one or more new vertices that are determined from that particular vertex and are at least a particular distance outside the first polygon;
using vertex reducing logic of the one or more computing devices, causing determining, for an intermediate vertex of the second set of vertices, whether the intermediate vertex is within the particular distance of a proposed segment between two other vertices of the second set of vertices, wherein the intermediate vertex is not on the proposed segment;
using the vertex reducing logic, causing removing the intermediate vertex from the second set of vertices in response to determining that the intermediate vertex is within the particular distance of the proposed segment;
on one or more non-transitory computer-readable storage media, storing the resulting polygon in association with the first polygon, wherein the resulting polygon has fewer vertices than the first polygon.
7 Assignments
0 Petitions
Accused Products
Abstract
Processes, machines, and computer-readable media are provided for expanding and simplifying a polygon or reducing and simplifying a polygon. Polygon expanding or reducing logic receives information that represents a polygon having a set of vertices. The polygon expanding or reducing logic determines another polygon having another set of vertices, such that the other polygon encompasses or is encompassed by the polygon, by determining, for each vertex of the set of vertices, a new set of vertices that are derived from the vertex and are at least a particular distance outside or inside the polygon. The vertex reducing logic determines whether an intermediate vertex is within the particular distance of a proposed segment between two other vertices of the other set of vertices, even though the intermediate vertex is not on the proposed segment, and, if so, removing the intermediate vertex from the other set of vertices.
-
Citations
30 Claims
-
1. A process comprising:
-
receiving, by one or more computing devices, first data representing a first polygon having a first set of vertices; generating a resulting polygon at least in part by; using polygon expanding logic of the one or more computing devices, causing determining a second polygon having a second set of vertices, such that the second polygon encompasses the first polygon, by determining, for each particular vertex in the first set of vertices, one or more new vertices that are determined from that particular vertex and are at least a particular distance outside the first polygon; using vertex reducing logic of the one or more computing devices, causing determining, for an intermediate vertex of the second set of vertices, whether the intermediate vertex is within the particular distance of a proposed segment between two other vertices of the second set of vertices, wherein the intermediate vertex is not on the proposed segment; using the vertex reducing logic, causing removing the intermediate vertex from the second set of vertices in response to determining that the intermediate vertex is within the particular distance of the proposed segment; on one or more non-transitory computer-readable storage media, storing the resulting polygon in association with the first polygon, wherein the resulting polygon has fewer vertices than the first polygon. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform:
-
receiving, by one or more computing devices, first data representing a first polygon having a first set of vertices; generating a resulting polygon at least in part by; using polygon expanding logic of the one or more computing devices, causing determining a second polygon having a second set of vertices, such that the second polygon encompasses the first polygon, by determining, for each particular vertex in the first set of vertices, one or more new vertices that are determined from that particular vertex and are at least a particular distance outside the first polygon; using vertex reducing logic of the one or more computing devices, causing determining, for an intermediate vertex of the second set of vertices, whether the intermediate vertex is within the particular distance of a proposed segment between two other vertices of the second set of vertices, wherein the intermediate vertex is not on the proposed segment; using the vertex reducing logic, causing removing the intermediate vertex from the second set of vertices in response to determining that the intermediate vertex is within the particular distance of the proposed segment; on one or more non-transitory computer-readable storage media, storing the resulting polygon in association with the first polygon, wherein the resulting polygon has fewer vertices than the first polygon. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)
-
Specification