Journal: Comput. Geom.

Volume 44, Issue 9

465 -- 476Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Jun Luo. Finding long and similar parts of trajectories
477 -- 485Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén. Connectivity guarantees for wireless networks with directional antennas
486 -- 498Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer. A survey of geodesic paths on 3D surfaces
499 -- 506Marc J. van Kreveld. Bold graph drawings
507 -- 528Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff. A general approach to the analysis of controlled perturbation algorithms
529 -- 543Fabrizio Frati, Michael Kaufmann. Polynomial area bounds for MST embeddings of trees

Volume 44, Issue 8

365 -- 369Laurent Alonso, Edward M. Reingold. Improved bounds for cops-and-robber pursuit
370 -- 384Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk. The snowblower problem
385 -- 398J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz. Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
399 -- 408Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz. Efficient view point selection for silhouettes of convex polyhedra
409 -- 417Therese C. Biedl, Burkay Genç. Reconstructing orthogonal polyhedra from putative vertex sets
418 -- 426Yann Disser, Matús Mihalák, Peter Widmayer. A polygon is determined by its angles
427 -- 441Shawn Martin, Jean-Paul Watson. Non-manifold surface reconstruction from high-dimensional point cloud data
442 -- 455Atlas F. Cook, Carola Wenk. Link distance and shortest path problems in the plane
456 -- 463Stefan Hougardy. On packing squares into a rectangle

Volume 44, Issue 6-7

319 -- 328Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu. On a family of strong geometric spanners that admit local routing strategies
329 -- 344Boris Aronov, Muriel Dulieu, Ferran Hurtado. Witness (Delaunay) graphs
345 -- 355Radoslav Fulek, János Pach. A computational approach to Conway s thrackle conjecture
356 -- 364Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz. Minimum vertex cover in rectangle graphs

Volume 44, Issue 5

249 -- 264Burkay Genç, Cem Evrendilek, Brahim Hnich. Covering points with orthogonally convex polygons
265 -- 285Eli Packer. Controlled Perturbation of sets of line segments in ℝ:::2::: with smart processing order
286 -- 302Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan. Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
303 -- 318Mercè Claverol, Delia Garijo, Clara I. Grima, Alberto Márquez, Carlos Seara. Stabbers of line segments in the plane

Volume 44, Issue 4

191 -- 205Haim Kaplan, Natan Rubin, Micha Sharir. A kinetic triangulation scheme for moving points in the plane
206 -- 215Abhishek Kashyap, Samir Khuller, Mark A. Shayman. Relay placement for fault tolerance in wireless networks in higher dimensions
216 -- 233Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Vera Sacristan, Maria Saumell. On crossing numbers of geometric proximity graphs
234 -- 247Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na. Farthest-polygon Voronoi diagrams

Volume 44, Issue 3

129 -- 134Khaled M. Elbassioni, Hans Raj Tiwary. On a cone covering problem
135 -- 147José Miguel Díaz-Báñez, M. A. López, Mercè Mora, Carlos Seara, Inmaculada Ventura. Fitting a two-joint orthogonal chain to a point set
148 -- 159Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang. Improved data structures for the orthogonal range successor problem
160 -- 168Olivier Devillers, Monique Teillaud. Perturbations for Delaunay and weighted Delaunay 3D triangulations
169 -- 177Olivier Devillers. Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization
178 -- 190Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son. Covering points by disjoint boxes with outliers

Volume 44, Issue 2

69 -- 0William Evans. Guest Editor s foreword
70 -- 81Yves Brise, Bernd Gärtner. Clarkson s algorithm for violator spaces
82 -- 94Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke. Integer point sets minimizing average pairwise L::1:: distance: What is the optimal shape of a town?
95 -- 99Christian A. Duncan. On graph thickness, geometric thickness, and separator theorems
100 -- 103Minghui Jiang. An inequality on the edge lengths of triangular meshes
104 -- 109Shiliang Cui, Iyad A. Kanj, Ge Xia. On the stretch factor of Delaunay triangulations of points in convex position
110 -- 120Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh. Fréchet distance with speed limits
121 -- 127Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma. Almost all Delaunay triangulations have stretch factor greater than pi/2

Volume 44, Issue 1

1 -- 8Prosenjit Bose, Otfried Cheong, Vida Dujmovic. A note on the perimeter of fat objects
9 -- 19Sadish Sadasivam, Huaming Zhang. Closed rectangle-of-influence drawings for irreducible triangulations
20 -- 51Menelaos I. Karavelas. Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
52 -- 68Gennaro Cordasco, Rosario De Chiara, Andrew Fish. Efficient on-line algorithms for Euler diagram region computation