The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
This technique insures that points defining a digitized complex polygon are listed in the proper order.
English (United States)
This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately
56% of the total text.
Page 1 of 2
Correcting The Direction Of Points On Complex Polygons
This technique insures that points defining a digitized complex polygon are
listed in the proper order.
A complex polygon is a figure which consists of more than one closed loop.
For example, the polygon shown in Fig. 1 consists of loops A, B and C. Where
one loop is enclosed by, or encloses, another loop or several other loops, it is
important that the digitized points defining each loop be listed in an order
opposite to the order in which the points defining the next adjacent loop are
listed. For instance, if the points defining loop A are listed in the
counterclockwise order 1, 2, 3, 4, then the points defining loop B should be listed
in the clockwise order 5, 7, 6. This rule is followed in order that the interior of a
complex polygon can be easily computed for automatic shading.
Loop C neither encloses nor is enclosed by another loop. However, if loop B
is intended to represent a shadow cast by object C within the boundary of object
A, then the points 8, 9 and 10 defining loop C are listed in the same rotational
sense as the points defining loop A.
Before the points defining the loops in a complex polygon can be properly
ordered, it is necessary to count the number of loops enclosing a particular loop.
This count is termed the "quantitative embediment" (QE). Thus, in Fig. 1, loop
A has QE = 0; loop B has QE = 1; and loop C has QE = 0.
To facilitate this determination, a method has been devised for ascerta...