A clipping method when rasterizing complex objects

Authors

  • S.A. Karpukhin

Keywords:

rasterization
clipping
means of computer graphics PDF (in Russian) (125KB) PDF. zip (in Russian) (104KB)

Abstract

A new one-point method of clipping when rasterizing complex objects is proposed. An estimate of the number of required operations in comparison with other methods is given. It is shown that this new method provides a significant performance gain when solving the computational geometry problems by means of computer graphics.

New computational technologies

Downloads

Published

2013-09-25

Issue

Vol. 14 (2013): Issue 3.

Section

Section 2. Programming

Author Biography

S.A. Karpukhin

Lomonosov Moscow State University,
Faculty of Mechanics and Mathematics
• PhD Student

References

  1. Иванов Д., Карпов А., Кузьмин Е. и др. Алгоритмические основы растровой машинной графики. М.: БИНОМ, 2007.
  2. Denny M. Solving geometric optimization problems using graphics hardware // Computer Graphics Forum. 2003. 22, N 3. 441-451.
  3. Hoff K.E., Keyser J., Lin M., et al. Fast computation of generalized Voronoi diagrams using graphics hardware // Proc. of the 26th Annual Conference on Computer Graphics and Interactive Techniques. New York: ACM Press, 1999. 277-286.
  4. Pitteway M.L. V. Algorithm for drawing ellipses or hyperbolae with a digital plotter // The Computer Journal. 1967. 10. 282-289.
  5. Rong G., Tan T.-S., Cao T.-T., Stephanus I. Computing two-dimensional Delaunay triangulation using graphics hardware // Proc. of the 2008 Symposium on Interactive 3D Graphics and Games. New York: ACM Press, 2008. 89-97.
  6. Sproull R., Sutherland I. A clipping divider // Proc. of the Fall Joint Computer Conference. Washington: Thompson Books, 1968. 765-775.
  7. Srinivasan R.V. A fast circle clipping algorithm // Graphics Gems III / Ed. by D. Kirk. San Diego: Academic, 1992. 182-187.