Table of Contents

• On the number of congruent simplices in a pointPankaj K. Agarwal, Micha Sharir. 1-9 [doi]
• Enumerating order types for small sets with applicationsOswin Aichholzer, Franz Aurenhammer, Hannes Krasser. 11-18 [doi]
• The union of congruent cubes in three dimensionsJános Pach, Ido Safruti, Micha Sharir. 19-28 [doi]
• On the distinct distances determined by a planar point setJózsef Solymosi, Csaba D. Tóth. 29-32 [doi]
• Schematization of road networksSergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk. 33-39 [doi]
• Simplifying a polygonal subdivision while keeping it simpleRegina Estkowski, Joseph S. B. Mitchell. 40-49 [doi]
• Hardware-assisted view-dependent map simplificationNabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian. 50-59 [doi]
• Efficient perspective-accurate silhouette computation and applicationsMihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar. 60-68 [doi]
• Sphere packings and generativeThomas C. Hales. 69 [doi]
• Hierarchical morse complexes for piecewise linear 2-manifoldsHerbert Edelsbrunner, John Harer, Afra Zomorodian. 70-79 [doi]
• Computing a canonical polygonal schema of an orientable triangulated surfaceFrancis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust. 80-89 [doi]
• Area-preserving piecewise affine mappingsAlan Saalfeld. 90-95 [doi]
• Nice point sets can have nasty Delaunay triangulationsJeff Erickson. 96-105 [doi]
• Sink-insertion for mesh improvementHerbert Edelsbrunner, Damrong Guoy. 115-123 [doi]
• Box-trees and R-trees with near-optimal query timePankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. 124-133 [doi]
• A segment-tree based kinetic BSPMark de Berg, João Comba, Leonidas J. Guibas. 134-140 [doi]
• Binary space partitions for axis-parallel segments, rectangles, and hyperrectanglesAdrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir. 141-150 [doi]
• A note on binary plane partitionsCsaba D. Tóth. 151-156 [doi]
• Exact L::infty:: Nearest Neighbor Search in High DimensionsHelmut Alt, Laura Heinrich-Litan. 157-163 [doi]
• Farthest neighbors and center points in the presence of rectangular obstaclesBoaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell. 164-171 [doi]
• A fully dynamic algorithm for planarTimothy M. Chan. 172-176 [doi]
• A practical approach for computing the diameter of a point setSariel Har-Peled. 177-186 [doi]
• Protein geometry as a function of timeFrederic M. Richards. 187 [doi]
• Discrete mobile centersJie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. 188-196 [doi]
• Algorithms for congruent sphere packing and applicationsDanny Z. Chen, Xiaobo Hu, Yingping Huang, Yifan Li, Jinhui Xu. 212-221 [doi]
• Polymake: an approach to modular software design in computational geometryEwgenij Gawrilow, Michael Joswig. 222-231 [doi]
• A randomized art-gallery algorithm for sensor placementHéctor H. González-Baños. 232-240 [doi]
• Notes on computing peaks in k-levels and parametric spanning treesNaoki Katoh, Takeshi Tokuyama. 241-248 [doi]
• A tight bound on the number of geometric permutations of convex fat objects in R:::d:::Matthew J. Katz, Kasturi R. Varadarajan. 249-251 [doi]
• The Clarkson-Shor technique revisited and extendedMicha Sharir. 252-256 [doi]
• Detecting undersampling in surface reconstructionTamal K. Dey, Joachim Giesen. 257-263 [doi]
• Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!Nicola Geismann, Michael Hemmer, Elmar Schömer. 264-273 [doi]
• PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computationShankar Krishnan, Mark Foskey, Tim Culver, John Keyser, Dinesh Manocha. 274-283 [doi]
• Computational geometry for sculptureGeorge W. Hart. 284-287 [doi]
• Different bounds on the different Betti numbers of semi-algebraic setsSaugata Basu. 288-292 [doi]
• Efficient and small representation of line arrangements with applicationsDavid P. Dobkin, Ayellet Tal. 293-301 [doi]
• A sum of squares theorem for visibilityPierre Angelier, Michel Pocchiola. 302-311 [doi]
• Monotone paths in line arrangementRados Radoicic, Géza Tóth. 312-314 [doi]
• Balanced lines, halving triangles, and the generalized lower bound theoremMicha Sharir, Emo Welzl. 315-318 [doi]
• Small representation of line arrangementsDavid P. Dobkin, Ayellet Tal. 319-320 [doi]
• The convex hull of ellipsoidsNicola Geismann, Michael Hemmer, Elmar Schömer. 321-322 [doi]
• 2-point site Voronoi diagramsGill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin. 323-324 [doi]
• The connectivity shapes videoMartin Isenburg, Stefan Gumhold, Craig Gotsman. 325-326 [doi]
• A prototype system for visualizing time-dependent volume dataLutz Kettner, Jack Snoeyink. 327-328 [doi]