Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!lll-winken!uunet!mcvax!unido!uklirb!incas!mdoerr
From: mdoerr@incas.UUCP (Michael Doerr)
Newsgroups: comp.graphics
Subject: New algorithm: fast integer-only line clipping
Message-ID: <2052@incas.UUCP>
Date: 27 Apr 89 13:36:02 GMT
Organization: University of Kaiserslautern, W-Germany
Lines: 34


Last year I developed a fast 2-D integer-only line clipping algorithm that is
approximately TEN times faster than floating point based line clipping
algorithms. I have written a paper on that subject, which contains a detailed
proof of the algorithm, theoretically and empirically determined performance
charts (New Algorithm vs. Cohen-Sutherland, Liang-Barsky, Sobkow-Pospisil-Yang)
and a sketch for a parallel realization in hardware or low-level firmware.

I submitted the paper ("A New Approach to Parametric Line Clipping") to the
1989 IEEE Region 8 Student Paper Contest and was subsequently invited to the
oral presentation, which took place some weeks ago. Unfortunately (for me)
all of the seven presented papers were really good and mine wasn't among
the three winners. Thus it won't be published in the "IEEE STUDENT PAPERS".

That's why I'm now looking for a different way to make the algorithm known
to a wide audience. Any advice on the following questions would be greatly
appreciated:
1. Should I submit my paper to a computer graphics conference or should I
submit to one of the well known magazines?
2. To which magazine should I submit? ACM TOG and IEEE CG&A don't seem to
have a very fast turn around time. Or should I try one of the popular
magazines, like Dr. Dobbs Journal?
3. Concerning copyright: Is it possible (or even sensible) to post the
algorithm to comp.graphics without knowing when and where the paper will
be published?

Thanks a lot in advance, Michael.


Michael "The Turtle" Doerr			%% /-------\ %%
CS Department (FB Informatik)			  %  o   o  %
University of Kaiserslautern			-{ o   o   o }==O
D-6750 Kaiserslautern (West Germany)		  %  o   o  %
uucp: ...!uunet!unido!incas!mdoerr		%% \-------/ %%