Abstract
Three dimensional clipping is a critical component of the 3D graphics pipeline. A new 3D clipping algorithm is presented in this paper. An efficient 2D clipping routine reported earlier has been used as a submodule. This algorithm uses a new classification scheme for lines of all possible orientations with respect to a rectangular parallelopiped view volume. The performance of this algorithm has been evaluated using exact arithmetic operation counts. It is shown that our algorithm requires less arithmetic operations than the Cyrus-Beck 3D clipping algorithm in all cases. It is also shown that for lines that intersect the clipping volume, our algorithm performs better than the Liang-Barsky 3D clipping algorithm.
| Original language | English |
|---|---|
| Title of host publication | IFIP Transactions B |
| Subtitle of host publication | Computer Applications in Technology |
| Publisher | Elsevier |
| Pages | 225-232 |
| Number of pages | 8 |
| Edition | B-9 |
| ISBN (Print) | 0444815643 |
| Publication status | Published - 1993 |
| Externally published | Yes |
| Event | IFIP TC5/WG5.2/WG5.10 CSI International Conference on Computer Graphics, ICCG 1993 - Bombay, India Duration: 24 Feb 1993 → 26 Feb 1993 |
Conference
| Conference | IFIP TC5/WG5.2/WG5.10 CSI International Conference on Computer Graphics, ICCG 1993 |
|---|---|
| Abbreviated title | ICCG 1993 |
| Country/Territory | India |
| City | Bombay |
| Period | 24/02/93 → 26/02/93 |