# List of Accepted Papers

Author(s) | Title | |

1 | Adrian Dumitrescu | On distinct distances among points in general position and other related problems |

2 | Adrian Dumitrescu and Minghui Jiang | Monochromatic simplices of any volume |

3 | Alex Benton and Joseph O'Rourke | A Class of Convex Polyhedra with Few Edge Unfoldings |

4 | Benoit Hudson and Duru Türkoglu | An Efficient Query Structure for Mesh Refinement |

5 | Christian Wulff-Nilsen | Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics |

6 | Dania El-Khechen, John Iacono and Thomas Fevens | Partitioning a Polygon into Two Mirror Congruent Pieces |

7 | Deepanjan Kesh and Shashank Mehta | Polynomial irreducibility testing through Minkowski summand computation |

8 | Don Sheehy, Gary Miller and Todd Phillips | Linear-Size Meshes |

9 | Eric McCreath | Partial Matching of Planar Polygons Under Translation and Rotation |

10 | Erik D. Demaine, Martin L. Demaine and Vi Hart | Computational Balloon Twisting: The Theory of Balloon Polyhedra |

11 | Esther Arkin, Joondong Kim, Irina Kostitsyna, Joseph Mitchell and Girishkumar Sabhnani | The Embroidery Problem |

12 | Gerhard Guettler and Colin Mallows | A generalization of Apollonian packing of circles |

13 | Greg Aloupis, Jean Cardinal, Sebastien Collette, Ferran Hurtado, Stefan Langerman and Joseph O'Rourke | Draining a Polygon--or--Rolling a Ball out of a Polygon |

14 | Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman and Bettina Speckmann | Triangulating and Guarding Realistic Polygons |

15 | Hamid Reza Chitsaz, Steven M. LaValle and Jason O'Kane | Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap |

16 | Hamid Zarrabi-Zadeh | Core-Preserving Algorithms |

17 | Henk Meijer, Yurai Núñez Rodríguez and David Rappaport | On the Complexity of Point Recolouring in Geometric Graphs |

18 | James King | VC-Dimension of Visibility on Terrains |

19 | Jeff Sember and William Evans | Guaranteed Voronoi Diagrams of Uncertain Sites |

20 | Jérémy Barbay and Eric Y, Chen | Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis |

21 | Jihui Zhao and william steiger | Generalized Ham-Sandwich Cuts for Well Separated Point Sets |

22 | Joachim Giesen, Madhusudan Manjunath and Michael Eigensatz | The Solution Path of the Slab Support Vector Machine |

23 | Jonathan Derryberry, Don Sheehy, Maverick Woo and Danny Sleator | Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors |

24 | Joseph O'Rourke, Perouz Taslakian and Godfried Toussaint | A Pumping Lemma for Homometric Rhythms |

25 | Karim Abu Affash and Matthew J. Katz | Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object |

26 | Khaled Elbassioni and Hans Raj Tiwary | On a Cone Covering Problem |

27 | Maia Fraser, Evangelos Kranakis and Jorge Urrutia | Memory Requirements for Local Geometric Routing and Traversal in Digraphs |

28 | Manjish Pal | The Focus of Attention Problem Revisited |

29 | Marcus Schaefer, Eric Sedgwick and Daniel Stefankovic | Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time |

30 | Marek Karpinski and Yakov Nekrich | Searching for Frequent Colors in Rectangles |

31 | Mashhood Ishaque, Diane Souvaine and Nadia Benbernou | Data Structures for Restricted Triangular Range Searching |

32 | Mina Razaghpour and Anna Lubiw | The Steiner Ratio for Obstacle-Avoiding Steiner Trees |

33 | Mohammad Ali Abam, Mark de Berg and Sheung-Hung Poon | Fault-Tolerant Conflict-Free Coloring |

34 | Mohammad Moharrami and Avner Magen | On the nonexistence of dimension reduction for $\ell2_2$ metrics |

35 | Mojtaba Nouri Bygi and Mohammad Ghodsi | Polar Diagram of Moving Objects |

36 | Natasa Jovanovic, Jan Korst and Augustus J.E.M. Janssen | Minimum blocking sets of circles for a set of lines in the plane |

37 | Oswin Aichholzer, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer and Jorge Urrutia | Empty Monochromatic Triangles |

38 | Ovidiu Daescu and Anastasia Kurdia | Polygonal Chain Simplification with Small Angle Constraints |

39 | Peter Damaschke | Competitive Search for Longest Empty Intervals |

40 | Priya Ranjan Sinha Mahapatra, Partha P. Goswami and Sandip Das | Maximal Covering by Two Isothetic Unit Squares |

41 | Prosenjit Bose, Joseph O'Rourke, Chang Shu and Stefanie Wuhrer | Isometric Morphing of Triangular Meshes |

42 | Prosenjit Bose, Stefan Langerman and Sasanka Roy | Smallest enclosing circle centered on a query line segment |

43 | Qiaosheng Shi and Binay Bhattacharya | Application of computational geometry to network p-center location problems |

44 | Ravi Janardan, Prosenjit Gupta, Yokesh Kumar and Michiel Smid | Data Structures for Range-Aggregate Extent Queries |

45 | Reza Dorrigiv and Alejandro Lopez-Ortiz | Adaptive Searching in One and Two Dimensions |

46 | Ryuhei Uehara | Polygons Folding to Plural Incongruent Orthogonal Boxes |

47 | Selim Akl, Kamrul Islam and Henk Meijer | Direct Planar Tree Transformation and Counterexample |

48 | Stefan Naeher and Daniel Schmitt | A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem |

49 | Subhas Nandy, Krishnendu Mukhopadhyaya and Bhargab B. Bhattacharya | Recognition of Largest Empty Orthoconvex Polygon in a Point Set |

50 | Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget and Stephen Wismath | A note on alpha-drawable k-trees |

51 | Youichi Fujimoto, Mitsuo Motoki and Ryuhei Uehara | Inverting Linkages with Stretch |

52 | Yurai Núñez Rodríguez, Henry Xiao, Kamrul Islam and Waleed Alsalih | A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model |