List of Accepted Papers: Theory Track

• Point sets with many k-sets. Geza Toth
• Testing the congruence of d-dimensional point sets. Peter Brass and Christian Knauer.
• Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations. Jonathan Richard Shewchuk.
• An Improved bound for k-Sets in Three Dimensions. Micha Sharir, Shakhar Smorodinsky and Gabor Tardos.
• Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Timothy M. Chan.
• Origin-Embracing Distributions or A Continuous Analogue of the Upper Bound Theorem. Uli Wagner and Emo Welzl.
• Surface reconstruction simplified. Nina Amenta, Sunghee Choi, Tamal K. Dey and Naveen Leekha.
• Random Sampling in Geometric Optimization: New Insights and Applications. Bernd Gaertner and Emo Welzl.
• Cutting glass. Janos Pach and Gabor Tardos.
• Reachability by paths of bounded curvature in convex polygons. Hee-kap Ahn, Otfried Cheong, Jiri Matousek and Antoine Vigneron.
• Linear-Time Polygon Triangulation Made Easy Via Randomization. Nancy M. Amato, Michael T. Goodrich and Edgar A. Ramos.
• Kinetic Connectivity for Unit Disks. Leonidas Guibas, John Hershberger, Subhash Suri and Li Zhang.
• Exact and Efficient Unions of balls. Nina Amenta and Ravi Kolluri
• When Crossings Count - Approximating the Minimum Spanning Tree. Sariel Har-Peled and Piotr Indyk.
• Multivariate regression depth. Marshall Bern and David Eppstein.
• The 2-Center Problem with Obstacles. Dan Halperin, Micha Sharir and Ken Goldberg.
• I/O-Efficient Dynamic Planar Point Location. Lars Arge and Jan Vahrenhold.
• Kinetic Collision Detection for Simple Polygons. David Kirkpatrick, Jack Snoeyink and Bettina Speckmann.
• Point Set Labeling with Specified Positions. Srinivas Doddi, Madhav V. Marathe and Bernard M.E. Moret.
• A Helly-type theorem for hyperplane transversals to well-separated convex sets. Boris Aronov, Jacob E. Goodman, Richard Pollack and Rephael Wenger.
• On the continuous Weber and k-means problems. S.P.Fekete, J.S.B.Mitchell and K.Weinbrecht.
• Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes. Edgar A. Ramos.
• Delaunay Triangulations and Voronoi Diagrams for Riemannian. Greg Leibon and David Letscher.
• A Trace Bound for the Hereditary Discrepancy. Bernard Chazelle and Alexey Lvov.
• Linear Programming Queries Revisited. Edgar A. Ramos.