Sharma, NC and Monohar, S (1993) Three Dimensional Line-Clipping by Systematic Enumeration. In: IFIP TC5/WG5.2/WG5.10 CSI International Conference on Computer Graphics - ICCG3, FEB 24-26, 1993, BOMBAY, INDIA.Full text not available from this repository.
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||31 Jan 2011 07:25|
|Last Modified:||31 Jan 2011 07:25|
Actions (login required)