| – Frank Nielsen and Richard Nock. The entropic centers of multivariate normal distributions |
| – Maarten Löffler and Marc van Kreveld. Geometry with Imprecise Lines |
| – Eric Berberich and Michael Kerber. Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides |
| – Tetsuo Asano. Constant-Working-Space Image Scan with a Given Angle |
| – Tetsuo Asano. Online Uniformity of Integer Points on a Line |
| – Jinhee Chun, Matias Korman, Martin Nöllenburg and Takeshi Tokuyama. Consistent digital rays |
| – Ronald Ortner. Improved Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles |
| – Mark de Berg and Chris Gray. Decomposing non-convex fat polyhedra |
| – Alireza Zarei and Mohammad Ghodsi. On Planar Visibility Polygon Simplification |
| – Christian Wulff-Nilsen. Computing the Dilation of Edge-Augmented Graphs in Metric Spaces |
| – Eric Berberich, Michael Kerber and Michael Sagraloff. Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements |
| – Victor Chepoi, Karim Nouioua, Edouard Thiel and Yann Vaxes. Pareto envelopes in simple polygons |
| – Efi Fogel, Ophir Setter and Dan Halperin. Exact Implementation of Arrangements of Geodesic Arcs on the Sphere with Applications |
| – Greg Aloupis, Jean Cardinal, Sebastien Collette, Stefan Langerman and Shakhar Smorodinsky. Coloring Geometric Range Spaces |
| – Bardia Sadri. Manifold Reconstruction as a Subcomplex of the Flow Complex |
| – Elena Mumford, Ludmila Scharf and Marc Scherfenberg. Inducing simple polygon of a line arrangement |
| – Matias Korman and Tokuyama Takeshi. Optimal insertion of a segment highway in a city metric |
| – Yonatan Myers and Leo Joskowicz. The Linear Parametric Geometric Uncertainty Model: Points, Lines and their Relative Positioning |
| – Darko Dimitrov, Elad Horev and Roi Krakovski. Polychromatic $4$-coloring of Rectangular Partitions |
| – Masaki Moriguchi and Kokichi Sugihara. Discrete Voronoi Diagrams on Surface Triangulations and a Sampling Condition for Topological Guarantee |
| – Tomohiro Ohgami and Kokichi Sugihara. Realizability of Solids from Three Silhouettes |
| – Victor Alvarez and Raimund Seidel. Approximating the Minimum Spanning Tree of Set of Points in the Hausdorff Metric |
| – Emilie Charrier and Lilian Buzer. Matching a Straight Line on a Two-Dimensional Integer Domain |
| – Bastian Degener, Joachim Gehweiler and Christiane Lammersen. The Kinetic Facility Location Problem |
| – Helmut Alt, Ludmila Scharf and Daria Schymura. Probabilistic Matching of Polygons |
| – Mridul Aanjaneya, Arijit Bishnu and Sudebkumar Pal. Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons |
| – Reinhard Steffens and Thorsten Theobald. Mixed Volume Techniques for Embeddings of Laman Graphs |
| – Mathieu Brevilliers, Nicolas Chevallier and Dominique Schmitt. Constructing the Segment Delaunay Triangulation by Flip |
| – Yago Diez and Joan Antoni Sellarès. Noisy Bottleneck Colored Point Set Matching in 3D |
| – Dominique Schmitt and Wael El-Oraiby. Order-$k$ Triangulations of Convex Inclusion Chains in the Plane |
| – Cornelia Dangelmayr, Stefan Felsner and William T. Trotter. Intersection Graphs of Pseudosegments and Chordal Graphs: An Application of Ramsey Theory |
| – Joseph O'Rourke. Edge-Unfolding Medial Axis Polyhedra |
| – Ioana-Georgiana Ciuciu, Frederic Danesi, Yvon Gardan and Estelle Perrin. Surface Deformation on a Discrete Model for a CAD System |
| – Daniel Dumitriu, Stefan Funke, Martin Kutz and Nikola Milosavljevic. On the Locality of Extracting a 2-Manifold in R^3 |
| – Luca Castelli Aleardi, Eric Fusy and Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces |
| – Andreas Razen. A Lower Bound for the Transformation of Compatible Perfect Matchings |
| – Sunayana Ghosh and Gert Vegter. Minimizing the symmetric difference distance in conic spline approximation (Extended Abstract) |
| – Ken Been, Martin Nöllenburg, Sheung-Hung Poon and Alexander Wolff. Optimizing Active Ranges for Consistent Dynamic Map Labeling |
| – Chris Gray, Maarten Löffler and Rodrigo Silveira. Smoothing imprecise 1-dimensional terrains |
| – Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado and David R. Wood. Edge-Removal and Non-Crossing Configurations in Geometric Graphs |
| – Sergio Cabello and Christian Knauer. Algorithms for graphs of bounded treewidth via orthogonal range searching |
| – Julien Demouth, Olivier Devillers, Marc Glisse and Xavier Goaoc. Helly-Type Theorems for Approximate Covering |
| – Marc Pouget, Sylvain Lazard, Fabrice Rouillier, Elias Tsigaridas, Luis Peñaranda and Jinsan Cheng. On the Topology of Planar Algebraic Curves |
| – Frank Nielsen and Richard Nock. Quantum Voronoi diagrams |
| – Ignaz Rutter and Alexander Wolff. Augmenting the Connectivity of Planar and Geometric Graphs |
| – Daniel Herrmann, Tom Kamphans and Elmar Langetepe. Exploring Simple Triangular and Hexagonal Grid Polygons Online |
| – Martin Held and Stefan Huber. Topological Considerations for the Incremental Computation of Voronoi Diagrams of Circular Arcs |
| – Stefan Schirra. On the Reliability of Practical Point-in-Polygon Strategies |
| – Ioannis Z. Emiris, Elias Tsigaridas and George M. Tzoumas. Voronoi diagram of ellipses in CGAL |
| – Christian Knauer, Günter Rote and Lena Schlipf. Shortest Inspection-Path Queries in Simple Polygons |
| – Antoine Bru and Monique Teillaud. Generic Implementation of a Data Structure for 3D Regular Complexes |
| – Hans Raj Tiwary. On Computing the Vertex Centroid of a Polytope |
| – Herman Haverkort and Freek van Walderveen. Space-filling curve properties for efficient spatial index structures |
| – Tobias Baumann, Elmar Schömer, Nicola Wolpert, Magnus Jans and Christian Schweikert. Dynamic Free-Space Detection for Packing Algorithms |
| – Franz Aurenhammer, Bernhard Kornberger, Simon Plantinga, Astrid Sturm, Günter Rote, Oswin Aichholzer, Thomas Hackl and Gert Vegter. Mesh Simplification for Incremental Approximation |
| – Manuel Caroli, Nico Kruithof and Monique Teillaud. Triangulating the 3D periodic space |
| – Nina Amenta, Dominique Attali and Olivier Devillers. A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron |
| – Narcís Coll, Narcis Madern and Joan Antoni Sellarès. Good Visibility Maps on Polyhedral Terrains |
| – Herman Haverkort, Maarten Löffler, Elena Mumford, Matthew O'Meara, Jack Snoeyink and Bettina Speckmann. Colour Patterns for Polychromatic Four-colourings of Rectangular Subdivisions |
| – Kira Vyatkina. A Search for Medial Axes in Straight Skeletons |
| – Wei Ding. On Computing Integral Minimum Link Paths in Simple Polygons |
| – Sylvain Lazard, Luis Peñaranda and Elias Tsigaridas. A CGAL-Based Univariate Algebraic Kernel and Application to Arrangements |
| – Tamal Dey and Siu-Wing Cheng. Delaunay Edge Flips in Dense Surface Triangulations |