Journal: Int. J. Comput. Geometry Appl.

Volume 27, Issue 4

241 -- 254Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian. Competitive Online Routing on Delaunay Triangulations
255 -- 276Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina Miraglia Herrera de Figueiredo. Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs
277 -- 296Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier. Finding Points in General Position
297 -- 0Lucas Moutinho Bueno, Jorge Stolfi. 4-Colored Triangulation of 3-Maps

Volume 27, Issue 3

159 -- 176Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer. Minimum Cell Connection in Line Segment Arrangements
177 -- 186Juyoung Yon, Siu-Wing Cheng, Otfried Cheong, Antoine Vigneron. Finding Largest Common Point Sets
187 -- 206Victor C. S. Lee, Haitao Wang 0001, Xiao Zhang. Minimizing the Maximum Moving Cost of Interval Coverage
207 -- 220A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur. Strongly Connected Spanning Subgraph for Almost Symmetric Networks
221 -- 240Cecilia Bohler, Rolf Klein, Chih-Hung Liu. Abstract Voronoi Diagrams from Closed Bisecting Curves

Volume 27, Issue 1-2

1 -- 2Mark de Berg, Adrian Dumitrescu, Khaled Elbassioni. Guest Editors' Foreword
3 -- 12Siu-Wing Cheng, Man-Kit Lau. Adaptive Point Location in Planar Convex Subdivisions
13 -- 32Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron. Navigating Weighted Regions with Scattered Skinny Tetrahedra
33 -- 56Yi-Jun Chang, Hsu-Chun Yen. Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra
57 -- 84Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein. An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
85 -- 120Karl Bringmann, Marvin Künnemann. Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
121 -- 0Martin Nöllenburg, Roman Prutkin, Ignaz Rutter. Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions