Procedure to publish a technical report.

1. When your report is finished contact me (ami@gmu.edu) for a TR number.

2. I will assign you one provisionally.

3. You then incorporate it into the report and send me two items:

	1. The pdf file of the report.

	2. A bibtex entry for your paper (see below).

4. If I don't get these two items within 48 hours, I will assume that you changed your mind about publishing this report at this time (e.g., you discovered a bug in your proof), and I will retract the number I gave you (I might then assign it to the next request). This retraction is intended to prevent gaps in the sequence of TR numbers, when promised reports are not delivered.

5. If I get these two items within 48 hours, I will publish your report as soon as I can.

===

The bibtex entry should follow this example (i.e., edit it to reflect your submission).

@techreport{GMU-CS-TR-2010-12,
  author = 	{Evan Behar, Jyh-Ming Lien},
  title =	{Dynamic Minkowski Sum of Convex Shapes},
  institution =	{Department of Computer Science, George Mason University},
  address =	{4400 University Drive MSN 4A5, Fairfax, VA 22030-4444 USA},
  year =	{2010},
  howpublished ={Available at http://cs.gmu.edu},
  number =	{GMU-CS-TR-2011-12},
  abstract =	{
  Computing the Minkowski sums of rotating objects has always
  been done naively by re-computing every Minkowski sum from
  scratch. The correspondences between the Minkowski sums are
  typically completely ignored. We propose a method, called
  DYMSUM, that can efficiently update the Minkowski sums of
  rotating convex polyhedra. We show that DYMSUM is
  significantly more efficient than the traditional approach,
  in particular when the size of the input polyhedra are large
  and when the rotation is small between frames. From our
  experimental results, we show that the computation time of
  the proposed method grows slowly with respect to the size of
  the input comparing to the naive approach.}
}

===