Article View: comp.graphics.research
Article #27Re: Clipping point generation
From: Joseph O'Rourke
Date: Wed, 20 Jan 1993 23:17
Date: Wed, 20 Jan 1993 23:17
20 lines
1540 bytes
1540 bytes
In article <11757@sun13.scri.fsu.edu> danielbt@cs.curtin.edu.au (Brett Daniel) writes: >erich@eye.com (Eric Haines) writes: > >>Assume you're clipping a 3D polygon to the six frustum clipping planes. The >>question I have is, given a polygon with n vertices, what is the maximum >>number of vertices which can exist after clipping? > >Can you describe a convex polygon that intersects all six clipping planes? >I can only think of a 3D convex polygon intersecting a maximum of four planes. Certainly one polygon can intersect all six planes. Imagine a very large triangle slicing through a cube so that the triangle is orthogonal to a long diagonal of the cube. Then the intersection is a hexagon, with one edge on each of the six faces. In this instance, we go from n = 3 to n+3 = 6. -- Moderated by SCRI Vis <> Submissions to: graphics@scri1.scri.fsu.edu Guy, John R. Murray <> Administrivia to: graphics-request@scri1.scri.fsu.edu
Technical Details
Message-ID:
<11780@sun13.scri.fsu.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!gatech!mailer.cc.fsu.edu!sun13!sophia.smith.eduReferences:
<11717@sun13.scri.fsu.edu> <11757@sun13.scri.fsu.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!mailer.cc.fsu.edu!sun13!sophia.smith.edu From: orourke@sophia.smith.edu (Joseph O'Rourke) Newsgroups: comp.graphics.research Subject: Re: Clipping point generation Message-ID: <11780@sun13.scri.fsu.edu> Date: 20 Jan 93 23:17:26 GMT References: <11717@sun13.scri.fsu.edu> <11757@sun13.scri.fsu.edu> Sender: news@sun13.scri.fsu.edu Organization: Smith College, Northampton, MA, US Lines: 20 Approved: murray@vs6.scri.fsu.edu X-Submissions-To: graphics@scri1.scri.fsu.edu X-Administrivia-To: graphics-request@scri1.scri.fsu.edu