Title

Efficiently Identifying The Faces Of A Solid

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Comput. Graph.

Keywords

Computer Science; Software Engineering

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.

Journal Title

Computers & Graphics

Volume

7

Issue/Number

2

Publication Date

1-1-1983

Document Type

Article

Language

English

First Page

143

Last Page

147

WOS Identifier

WOS:A1983RZ20700004

ISSN

0097-8493

Share

COinS