19. CCCG 2007:
Carleton University, Ottawa, Canada
Prosenjit Bose (Ed.):
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada.
Carleton University, Ottawa, Canada 2007, ISBN 978-0-7709-0520-0 
Invited Talks
Session 1A
- Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections.
9-11
- Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
13-16
- Steven Bitner, Ovidiu Daescu:
Finding Segments and Triangles Spanned by Points in R3.
17-20
- Val Pinciu:
On the Fewest Nets Problem for Convex Polyhedra.
21-24
- Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets.
25-28
Session 1B
Session 3A
Session 3B
Session 4A
Session 4B
Session 5A
Session 5B
- Boaz Ben-Moshe, Liad Serruya, Ariel Shamir:
Image Compression Terrain Simplification.
125-128
- Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky:
Distance Preserving Terrain Simplification - An Experimental Study.
129-132
- Suddha Basu, Jack Snoeyink:
Terrain Representation using Right-Triangulated Irregular Networks.
133-136
- Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint:
Vertex Pops and Popturns.
137-140
- Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian:
On Rolling Cube Puzzles.
141-144
Session 7A
Session 7B
Session 8A
- Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stefanie Wuhrer:
Approximations of Geodesic Distances for Incomplete Triangular Manifolds.
177-180
- Dror Aiger, Klara Kedem:
Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations.
181-184
- Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
Linear-Space Algorithms for Distance Preserving Embedding.
185-188
Session 8B
Session 9A
- Cem Boyaci, Hale Erten, Alper Üngör:
Triangulations Loosing Bundles and Weight.
201-204
- Hale Erten, Alper Üngör:
Computing Acute and Non-obtuse Triangulations.
205-208
- Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations.
209-212
- Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Largest Subsets of Triangles in a Triangulation.
213-216
- Masaki Moriguchi, Kokichi Sugihara:
Restricted Edge Contractions in Triangulations of the Sphere with Boundary.
217-220
Session 9B
- Shabnam Aziza, Therese C. Biedl:
Improved Layouts of the Multigrid Network.
221-224
- Fabrizio Frati:
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area.
225-228
- Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu:
On Bus Graph Realizability.
229-232
- Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta:
Homothetic Triangle Contact Representations of Planar Graphs.
233-236
- Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
Pointed Drawings of Planar Graphs.
237-240
Session 11A
Session 11B
Session 12
Open Problems Session
Last update Sat May 18 18:12:53 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
