Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jeffrey M. Lane

dblp:48/899 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1983
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
2 papers
Rendering · 62% Geometric modeling and processing · 38%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › rasterization
polygon filling
0.011983
An Algorithm for Filling Regions on Graphics Display Devices · ACM Trans. Graph. 1983
Rendering
rasterization
0.011983
An Algorithm for Filling Regions on Graphics Display Devices · ACM Trans. Graph. 1983
Geometric modeling and processing › shape modeling › parametric modeling
parametric surfaces
0.011980
A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces · IEEE Trans. Pattern Anal. Mach. Intell. 1980

Methods — techniques the papers use, named apart from their topics

fill algorithm · 0.0parametric piecewise polynomial evaluation · 0.0
YearPublicationVenuePosition
1983 An Algorithm for Filling Regions on Graphics Display Devices
abstract
Regions 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.1
1980 A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
abstract
Two algorithms for parametric piecewise polynomial evaluation and generation are described. The mathematical development of these algorithms is shown to generalize to new algorithms for obtaining curve and surface intersections and for the computer display of parametric curves and surfaces.
Jeffrey M. Lane, Richard F. Riesenfeld
IEEE Trans. Pattern Anal. Mach. Intell.1