Lance, Suresh, and Sariel all point to the list of accepted SODA papers. Here, for your edification and amazement, is the subset of comptuational geometry papers on this list, in alphabetical order by author. I'm sure this list is neither complete nor exclusive; in several cases, I made an educated guess from the title and list of authors.

And yes, I am classifying metric embedding results as computational geometry, despite their criminal near-total absense at SOCG. Metrics are geometry, almost by definition.

- The Hunting of the Bump: On Maximizing Statistical Discrepancy

Deepak Agarwal and Jeff Phillips and Suresh Venkatasubramanian - Coresets for Approximating the Extent of Shallow Levels

Pankaj K. Agarwal and Sariel Har-Peled and Hai Yu - On the Number of Plane Graphs

Oswin Aichholzer and Thomas Hackl and Clemens Huemer and Ferran Hurtado and Hannes Krasser and Birgit Vogtenhuber - Local versus Global Properties of Metric Spaces

Sanjeev Arora and Laszlo Lovasz and Ilan Newman and Yuval Rabani and Santosh Vempala - Finding the Depth Order of Fat Objects

Mark de Berg and Chris Gray - Simultaneous Diagonal Flips in Plane Triangulations

Prosenjit Bose and Jurek Czyzowicz and Zhicheng Gao and Pat Morin and David R. Wood - Spanners for Doubling Metrics with Small Hop Diameter

T-H. Hubert Chan and Anupam Gupta - A Dynamic Data Structure for 3-d Convex Hulls and 2-d Nearest Neighbor Queries

Timothy M. Chan - The Space Complexity of Pass-Efficient Algorithms for Clustering Census Data

Kevin L. Chang and Ravi Kannan - On k-Median Clustering in High Dimensions

Ke Chen - Anisotropic Surface Meshing

Siu-Wing Cheng and Tamal K. Dey and Edgar A. Ramos and Rephael Wenger - Tightening Non-simple Paths and Cycles on Surfaces

Éric Colin de Verdière and Jeff Erickson - An algorithmic Friedman-Pippenger theorem on tree embeddings and applications to routing

Domingos Dellamonica Jr. and Yoshiharu Kohayakawa - Matrix Approximation and Projective Clustering via Volume Sampling

Amit Deshpande and Luis Rademacher and Santosh Vempala and Grant Wang - Analysis of Incomplete Data and an Inner-Dimension Helly Theorem

Jie Gao and Michael Langberg and Leonard J. Schulman - Linear programming and unique sink orientations

Bernd Gärtner and Ingo Schurr - Correlation Clustering with a Fixed Number of Clusters

Ioannis Giotis and Venkatesan Guruswami - Finding Large Sticks and Potatoes in Polygons

Olaf Hall-Holt and Matthew Katz and Piyush Kumar and Joseph S. B. Mitchell and Arik Sityon - An asymptotic approximation algorithm for 3D-strip packing

Klaus Jansen and Roberto Solis-Oba - Searching in dynamic three-dimensional convex hulls and planar Voronoi diagrams, and approximate range counting

Haim Kaplan and Micha Sharir - Max-Tolerance Graphs as Intersecton Graphs: Cliques, Cycles, and Recognition

Michael Kaufmann and Jan Kratochvil and Katharina Lehmann and Amarendran Subramanian - Generating all vertices of a polyhedron is hard.

Khachiyan, Boros, Borys, Elbassioni, Gurvich - A Near-Tight Approximation Lower Bound and Algorithm for the Kidnapped Robot Problem

Sven Koenig and Apurva Mudgal and Craig Tovey - Improved lower bounds for embeddings into L_1

Robert Krautghamer and Yuval Rabani - Deterministic boundary recognition and topology extraction for large sensor networks

A. Kroeller and S.P. Fekete and D. Pfisterer and S. Fischer - Trees, Markov convexity, and finding near-optimal embeddings

James R. Lee and Assaf Naor and Yuval Peres - Morphing Orthogonal Planar Graph Drawings

Anna Lubiw and Mark Petrick and Michael J. Spriggs - Metric Cotype

Manor Mendel and Assaf Naor - Entropy based Nearest Neighbor Search in High Dimensions

Rina Panigrahy - On the Number of Crossing-Free Matchings, (Cycles, and Partitions)

Micha Sharir and Emo Welzl - On The Chromatic Number of Some Geometric Hypergraphs

Shakhar Smorodinsky - A Semidefinite Programming Approach to Tensegrity Theory and Realizability of Graphs

Anthony Man-Cho So and Yinyu Ye

this one sounds rather geometric to me:

Morphing Orthogonal Planar Graph Drawings

Anna Lubiw and Mark Petrick and Michael J. Spriggs

Posted by: anonymous | September 12, 2005 at 01:01 PM

btw, congrats, on the Mr. Octagon paper :)

Posted by: Suresh | September 12, 2005 at 01:41 PM

Oops! Thanks for catching that, whoever you are.

Posted by: JeffE | September 12, 2005 at 01:58 PM

That is an impressive list not far in size from that of SoCG (32 vs 41). Who knows, at this rate SODA might soon become the preeminent geometry conference :-)

Posted by: | September 12, 2005 at 07:59 PM

That's entirely possible. Most of the metric space embedding papers wouldn't even be SUBMITTED to SoCG. (One of these days Sanjeev Arora will realize that he's a computational geometer.)

Posted by: JeffE | September 13, 2005 at 10:04 AM

And earlier this blog was complaining there were no geometers

on the committee. Perhaps ingornace is a good thing.

Posted by: | September 14, 2005 at 01:03 PM

Hi Jeff,

The CFP of SoCG 2006 was announced. See

http://socg06.cs.arizona.edu/socg06/cfp.html

Posted by: Passerby | September 15, 2005 at 07:01 AM