Table of Contents

• New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment ModelWenqi Ju, Jun Luo. 1-4 [doi]
• Optimal Empty Pseudo-Triangles in a Point SetHee-Kap Ahn, Sang Won Bae, Iris Reinbacher. 5-8 [doi]
• Clarkson s Algorithm for Violator SpacesYves Brise, Bernd Gärtner. 9-12 [doi]
• On Graph Thickness, Geometric Thickness, and Separator TheoremsChristian A. Duncan. 13-16 [doi]
• Colored Simultaneous Geometric Embeddings and Universal PointsetsAlejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov. 17-20 [doi]
• On Directed Graphs with an Upward Straight-lineCarla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta. 21-24 [doi]
• Computational Geometry of Contour ExtractionPedro J. Tejada, Xiaojun Qi, Minghui Jiang. 25-28 [doi]
• Enumeration of Polyominoes for p4 TilingTakashi Horiyama, Masato Samejima. 29-32 [doi]
• Packing 2×2 unit squares into grid polygons is NP-completeDania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme. 33-36 [doi]
• Symmetry Restoration by StretchingMichael M. Kazhdan, Nina Amenta, Shengyin Gu, David F. Wiley, Bernd Hamann. 37-40 [doi]
• On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagonJürgen Bokowski, Vincent Pilaud. 41-44 [doi]
• Generalized jewels and the point placement problemMd. Shafiul Alam, Asish Mukhopadhyay, Animesh Sarker. 45-48 [doi]
• Generalizations of Interval GraphsPavol Hell. 49 [doi]
• A Comparison of Two Fully-Dynamic Delaunay Triangulation MethodsMichael D. Adams. 51-54 [doi]
• Minimizing Slope Change in Imprecise 1.5D terrainsChris Gray, Maarten Löffler, Rodrigo I. Silveira. 55-58 [doi]
• Slope Preserving Terrain Simplification - An Experimental StudyAhmad Biniaz. 59-62 [doi]
• Rigid Components of Random GraphsLouis Theran. 63-66 [doi]
• Angular rigidity in 3D: combinatorial characterizations and algorithmsAudrey Lee-St. John, Ileana Streinu. 67-70 [doi]
• Nucleation-free 3D rigidityJialong Cheng, Meera Sitharam, Ileana Streinu. 71-74 [doi]
• The Centervertex Theorem for Wedge DepthGary L. Miller, Todd Phillips, Donald Sheehy. 79-82 [doi]
• Streaming 1-Center with Outliers in High DimensionsHamid Zarrabi-Zadeh, Asish Mukhopadhyay. 83-86 [doi]
• Constant-Working-Space Algorithms for Geometric ProblemsTetsuo Asano, Günter Rote. 87-90 [doi]
• Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer LatticeDavid Flores-Peñaloza, Francisco Javier Zaragoza Martínez. 91-94 [doi]
• Planar Packing of Diameter-Four TreesFabrizio Frati. 95-98 [doi]
• Every Large Point Set contains Many Collinear Points or an Empty PentagonZachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood. 99-102 [doi]
• On the Height of a HomotopyErin W. Chambers, David Letscher. 103-106 [doi]
• Computing Fréchet Distance with Speed LimitsAnil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz. 107-110 [doi]
• General minisum circle locationMark Körner, Jack Brimberg, Henrik Juel, Anita Schöbel. 111-114 [doi]
• Approximating Maximum Flow in Polygonal Domains using SpannersJoondong Kim, Joseph S. B. Mitchell, Jingyu Zou. 115-118 [doi]
• Bold Graph DrawingsMarc J. van Kreveld. 119-122 [doi]
• Defining and computing accessibility radiusVishal Verma, Jack Snoeyink. 123-126 [doi]
• Intrinsic Multiscale GeometryLeonidas J. Guibas. 127 [doi]
• Data Structures for Reporting Extension Violations in a Query RangeAnanda Swarup Das, Prosenjit Gupta, Kannan Srinathan. 129-132 [doi]
• Data Structures for Range Aggregation by CategoriesSaladi Rahul, Prosenjit Gupta, K. S. Rajan. 133-136 [doi]
• How to make a picturesque mazeYoshio Okamoto, Ryuhei Uehara. 137-140 [doi]
• An Inequality on the Edge Lengths of Triangular MeshesMinghui Jiang. 141-144 [doi]
• Integer Point Sets Minimizing Average Pairwise l::1:: Distance: What is the Optimal Shape of a Town?Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke. 145-148 [doi]
• Wireless Localization with Vertex Guards is NP-hardTobias Christ, Michael Hoffmann. 149-152 [doi]
• Inapproximability of the Perimeter Defense ProblemEvangelos Kranakis, Danny Krizanc, Lata Narayanan, Kun Xu. 153-156 [doi]
• The Bichromatic Rectangle Problem in High DimensionsJonathan Backer, J. Mark Keil. 157-160 [doi]
• On the Dilation of Delaunay Triangulations of Points in Convex PositionShiliang Cui, Iyad A. Kanj, Ge Xia. 161-164 [doi]
• The spanning ratio of the Delaunay triangulation is greater than pi/2Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma. 165-167 [doi]
• Relaxed Gabriel GraphsProsenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh. 169-172 [doi]
• Teaching Computational Geometry, IIRaimund Seidel. 173 [doi]