Accepted papers

Papers accepted to EuroCG 2015 in random order

The Slope Number of Segment Intersection Graphs: Udo Hoffmann
Chromatic Guarding of Orthogonal Polygons with Orthogonal Visibility: Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek and Max Willert
Two-Level Rectilinear Steiner Trees: Stephan Held and Nicolas Kaemmerling
Simple strategies versus optimal schedules in multi-agent patrolling: Akitoshi Kawamura and Makoto Soejima
Ramsey numbers for empty convex polygons: Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy, Carlos Hidalgo Toscano, Clemens Huemer, Jesús Leaños, Toshinori Sakai and Jorge Urrutia
Adaptive analysis-suitable T-mesh refinement with linear complexity: Philipp Morgenstern and Daniel Peterseim
Max Shortest Path for Imprecise Points: Sandro Montanari, Matúš Mihalák and Yann Disser
New Geometric Algorithms for Staged Self-Assembly: Erik D. Demaine, Sándor Fekete and Arne Schmidt
Automatic Proofs for Formulae Enumerating Proper Polycubes: Gill Barequet and Mira Shalah
A Linear-Time Algorithm for the Queue-Numbers of Proper Triangulated Cacti: Toru Hasunuma
beta-skeletons for a set of line segments in R^2: Miroslaw Kowaluk and Gabriela Majewska
Long Paths in Line Arrangements: Udo Hoffmann, Linda Kleist and Tillmann Miltzow
Improved single tree-crow extraction from 3D point clouds: Domen Mongus and Borut Žalik
Finding Pairwise Intersections Inside a Query Rectangle: Mark de Berg and Ali D. Mehrabi
Mosaic Drawings and Cartograms: Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke and Bettina Speckmann
Compact families of Jordan curves and convex hulls in three dimensions: Colm O Dunlaing
Orienting triangulations: Boris Albar, Daniel Gonçalves and Kolja Knauer
Lattice 3-polytopes with six lattice points: Monica Blanco and Francisco Santos
Elastic Shape Matching for Translations under the Manhattan Norm: Fabian Stehn, Christian Knauer and Luise Sommer
Combinatorics of edge 2-transmitter art gallery problems: Sarah Cannon, Thomas Fai, Justin Iwerks, Undine Leopold and Christiane Schmidt
Constrained Generalized Delaunay Graphs Are Plane Spanners: Prosenjit Bose, Jean-Lou De Carufel and André van Renssen
Non-crossing monotone paths and binary trees in edge-labeled complete geometric graphs: Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano and Pablo Pérez-Lantero
Efficient Algorithms and Implementations for Visibility in 1.5D Terrains: Andreas Haas and Michael Hemmer
Non-crossing Monotonic Paths in Labeled Point Sets on the Plane: Toshinori Sakai and Jorge Urrutia
Homotopy Measures for Representative Trajectories: Erin Chambers, Irina Kostitsyna, Maarten Löffler and Frank Staals
A lower bound on opaque sets: Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi and Janos Pach
Area- and Boundary-Optimal Polygonalization of Planar Point Sets: Sándor Fekete, Stephan Friedrichs, Michael Hemmer, Melanie Papenberg, Arne Schmidt and Julian Troegel
A linear-time algorithm for the geodesic center of a simple polygon: Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean Lou de Carufel, Matias Korman and Eunjin Oh
An algorithm based on local geometry for classifying high density point clouds: Mihai-Sorin Stupariu
Approximating the Colorful Caratheodory Theorem: Wolfgang Mulzer and Yannik Stein
All Good Drawings of Small Complete Graphs: Bernardo Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Thomas Hackl, Jürgen Pammer, Alexander Pilz, Pedro Ramos, Gelasio Salazar and Birgit Vogtenhuber
A Middle Curve Based on Discrete Fréchet Distance: Hee-Kap Ahn, Helmut Alt, Maike Buchin, Ludmila Scharf and Carola Wenk
Time-Space Trade-offs for Voronoi Diagrams: Matias Korman, Wolfgang Mulzer, Andre van Renssen, Marcel Roeloffzen, Paul Seiferth and Yannik Stein
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures: Elena Khramtcova and Evanthia Papadopoulou
Recognizing Weighted Disk Contact Graphs: Boris Klemz, Martin Nöllenburg and Roman Prutkin
Computing the Similarity Between Moving Curves: Kevin Buchin, Tim Ophelders and Bettina Speckmann
Computing the Smallest Color-Spanning Equaliteral Triangle: Javad Hasheminejad, Payam Khanteimouri and Ali Mohades
Kinetic Data Structures for Clipped Voronoi Computations: Duru Türkoğlu
Packing Segments in a Simple Polygon is APX-hard: Heuna Kim and Tillmann Miltzow
Computing the s-kernel of Orthogonal Polygons: Leonidas Palios
Continuous Geometric Algorithms for Robot Swarms with Multiple Leaders: Maximilian Ernestus, Sándor Fekete, Michael Hemmer and Dominik Krupke
Kinetic Conflict Free Coloring: Mark De Berg, Tim Leijssen and Marcel Roeloffzen
A Method for Fitting Real World Tessellations with Voronoi Diagrams: Supanut Chaidee and Kokichi Sugihara
Caging polygons by a Finger and a Wall: Bahareh Banyassady, Mansoor Davoodi and Ali Mohades
The Number of Combinatorially Different Convex Hulls of Points in Lines: Heuna Kim, Wolfgang Mulzer and Eunjin Oh
Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor : Evangelos Anagnostopoulos, Ioannis Emiris and Ioannis Psarros
Optimal Straight-line Labels for Island Groups: Arthur van Goethem, Marc Van Kreveld, Andreas Reimer, Maxim Rylov and Bettina Speckmann
Dynamic Convex Hull for Simple Polygonal Chains in Constant Amortized Time per Update: Norbert Bus and Lilian Buzer
Randomized Strategy for Walking in Streets for a Simple Robot‎: Azadeh Tabatabaei and Mohammad Ghodsi
Exact Minkowski Sums of Polygons With Holes: Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer and Sebastian Morr
Efficient Spanner Construction for Directed Transmission Graphs: Haim Kaplan, Wolfgang Mulzer, Liam Roditty and Paul Seiferth
Pruning Oracles for High-Dimensional Vector Sets: Stefan Funke and Sabine Storandt
The 2-center problem and ball operators in strictly convex normed planes: Pedro Martín, Horst Martini and Margarita Spirova
The Complexity of the Partial Order Dimension Problem -- Closing the Gap: Stefan Felsner, Irina-Mihaela Mustata and Martin Pergel
Central Trajectories: Marc Van Kreveld, Maarten Löffler and Frank Staals
On the Complexity of the Discrete Fréchet Distance under $L_1$ and $L_\infty$: Omer Gold and Micha Sharir
Optimizing an oriented convex hull with two directions: Carlos Alegria Galicia, David Orden, Carlos Seara and Jorge Urrutia
Clustered Edge Routing: Quirijn Bouts and Bettina Speckmann
Special Guards in Chromatic Art Gallery: Hamid Hoorfar and Ali Mohades
Exact solutions for the continuous 1.5D Terrain Guarding Problem: Stephan Friedrichs, Michael Hemmer and Christiane Schmidt
Distinct distances between points and lines: Micha Sharir, Shakhar Smorodinsky, Claudiu Valculescu and Frank de Zeeuw
Subquadratic Medial-Axis Approximation for smooth Curves in R^3: Christian Scheffer
Experiments on Parallel Polygon Triangulation Using Ear Clipping: Günther Eder, Martin Held and Peter Palfrader
Fully autonomous Self-Localization via Trajectory Representations based on Inflection Points: Stefan Funke, Robin Schirrmeister, Simon Skilevic and Sabine Storandt
Flow Diagrams for Trajectory Analysis: Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton and Stef Sijben
Column Planarity and Partial Simultaneous Geometric Embedding for Outerplanar Graphs: Luis Barba, Michael Hoffmann and Vincent Kusters