Journal: Comput. Geom.

Volume 43, Issue 9

713 -- 720Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama. Distance k-sectors exist
721 -- 748Elvan Ceyhan. Extension of one-dimensional proximity regions to higher dimensions
749 -- 766Laurent Alonso, Edward M. Reingold. Bounds for cops and robber pursuit
767 -- 780Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi. Rectangular-radial drawings of cubic plane graphs

Volume 43, Issue 8

635 -- 0Carola Wenk, Afra Zomorodian. Guest Editors foreword
636 -- 646Timothy M. Chan, Eric Y. Chen. Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
647 -- 654Gary L. Miller, Donald Sheehy. Approximate centerpoints with proofs
655 -- 662Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos. Randomly removing g handles at once
663 -- 677Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler. Parallel geometric algorithms for multi-core computers
678 -- 687Gaiane Panina, Ileana Streinu. Flattening single-vertex origami: The non-expansive case
688 -- 699Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl. Divide-and-conquer for Voronoi diagrams revisited
700 -- 712Peyman Afshani, Chris H. Hamilton, Norbert Zeh. A general approach for cache-oblivious range reporting and approximate range counting

Volume 43, Issue 6-7

555 -- 0Kurt Mehlhorn, Jörg-Rüdiger Sack. Editorial
556 -- 564Raimund Seidel. Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
565 -- 571Nabil H. Mustafa, Saurabh Ray. Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
572 -- 586Sorelle A. Friedler, David M. Mount. Approximation algorithm for the kinetic robust K-center problem
587 -- 592Itay Ben-Dan, Rom Pinchasi, Ran Ziv. On a problem about quadrant-depth
593 -- 600Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza. Centerpoints and Tverberg s technique
601 -- 610Karl Bringmann, Tobias Friedrich. Approximating the volume of unions and intersections of high-dimensional geometric objects
611 -- 634Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath. Matched drawability of graph pairs and of graph triples

Volume 43, Issue 5

445 -- 452Evan VanderZee, Anil N. Hirani, Vadim Zharnitsky, Damrong Guoy. A dihedral acute triangulation of the cube
453 -- 473Roberto Bagnara, Patricia M. Hill, Enea Zaffanella. Exact join detection for convex polyhedra and other numerical abstractions
474 -- 492Juan José Jiménez, Rafael Jesús Segura, Francisco R. Feito. A robust segment/triangle intersection algorithm for interference tests. Efficiency study
493 -- 513Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma. Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
514 -- 523Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin. Covering a simple polygon by monotone directions
524 -- 534Heping Zhang, Guangfu Wang. Embeddability of open-ended carbon nanotubes in hypercubes
535 -- 553N. Chernov, Yu. G. Stoyan, Tatiana Romanova. Mathematical model and efficient algorithms for object packing problem

Volume 43, Issue 4

329 -- 330Norbert Zeh. Editorial
331 -- 356Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma. The complexity of flow on fat terrains and its i/o-efficient computation
357 -- 376Jan Remy, Reto Spöhel, Andreas Weißl. On Euclidean vehicle routing with allocation
377 -- 394Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. Optimization for first order Delaunay triangulations
395 -- 409Matthias Müller-Hannemann, Siamak Tazari. A near linear time approximation scheme for Steiner tree among obstacles in the plane
410 -- 418Mark de Berg, Chris Gray. Computing the visibility map of fat objects
419 -- 433Maarten Löffler, Marc J. van Kreveld. Largest bounding box, smallest diameter, and related problems on imprecise points
434 -- 444Guilherme Dias da Fonseca, David M. Mount. Approximate range searching: The absolute model

Volume 43, Issue 3

233 -- 0Monique Teillaud. Foreword
234 -- 242Maarten Löffler, Jack Snoeyink. Delaunay triangulation of imprecise points in linear time after preprocessing
243 -- 250Timothy M. Chan. A (slightly) faster algorithm for Klee s measure problem
251 -- 256Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson. A simple and efficient kinetic spanner
257 -- 278Eric Berberich, Michael Kerber, Michael Sagraloff. An efficient algorithm for the stratification and triangulation of an algebraic surface
279 -- 294Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk. Maximum thick paths in static and dynamic environments
295 -- 311Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite. Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
312 -- 328Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff. Optimizing active ranges for consistent dynamic map labeling

Volume 43, Issue 2

67 -- 0Sylvain Lazard. Editorial
68 -- 72Christian Wulff-Nilsen. Computing the dilation of edge-augmented graphs in metric spaces
73 -- 83Mark de Berg, Chris Gray. Decompositions and boundary coverings of non-convex fat polyhedra
84 -- 93Reinhard Steffens, Thorsten Theobald. Mixed volume techniques for embeddings of Laman graphs
94 -- 98Victor Alvarez, Raimund Seidel. Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
99 -- 114Helmut Alt, Ludmila Scharf, Daria Schymura. Probabilistic matching of planar regions
115 -- 130Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O Rourke, Belén Palop. Highway hull revisited
131 -- 147Herman J. Haverkort, Freek van Walderveen. Locality and bounding-box quality of two-dimensional space-filling curves
148 -- 168Sándor P. Fekete, Christiane Schmidt. Polygon exploration with time-discrete vision
169 -- 181Chao Chen, Daniel Freedman. Measuring and computing natural generators for homology groups
182 -- 190Gautam K. Das, Sandip Das, Subhas C. Nandy. Homogeneous 2-hop broadcast in 2D
191 -- 206Seok-Hee Hong, Hiroshi Nagamochi. An algorithm for constructing star-shaped drawings of plane graphs
207 -- 218Domagoj Matijevic, Ralf Osbild. Finding the Theta-guarded region
219 -- 232Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta. Upward straight-line embeddings of directed graphs into point sets

Volume 43, Issue 1

2 -- 22Godfried T. Toussaint. Computational geometric aspects of rhythm, melody, and voice-leading
23 -- 34Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee. Floodlight illumination of infinite wedges
35 -- 41Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth. Pointed binary encompassing trees: Simple and optimal
42 -- 58Hamish Carr, Jack Snoeyink, Michiel van de Panne. Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
59 -- 66Guang Xu, Jinhui Xu. Efficient approximation algorithms for clustering point-sets