Line/Polygon Classification: A Study of the Complexity of Geometric Computation

Authors:
R. B. Tilove
Affiliations:
University of Rochester
Venue:
IEEE Computer Graphics and Applications
Year:
1981

Citing 0
Cited 1

An O(log N) parallel time exact hidden-line algorithm

EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware

Quantified Score

Hi-index	0.01

Visualization

Abstract

Illuminating the techniques of computational geometry, an analysis of two LPC algorithms compares their efficiency for handling polygon-clipping problems.