Paper Info
Title
Efficiently identifying the faces of a solid
Abstract
An algorithm is described which accepts as input the edges of a convex polyhedron, listed in any order, and which produces a consistent collection of sequences of points which describe the faces of the polyhedron as required by certain display rendering packages. The algorithm makes use of the planarity tester of Hopcroft and Tarjan and is linear, in the number of points of the polyhedron, with respect to both time and space.
Year
DOI
Venue
1983
10.1016/0097-8493(83)90004-3
COMPUTERS & GRAPHICS
DocType
Volume
Issue
Journal
7
2
ISSN
Citations 
PageRank 
0097-8493
9
0.83
References 
Authors
0
2
Name
Order
Citations
PageRank
Ronald D. Dutton119027.80
Robert C. Brigham215726.74