Demo Data from EDBT 2026 / reviewers in the wild / expert
M. Rarick
dblp:66/5096
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Rendering · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering › rasterization
polygon filling |
0.0 | 1 | 1983 | An Algorithm for Filling Regions on Graphics Display Devices · ACM Trans. Graph. 1983 |
Rendering
rasterization |
0.0 | 1 | 1983 | An Algorithm for Filling Regions on Graphics Display Devices · ACM Trans. Graph. 1983 |
Methods — techniques the papers use, named apart from their topics
fill algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | An Algorithm for Filling Regions on Graphics Display DevicesabstractRegions onThe display of shaded polygons, either by lines, crosshatching, dots, or continuous color patterns is a task frequently used in many application areas of computer graphics.In applications such as the production of hidden surface images, cartography, and animation, algorithm efficiency is important.In this paper, a new fill algorithm is presented which will fill an arbitrary polygon in the plane.-'Nosorting is required and the algorithm is suitable for microprocessor or hardware implementation. Jeffrey M. Lane, R. Magedson, M. Rarick |
ACM Trans. Graph. | 3 |