Table of Contents

• Practical and Efficient Geometric Epsilon-ApproximationsHüseyin Akcan, Hervé Brönnimann, Robert Marini. [doi]
• The PKD-tree for Orthogonal d-Dimensional Range SearchBradford G. Nickerson, Qingxiu Shi. [doi]
• Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the PlaneJan Tusch, Stefan Schirra. [doi]
• Characterization of Polygons Searchable by a Boundary 1-SearcherTsunehiko Kameda, John Z. Zhang, Masafumi Yamashita. [doi]
• Hamiltonian Cycles in Triangular GridsValentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell. [doi]
• On the Smallest Enclosing Information DiskFrank Nielsen, Richard Nock. [doi]
• An Optimal Solution to Room Search ProblemBinay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda. [doi]
• On Computing Shortest External Watchman Routes for Convex PolygonsRafa Absar, Sue Whitesides. [doi]
• Optimal Polygon PlacementProsenjit Bose, Jason Morrison. [doi]
• An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of PointsAsish Mukhopadhyay, Robert L. Scot Drysdale. [doi]
• Invited Lecture: Predicting the Flexibility and Rigidity of Proteins: Geometry, Combinatorics, Conjectures, and AlgorithmsWalter Whiteley. [doi]
• Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large nDania El-Khechen, Thomas Fevens, John Iacono. [doi]
• (Approximate) Conic Nearest Neighbors and the induced Voronoi DiagramStefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert. [doi]
• Local Overlaps In Special Unfoldings Of Convex PolyhedraBrendan Lucier. [doi]
• Computing the Tool Path of an Externally Monotone Polygon in Linear TimeProsenjit Bose, David Bremner, Diane L. Souvaine. [doi]
• Removing Outliers to Minimize Area and PerimeterRossen Atanassov, Pat Morin, Stefanie Wuhrer. [doi]
• Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good ChoiceDavid M. Mount. [doi]
• Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to ProteinsErik D. Demaine. [doi]
• Routing with Guaranteed Delivery on Virtual CoordinatesMirela Ben-Chen, Craig Gotsman, Steven J. Gortler. [doi]
• An Improved Approximation Factor For The Unit Disk Covering ProblemSada Narayanappa, Petr Vojtechovský. [doi]
• Two-Guard Art Gallery ProblemJunqiang Zhou, Simeon C. Ntafos. [doi]
• On Bipartite Matching under the RMS DistanceJeff M. Phillips, Pankaj K. Agarwal. [doi]
• Predicates for Line Transversals in 3DHazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang. [doi]
• Polygons Flip Finitely: Flaws and a FixErik D. Demaine, Blaise Gassend, Joseph O Rourke, Godfried T. Toussaint. [doi]
• A Study of Conway s Thrackle ConjectureWei Li, Karen Daniels, Konstantin A. Rybnikov. [doi]
• Polygon Reconstruction from Line Cross-SectionsGill Barequet, Craig Gotsman, Avishay Sidlesky. [doi]
• On the Maximum Span of Fixed-Angle ChainsNadia Benbernou, Joseph O Rourke. [doi]
• The Complexity of a Pop-Up BookRyuhei Uehara, Sachio Teramoto. [doi]
• Minimizing the Number of Arcs Linking a Permutation of Points in the PlaneStephane Durocher, Chris Gray, James A. King. [doi]
• K-Nearest Neighbor Search using the Pyramid TechniqueBradford G. Nickerson, Qingxiu Shi. [doi]
• Shortest Descending Paths through Given FacesMustaq Ahmed, Anna Lubiw. [doi]
• Small Weak Epsilon-Nets in Three DimensionsMaryam Babazadeh, Hamid Zarrabi-Zadeh. [doi]
• Spanning trees across axis-parallel segmentsCsaba D. Tóth, Michael Hoffmann. [doi]
• Geometric Separator for d-Dimensional Ball GraphsKebin Wang, Shang-Hua Teng. [doi]
• Realization of Degree 10 Minimum Spanning Trees in 3-SpaceJames A. King. [doi]
• Open Problems: Open Problems from CCCG 2005Erik D. Demaine, Joseph O Rourke. [doi]
• Bounded-Curvature Path NormalizationJonathan Backer, David G. Kirkpatrick. [doi]
• Computational EuclidMaarten H. van Emden, Belaid Moa. [doi]
• Range-Aggregate Proximity Detection for Design Rule Checking in VLSI LayoutsR. Sharathkumar, Prosenjit Gupta. [doi]
• Tight Bounds for Point RecolouringYurai Núñez Rodríguez, David Rappaport. [doi]
• 2D Triangulation Representation Using Stable CatalogsAbdelkrim Mebarki, Luca Castelli Aleardi, Olivier Devillers. [doi]
• Curves in the Sand: Algorithmic DrawingMirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint. [doi]
• Rotationally Monotone PolygonsProsenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer. [doi]
• A Simple Streaming Algorithm for Minimum Enclosing BallsHamid Zarrabi-Zadeh, Timothy M. Chan. [doi]
• Another Paradigm for Geometric Constraints SolvingDominique Michelucci, Sebti Foufou, Loïc Lamarque, David Ménegaux. [doi]
• On Planar Path TransformationKamrul Islam, Selim G. Akl, Henk Meijer. [doi]
• Computing Depth Contours with Graphics HardwareCraig Gotsman, Ian Fischer. [doi]
• A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness QueriesYakov Nekrich. [doi]