Computational Geometry, Volume 43

Volume 43, Number 1, January 2010

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

Volume 43, Number 2, February 2010

• Sylvain Lazard:
  Editorial. 67
  
• Christian Wulff-Nilsen:
  Computing the dilation of edge-augmented graphs in metric spaces. 68-72
  
• Mark de Berg, Chris Gray:
  Decompositions and boundary coverings of non-convex fat polyhedra. 73-83
  
• Reinhard Steffens, Thorsten Theobald:
  Mixed volume techniques for embeddings of Laman graphs. 84-93
  
• Victor Alvarez, Raimund Seidel:
  Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. 94-98
  
• Helmut Alt, Ludmila Scharf, Daria Schymura:
  Probabilistic matching of planar regions. 99-114
  

• Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
  Highway hull revisited. 115-130
  
• Herman J. Haverkort, Freek van Walderveen:
  Locality and bounding-box quality of two-dimensional space-filling curves. 131-147
  
• Sándor P. Fekete, Christiane Schmidt:
  Polygon exploration with time-discrete vision. 148-168
  
• Chao Chen, Daniel Freedman:
  Measuring and computing natural generators for homology groups. 169-181
  
• Gautam K. Das, Sandip Das, Subhas C. Nandy:
  Homogeneous 2-hop broadcast in 2D. 182-190
  
• Seok-Hee Hong, Hiroshi Nagamochi:
  An algorithm for constructing star-shaped drawings of plane graphs. 191-206
  
• Domagoj Matijevic, Ralf Osbild:
  Finding the Theta-guarded region. 207-218
  
• Carla 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. 219-232
  

Volume 43, Number 3, April 2010

• Monique Teillaud:
  Foreword. 233
  
• Maarten Löffler, Jack Snoeyink:
  Delaunay triangulation of imprecise points in linear time after preprocessing. 234-242
  
• Timothy M. Chan:
  A (slightly) faster algorithm for Klee's measure problem. 243-250
  
• Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson:
  A simple and efficient kinetic spanner. 251-256
  
• Eric Berberich, Michael Kerber, Michael Sagraloff:
  An efficient algorithm for the stratification and triangulation of an algebraic surface. 257-278
  
• Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
  Maximum thick paths in static and dynamic environments. 279-294
  
• Erin 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. 295-311
  
• Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff:
  Optimizing active ranges for consistent dynamic map labeling. 312-328
  

Volume 43, Number 4, May 2010

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

Volume 43, Number 5, July 2010

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

Volume 43, Numbers 6-7, August 2010

• Kurt Mehlhorn, Jörg-Rüdiger Sack:
  Editorial. 555
  

• Raimund Seidel:
  Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. 556-564
  
• Nabil H. Mustafa, Saurabh Ray:
  Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. 565-571
  

• Sorelle A. Friedler, David M. Mount:
  Approximation algorithm for the kinetic robust K-center problem. 572-586
  
• Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
  On a problem about quadrant-depth. 587-592
  
• Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza:
  Centerpoints and Tverberg's technique. 593-600
  
• Karl Bringmann, Tobias Friedrich:
  Approximating the volume of unions and intersections of high-dimensional geometric objects. 601-610
  
• Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
  Matched drawability of graph pairs and of graph triples. 611-634
  

Volume 43, Number 8, October 2010

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

Volume 43, Number 9, November 2010

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

Last update Fri May 24 20:07:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page