21. CCCG 2009: Vancouver, British Columbia, Canada
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009. 2009- Christian A. Duncan: On Graph Thickness, Geometric Thickness, and Separator Theorems. 13-16
- Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov: Colored Simultaneous Geometric Embeddings and Universal Pointsets. 17-20
- Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta: On Directed Graphs with an Upward Straight-line. 21-24
- Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme: Packing 2×2 unit squares into grid polygons is NP-complete. 33-36
- Michael M. Kazhdan, Nina Amenta, Shengyin Gu, David F. Wiley, Bernd Hamann: Symmetry Restoration by Stretching. 37-40
- Jürgen Bokowski, Vincent Pilaud: On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon. 41-44
- Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sarker: Generalized jewels and the point placement problem. 45-48
- Pavol Hell: Generalizations of Interval Graphs. 49
- Michael D. Adams: A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods. 51-54
- Chris Gray, Maarten Löffler, Rodrigo I. Silveira: Minimizing Slope Change in Imprecise 1.5D terrains. 55-58
- Ahmad Biniaz: Slope Preserving Terrain Simplification - An Experimental Study. 59-62
- Louis Theran: Rigid Components of Random Graphs. 63-66
- Audrey Lee-St. John, Ileana Streinu: Angular rigidity in 3D: combinatorial characterizations and algorithms. 67-70
- David Flores-Peñaloza, Francisco Javier Zaragoza Martínez: Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. 91-94
- Fabrizio Frati: Planar Packing of Diameter-Four Trees. 95-98
- Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. 99-102
- Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz: Computing Fréchet Distance with Speed Limits. 107-110
- Mark-Christoph Körner, Jack Brimberg, Henrik Juel, Anita Schöbel: General minisum circle location. 111-114
- Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou: Approximating Maximum Flow in Polygonal Domains using Spanners. 115-118
- Marc J. van Kreveld: Bold Graph Drawings. 119-122
- Leonidas J. Guibas: Intrinsic Multiscale Geometry. 127
- Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan: Data Structures for Reporting Extension Violations in a Query Range. 129-132
- Saladi Rahul, Prosenjit Gupta, K. S. Rajan: Data Structures for Range Aggregation by Categories. 133-136
- Minghui Jiang: An Inequality on the Edge Lengths of Triangular Meshes. 141-144
- Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke: Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? 145-148
- Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Kun Xu: Inapproximability of the Perimeter Defense Problem. 153-156
- Shiliang Cui, Iyad A. Kanj, Ge Xia: On the Dilation of Delaunay Triangulations of Points in Convex Position. 161-164
- Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma: The spanning ratio of the Delaunay triangulation is greater than pi/2. 165-167
- Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh: Relaxed Gabriel Graphs. 169-172
- Raimund Seidel: Teaching Computational Geometry, II. 173
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team