Creating entries

What goes in? Papers relevant to computational geometry, which for us means the study of the computational complexity of well-defined geometric problems. Thus we are talking algorithms, data structures, analysis of time and storage, lower and upper bounds, but also geometric objects, geometric operations, and combinatorial complexity of geometric structures. We interpret relevance in a rather broad sense, although we prefer that references from cognate areas (such as discrete geometry, solid modeling, image processing, computer graphics, and robotics) emphasize books or survey articles rather than individual papers.

In the end, your judgement as a working computational geometer decides what is relevant and worth inclusion. (A pragmatic test: have you cited or would you cite the item in your own papers?)

Future maintenance is easiest if you include only papers which are "stable", i.e., published and openly available at least in the form of a numbered techreport, and preferably in a conference proceedings. However, it is okay to include preprints too. If the paper is slated to appear somewhere else, that information can usefully annotate the entry for an existing appearance.

Mary-Claire van Leunen's book A Handbook for Scholars (Knopf, New York, 1979) encourages high standards in bibliographic scholarship, particularly in its insistence that nothing short of the original title page can be trusted:

"To write a reference, you must have the work you're referring to in front of you.... The temptation to write a reference without having the work before you will be powerful. Resist it. A vague recollection is worthless; a vivid recollection is probably the result of your imagination -- ingenious, no doubt, but of little use to your reader. Don't rely on your memory.... If you must not rely on your own memory, even less should you rely on someone else's. If your only access to a reference is through a secondary source, then you must refer to the secondary source as well as the primary one."
We value the accuracy and relevance of your contributions to the bibliography more highly than their sheer volume. But please bear in mind that there is a minimum overhead of at least an hour to process each diff file in the merging process, making larger updates more efficient than tiny ones. Coordinating your changes with those of other colleagues at your site before sending is greatly appreciated.

There is always room for new ideas on how to capture data with greatest accuracy, best efficiency, and least overlap, but at present the following approach seems to work well:

  1. Use the bibliography as a bibtex database when typesetting references for your own papers, so that adding entries and making corrections can happen as a natural side effect of your own work.
  2. During that process, you will likely wind up referring to papers from some conference or journal year which isn't known to have been covered by the bibliography (see the list below). It would be very helpful if you took the time for at least one such paper to check through the whole volume and ensure that all relevant geometry papers have been incorporated in the bibliography. (This doesn't take so long as you might think: by keeping an entry template with repetitive details ready in your editor, within an hour you can enter a full conference of about 50 papers.)
  3. Please look carefully at entries for papers written by you, or by people at your institution, to ensure their correctness. No one else can do this more accurately or more efficiently.
  4. If you are caught up with current events and have time to spare, you can work on something from our open problems list; or you can check back through unexamined years of a journal or conference to ensure that all relevant papers are included, correct, and keywordized.
To help with checking coverage, here are data for some conferences and journals which are, or have been, popular in the bibliography, listing a rough estimate of how many relevant articles they publish per year, and for what years bibliography coverage has been verified. Please mention any new territory you have covered when you send your update. 
     3  ACM Trans. Graph.
          82-91: freimer
    20  Algorithmica
          86-91: freimer
     8  Algorithms Review (EC Project ALCOR)
          90-: devillers
     3  Combinatorica
          81-91: freimer
     4  Commun. ACM
    25  Comput. Geom. Theory Appl. (CGTA)
          91-95: devillers
     2  Comput. Graph. (SIGGRAPH)
     2  Comput. Vision Graph. Image Process.
    30  Discrete Comput. Geom. (DCG)
          86-91: freimer
     3  IEEE Comput. Graph. Appl.
    15  Inform. Process. Lett. (IPL)
    25  Internat. J. Comput. Geom. Appl. (IJCGA)
          91-95: devillers
     4  J. ACM
          80?-91: freimer
     6  J. Algorithms
          80-91: freimer
     6  J. Comput. Syst. Sci.
          80?-91: freimer
     3  Proc. Nth ACM Sympos. Parallel Algorithms Arch. (SPAA)
    20  Proc. Nth ACM-SIAM Sympos. Discrete Algorithms (SODA)
          90-91: jones; 92: freimer; 93: mitchell∣ 96: mitchell
     9  Proc. Nth Allerton Conf. Commun. Control Comput.
    40  Proc. Nth Annu. ACM Sympos. Comput. Geom. (SCG)
          85-88: edelsbrunner; 89-90: orourke; 91: agarwal; 92: freimer;
	  93-94: jones; 95: mitchell; 96: efrat
     8  Proc. Nth Annu. ACM Sympos. Theory Comput. (STOC)
          91: agarwal; STOC/FOCS biblio: freimer; 92: freimer∣
          93-94: mitchell; 95: smid
     ?  Proc. Nth Annu. European Sympos. Algorithms (ESA)
	  93: milone+mitchell
     8  Proc. Nth Annu. IEEE Sympos. Found. Comput. Sci. (FOCS)
          90: agarwal; 91: jones; 92: freimer; 93: milone+mitchell;
	  94: smid; 95: mitchell
    12  Proc. Nth Annu. Internat. Sympos. Algorithms Comput. (ISAAC) [LNCS]
          90-91: smid
    70  Proc. Nth Canad. Conf. Comput. Geom. (CCCG)
          89-92: jones; 93: milone+mitchell; 94-95: jones; 96: mitchell
	  97: jones
     4  Proc. Nth Conf. Found. Softw. Tech. Theoret. Comput. Sci. (FSTTCS) [LNCS]
    15  Proc. Nth European Workshop Comput. Geom. (CG'yy) [LNCS?]
	  93: milone+mitchell
     5  Proc. Nth Internat. Colloq. Automat. Lang. Program. (ICALP) [LNCS]
     ?  Proc. Nth Internat. Sympos. Math. Found. Comput. Sci. (MFCS) [LNCS]
    25  Proc. Nth Internat. Workshop Comput. Geom. (CG'yy) [LNCS]
	  91: rote
     4  Proc. Nth Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (WG'yy) [LNCS?]
	  93: milone+mitchell
    15  Proc. Nth Scand. Workshop Algorithm Theory (SWAT) [LNCS]
          88: smid; 90: freimer; 92: freimer&smid
     5  Proc. Nth Sympos. Theoret. Aspects Comput. Sci. (STACS) [LNCS]
          89-90: schwarzkopf; 92-93: smid
    15  Proc. Nth Workshop Algorithms Data Struct. (WADS) [LNCS]
          89: jones; 91: agarwal; 93: milone+mitchell; 95: mitchell
     6  SIAM J. Comput.
          80?-90: freimer; 91: mitchell
     2  SIGACT News
     2  Theoret. Comput. Sci.
     6  Visual Comput.
          85-91: jones; 95: klosowski