Path: utzoo!mnetor!uunet!husc6!rutgers!ucla-cs!trainor
From: trainor@CS.UCLA.EDU
Newsgroups: comp.graphics
Subject: computational geometry question
Message-ID: <9464@shemp.CS.UCLA.EDU>
Date: 15 Feb 88 21:48:09 GMT
Sender: news@CS.UCLA.EDU
Reply-To: trainor@CS.UCLA.EDU ()
Organization: UCLA Computer Science Department
Lines: 16


I have question about a statement in Preparata & Shamos' book about the
DCEL data structure, page 16:

    If the graph has N vertices and F faces, we can assume we have two
    arrays HV[1:N] and HF[1:F] of headers of the vertex and face lists:
    these arrays can be filled by a scan of arrays V1 and F1 in time O(N).

Shouldn't that last part read "scan of arrays V1, V2, F1, and F2"?
Anything else seems to make some assumption about edge orientations.

    douglas trainor

I want to thank those of you that responded to my computational geometry
query last year -- about course offerings at your university.  UCLA has
since establisted a graduate seminar (cs219) in computational geometry.