Article View: comp.sys.sgi.misc
Article #36efficient polygon clipping
From: Raymond C Maple
Date: Mon, 21 Dec 1992 17:25
Date: Mon, 21 Dec 1992 17:25
21 lines
1091 bytes
1091 bytes
This question is not really specific to SGI, but here goes. I have an application that needs a VERY efficient polygon clipping routine. The routine coded now is a recursive 3d Sutherland-Hodgeman implementation. The application is non-graphical, and must run on machines other than an SGI, so using feedback is out. Some info: The polygons are represented by an ordered list 3d vectors: The clipping volume is always a cube, but does not have unit sides. The clipping routine gets called umpteen million times, and accounts for way too large a percentage of my cpu time. Does someone have a more efficient clipping algorithm? Thanks in advance. Raymond C. Maple WL/MNAA Computational Fluid Dynamics Section Eglin AFB, FL maple@peregrine.eglin.af.mil
Technical Details
Message-ID:
<34773@adm.brl.mil>Path:
arc1-ca.pugleaf.net!sparky!uunet!elroy.jpl.nasa.gov!sdd.hp.com!cs.utexas.edu!rutgers!cmcl2!adm!newsShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!elroy.jpl.nasa.gov!sdd.hp.com!cs.utexas.edu!rutgers!cmcl2!adm!news From: maple@peregrine.eglin.af.mil (Raymond C Maple) Newsgroups: comp.sys.sgi.misc Subject: efficient polygon clipping Message-ID: <34773@adm.brl.mil> Date: 21 Dec 92 17:25:18 GMT Sender: news@adm.brl.mil Lines: 21