A fixed grid curve representation for efficient processing
Proceedings of the 5th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1978, Page: 64-69
1978
- 1Usage
- 3Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage1
- Abstract Views1
- Captures3
- Readers3
Conference Paper Description
A compact form of representation for curves and regional boundaries is described. A curve is approximated by a polygonal line where each side Joins a grid point to one of its eight nearest neighbors (as is done in the commonly used chain-encoded representation). Vertex number (2k + I)2 m is defined relative to vertex number k2 m+l. The resulting representation requires about 5 bits of storage per vertex, irrespective of the total length of the curve. Sections of a curve may be collectively examined. Typically, that part of the curve between vertices number k2 TM and (k + i)2 TM, for some k and m, is considered. Given the locations of the endpoints of a section and the number of sides in the section, it is easy to compute a bounding rectangle which must completely contain the section. Often, this is all the information we need to know about a section. For example, two sections cannot intersect if their bounding rectangles do not overlap. When necessary, a section can be easily divided into two smaller sections, each of which can be examined in turn. This process may be continued down to single sided sections if necessary. Under favorable circumstances, for an n sided approximation to a closed curve, the time required to determine if a point is inside the curve is independent of n. The intersection of n sided approximations to two curves can usually be found in 0(In n) time.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85053183988&origin=inward; http://dx.doi.org/10.1145/800248.807372; https://dl.acm.org/doi/10.1145/800248.807372; https://digitalcommons.mtu.edu/michigantech-p/12607; https://digitalcommons.mtu.edu/cgi/viewcontent.cgi?article=31909&context=michigantech-p; https://dx.doi.org/10.1145/800248.807372
Association for Computing Machinery (ACM)
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know