Table of Contents

• A practical approach to approximating diameter of point-set in low dimensionsKumar Gaurav Bijay, Antoine Vigneron. 3-6 [doi]
• Approximate Orthogonal Range Search using Patricia TriesBradford G. Nickerson, Qingxiu Shi. 7-10 [doi]
• Faster approximation algorithms for scheduling tasks with a choice of start timesDaya Ram Gaur, Ramesh Krishnamurti. 11-14 [doi]
• Approximating the piercing number for unit-height rectanglesTimothy M. Chan, Abdullah-Al Mahmood. 15-18 [doi]
• Approximation Algorithms for Maximum Cliques in 3D Unit-Disk GraphsPeyman Afshani, Timothy M. Chan. 19-22 [doi]
• The min-# problem, a hybrid error criterion for near linear time performanceLilian Buzer. 23-26 [doi]
• Space-Efficient Algorithms for Klee s Measure ProblemEric Y. Chen, Timothy M. Chan. 27-30 [doi]
• Large k-D Simplices in the d-Dimensional CubeGill Barequet, Jonathan Naor. 31-34 [doi]
• Testing Shortcuts to Maintain Simplicity in Subdivision SimplificationCraig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine. 35-38 [doi]
• Optimal convex partitions of point sets with few inner pointsAndreas Spillner. 39-42 [doi]
• Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving PointsPankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled. 43-46 [doi]
• The Projection Median of a Set of Points in R:::2:::Stephane Durocher, David G. Kirkpatrick. 47-51 [doi]
• Small weak epsilon netsBoris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara. 52-56 [doi]
• Observations and Computations in Sylvester-Gallai TheoryJonathan Lenchner, Hervé Brönnimann. 57-60 [doi]
• Dynamic Ham-Sandwich Cuts of Convex Polygons in the PlaneTimothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung. 61-64 [doi]
• Minimum-Cost Load-Balancing PartitionsPaz Carmi, Matthew J. Katz. 65-67 [doi]
• Reverse facility location problemsSergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura. 68-71 [doi]
• Approximating Radio MapsIris Ashkenazi, Boaz Ben-Moshe, Jihad El-Sana. 72-75 [doi]
• Collection depot location problem in the planeRobert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember. 76-79 [doi]
• Computing the Widest Empty BoomerangBoaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi. 80-83 [doi]
• A New Approach for Boundary Recognition in Geometric Sensor NetworksSándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann. 84-87 [doi]
• Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc NetworksGeorge S.-C. Kao, Thomas Fevens, Jaroslav Opatrny. 88-91 [doi]
• Pricing of Geometric Transportation NetworksJean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop. 92-96 [doi]
• k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the PlaneValentin Polishchuk, Joseph S. B. Mitchell. 101-104 [doi]
• Drawing planar bipartite graphs with small areaTherese C. Biedl, Franz-Josef Brandenburg. 105-108 [doi]
• Morphing Polyhedra Preserving Face Normals: A CounterexampleTherese C. Biedl, Anna Lubiw, Michael J. Spriggs. 109-112 [doi]
• Experiments on Area Compaction Algorithms for Orthogonal DrawingsCarla Binucci, Walter Didimo. 113-116 [doi]
• Complexity of Octagonal and Rectangular CartogramsTherese C. Biedl, Burkay Genc. 117-120 [doi]
• Area-Proportional Drawings of Intersecting Families of Simple Closed CurvesStirling Chow, Frank Ruskey. 121-124 [doi]
• Matching Edges and Faces in Polygonal PartitionsOswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber. 126-129 [doi]
• New results on Pseudo-triangulations with low vertex degreeAndré Schulz. 130-133 [doi]
• Dynamic updates of succinct triangulationsLuca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. 134-137 [doi]
• A vertex-face assignment for plane graphsCsaba D. Tóth, Diane L. Souvaine. 138-141 [doi]
• Compactly Encoding and Decoding the Connectivity of a Plane Graph in Linear TimeRaquel Viaña. 142-145 [doi]
• Computational Geometry on Optical Multi-Trees (OMULT) Computer SystemRabiul Islam, Nahid Afroz, Subir Bandyopadhyay, Bhabani P. Sinha. 150-154 [doi]
• A Fast Algorithm for Point Labeling ProblemSasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy. 155-158 [doi]
• Computing the Boundary of a Class of Labeled-Leaf BSP SolidsSherif Ghali, Chris Smith. 159-162 [doi]
• The Distance Geometry of Deep Rhythms and ScalesErik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood. 163-166 [doi]
• Density or Discrepancy: A VLSI Designer s Dilemma in Hot Spot AnalysisSubhashis Majumder, Bhargab B. Bhattacharya. 167-170 [doi]
• Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the PlaneStefan Schirra. 171-174 [doi]
• The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex PolygonGill Barequet, Yuval Scharf. 175-178 [doi]
• Translating a Star over a Point SetProsenjit Bose, Jason Morrison. 179-182 [doi]
• Cutting Out PolygonsRamaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo. 183-186 [doi]
• The complexity of domino tilingTherese C. Biedl. 187-190 [doi]
• Minimizing the Total Absolute Gaussian Curvature in a Terrain is HardMaike Buchin, Joachim Giesen. 195-198 [doi]
• Cross-Stitching Using Little ThreadTherese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz. 199-202 [doi]
• On the Computation and Chromatic Number of Colored Domino TilingsChris Worman, Boting Yang. 203-206 [doi]
• Unfolding Manhattan TowersMirela Damian, Robin Y. Flatland, Joseph O Rourke. 211-214 [doi]
• Bernstein based arithmetic featuring de CasteljauDominique Michelucci, Sebti Foufou, Loïc Lamarque, David Ménegaux. 215-218 [doi]
• Finding and Maintaining Rigid ComponentsAudrey Lee, Ileana Streinu, Louis Theran. 219-222 [doi]
• Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear TimeJack Snoeyink, Ileana Streinu. 223-226 [doi]
• Proximity Problems on Line Segments Spanned by PointsOvidiu Daescu, Jun Luo, David M. Mount. 227-231 [doi]
• Closest SegmentsKathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport. 232-234 [doi]
• Dynamic Well-Separated Pair Decomposition Made EasyJohn Fischer, Sariel Har-Peled. 235-238 [doi]
• Farthest Neighbor Voronoi Diagram in the Presence of Rectangular ObstaclesBoaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi. 243-246 [doi]
• Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the PlaneAmr Elmasry, Khaled M. Elbassioni. 248-251 [doi]
• On the Pagenumber of Bipartite OrdersNejib Zaguia, Guy-Vincent Jourdan, Mustafa Alhashem. 252-255 [doi]
• Computing faces up to k dimensions of a Minkowski Sum of PolytopesChristophe Weibel, Komei Fukuda. 256-259 [doi]
• Searching for the Center of an EllipseMichael Burr, Alexandra Lauric, Katelyn Mann. 260-263 [doi]
• Maximum Independent Set for Intervals by Divide-Prune-and-ConquerJack Snoeyink. 264-265 [doi]
• Anisotropic Diagrams: Labelle Shewchuk approach revisitedJean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec. 266-269 [doi]
• Flow Complex: General Structure and AlgorithmKevin Buchin, Joachim Giesen. 270-273 [doi]
• Finding a triangular mesh with a constant number of different edge lengthsShin-ichi Tanigawa, Naoki Katoh. 274-277 [doi]
• Region Counting Distances and Region Counting CirclesJean Cardinal, Sébastien Collette, Stefan Langerman. 278-281 [doi]
• Boundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex InsertionDémian Nave, Nikos Chrisochoides. 282-285 [doi]
• Solving online feasibility problem in constant amortized time per updateLilian Buzer. 286-289 [doi]
• Touring Convex Bodies - A Conic Programming SolutionValentin Polishchuk, Joseph S. B. Mitchell. 290-293 [doi]
• An Experimental Assessment of the 2D Visibility ComplexHazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang. 298-301 [doi]
• Maintaining Visibility Information of Planar Point Sets with a Moving ViewpointOlivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath. 302-305 [doi]