This list is also available as a
BibTeX
file.

 1

Anna Lubiw.
Morphing planar graph drawings.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), page 1, 2007.
URL http://cccg.ca/proceedings/2007/001.pdf.
 2

Géza Tóth.
Note on the paircrossing number and the oddcrossing number.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 36, 2007.
URL http://cccg.ca/proceedings/2007/002.pdf.
 3

Otfried Cheong.
The harmony of spheres.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), page 7, 2007.
URL http://cccg.ca/proceedings/2007/003.pdf.
 4

Esther M. Arkin, Joseph S. B. Mitchell, and Jack Snoeyink.
Capturing crossings: Convex hulls of segment and plane intersections.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 911, 2007.
URL http://cccg.ca/proceedings/2007/01a1.pdf.
 5

Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood
Ishaque, Diane L. Souvaine, and Csaba D. Tóth.
Disjoint segments have convex partitions with 2edge connected dual
graphs.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 1316, 2007.
URL http://cccg.ca/proceedings/2007/01a2.pdf.
URL http://cccg.ca/proceedings/2007/01a2full.pdf.
 6

Steven Bitner and Ovidiu Daescu.
Finding segments and triangles spanned by points in r.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 1720, 2007.
URL http://cccg.ca/proceedings/2007/01a3.pdf.
 7

Val Pinciu.
On the fewest nets problem for convex polyhedra.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 2124, 2007.
URL http://cccg.ca/proceedings/2007/01a4.pdf.
 8

Michael Langberg and Leonard J. Schulman.
Contraction and expansion of convex sets.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 2528, 2007.
URL http://cccg.ca/proceedings/2007/01a5.pdf.
URL http://cccg.ca/proceedings/2007/01a5full.pdf.
 9

Eyal Ackerman, Oswin Aichholzer, and Balázs Keszegh.
Improved upper bounds on the reflexivity of point sets.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 2932, 2007.
URL http://cccg.ca/proceedings/2007/01b1.pdf.
URL http://cccg.ca/proceedings/2007/01b1full.pdf.
 10

Boaz BenMoshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, and Qiaosheng
Shi.
Computing a planar widest empty alphasiphon in o(n)
time.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 3336, 2007.
URL http://cccg.ca/proceedings/2007/01b2.pdf.
URL http://cccg.ca/proceedings/2007/01b2full.pdf.
 11

Marc J. van Kreveld and Bettina Speckmann.
On the number of empty pseudotriangles in point sets.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 3740, 2007.
URL http://cccg.ca/proceedings/2007/01b3.pdf.
 12

Stefan Näher and Martin Taphorn.
Experimental evaluation of structural filtering as a tool for exact
and efficient geometric computing.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 4144, 2007.
URL http://cccg.ca/proceedings/2007/01b4.pdf.
URL http://cccg.ca/proceedings/2007/01b4full.pdf.
 13

Marc Mörig and Stefan Schirra.
On the design and performance of reliable geometric predicates using
errorfree transformations and exact sign of sum algorithms.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 4548, 2007.
URL http://cccg.ca/proceedings/2007/01b5.pdf.
URL http://cccg.ca/proceedings/2007/01b5full.pdf.
 14

Prosenjit Bose and Jason Morrison.
Optimal point set partitioning using rigid motion star placement.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 4952, 2007.
URL http://cccg.ca/proceedings/2007/03a1.pdf.
 15

Boaz BenMoshe and Yefim Dinitz.
Fast additive constant approximation algorithms for the safe deposit
boxes problem with two and three currencies.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 5356, 2007.
URL http://cccg.ca/proceedings/2007/03a2.pdf.
URL http://cccg.ca/proceedings/2007/03a2full.pdf.
 16

Jonathan Lenchner.
An improved bound for the affine sylvester problem.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 5760, 2007.
URL http://cccg.ca/proceedings/2007/03a3.pdf.
 17

Asish Mukhopadhyay and Eugene Greene.
The ordinary line problem revisited.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 6164, 2007.
URL http://cccg.ca/proceedings/2007/03a4.pdf.
 18

David Letscher.
Reconstructing submanifolds of euclidean space.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 6568, 2007.
URL http://cccg.ca/proceedings/2007/03b1.pdf.
 19

SheungHung Poon.
On unfolding trees and polygons on various lattices.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 6972, 2007.
URL http://cccg.ca/proceedings/2007/03b2.pdf.
URL http://cccg.ca/proceedings/2007/03b2full.pdf.
 20

Marcus Schaefer, Eric Sedgwick, and Daniel Stefankovic.
Spiralling and folding: The topological view.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 7376, 2007.
URL http://cccg.ca/proceedings/2007/03b3.pdf.
 21

Alex Benton and Joseph O'Rourke.
Unfolding polyhedra via cuttree truncation.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 7780, 2007.
URL http://cccg.ca/proceedings/2007/03b4.pdf.
URL http://cccg.ca/proceedings/2007/03b4full.pdf.
 22

Steven Bitner and Ovidiu Daescu.
Minimumsum dipolar spanning tree for points in r.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 8184, 2007.
URL http://cccg.ca/proceedings/2007/04a1.pdf.
 23

Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport,
and Henry Xiao.
Hamilton circuits in hexagonal grid graphs.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 8588, 2007.
URL http://cccg.ca/proceedings/2007/04a2.pdf.
 24

Therese C. Biedl.
Realizations of hexagonal graph representations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 8992, 2007.
URL http://cccg.ca/proceedings/2007/04a3.pdf.
 25

Matthew J. Katz, Nissan LevTov, and Gila Morgenstern.
Conflictfree coloring of points on a line with respect to a set of
intervals.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 9396, 2007.
URL http://cccg.ca/proceedings/2007/04b1.pdf.
 26

Balázs Keszegh.
Weak conflictfree colorings of point sets and simple regions.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 97100, 2007.
URL http://cccg.ca/proceedings/2007/04b2.pdf.
 27

Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, and Anna Lubiw.
A lower bound on the area of a 3coloured disc packing.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 101104, 2007.
URL http://cccg.ca/proceedings/2007/04b3.pdf.
URL http://cccg.ca/proceedings/2007/04b3full.pdf.
 28

Joachim Giesen, Balint Miklos, and Mark Pauly.
Medial axis approximation of planar shapes from union of balls: A
simpler and more robust algorithm.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 105108, 2007.
URL http://cccg.ca/proceedings/2007/05a1.pdf.
URL http://cccg.ca/proceedings/2007/05a1full.pdf.
 29

Martin Brooks and Liam Watson.
Simplification of scalar data via monotonelight factorizations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 109112, 2007.
URL http://cccg.ca/proceedings/2007/05a2.pdf.
 30

Audrey Lee, Ileana Streinu, and Louis Theran.
The sliderpinning problem.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 113116, 2007.
URL http://cccg.ca/proceedings/2007/05a3.pdf.
 31

Sören Laue and Domagoj Matijevic.
Approximating khop minimum spanning trees in euclidean metrics.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 117120, 2007.
URL http://cccg.ca/proceedings/2007/05a4.pdf.
URL http://cccg.ca/proceedings/2007/05a4full.pdf.
 32

Zhiyong Lin.
Terminal steiner tree with bounded edge length.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 121123, 2007.
URL http://cccg.ca/proceedings/2007/05a5.pdf.
URL http://cccg.ca/proceedings/2007/05a5full.pdf.
 33

Boaz BenMoshe, Liad Serruya, and Ariel Shamir.
Image compression terrain simplification.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 125128, 2007.
URL http://cccg.ca/proceedings/2007/05b1.pdf.
URL http://cccg.ca/proceedings/2007/05b1full.pdf.
 34

Boaz BenMoshe, Matthew J. Katz, and Igor Zaslavsky.
Distance preserving terrain simplification  an experimental study.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 129132, 2007.
URL http://cccg.ca/proceedings/2007/05b2.pdf.
URL http://cccg.ca/proceedings/2007/05b2full.pdf.
 35

Suddha Basu and Jack Snoeyink.
Terrain representation using righttriangulated irregular networks.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 133136, 2007.
URL http://cccg.ca/proceedings/2007/05b3.pdf.
 36

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, and Godfried T. Toussaint.
Vertex pops and popturns.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 137140, 2007.
URL http://cccg.ca/proceedings/2007/05b4.pdf.
 37

Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania
ElKhechen, Sándor P. Fekete, Christian Knauer, André Schulz, and
Perouz Taslakian.
On rolling cube puzzles.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 141144, 2007.
URL http://cccg.ca/proceedings/2007/05b5.pdf.
URL http://cccg.ca/proceedings/2007/05b5full.pdf.
 38

Binay K. Bhattacharya and Jeff Sember.
Efficient snap rounding with integer arithmetic.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 145148, 2007.
URL http://cccg.ca/proceedings/2007/07a1.pdf.
URL http://cccg.ca/proceedings/2007/07a1full.pdf.
 39

Eli Packer.
Extending the power of snap rounding variants.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 149152, 2007.
URL http://cccg.ca/proceedings/2007/07a2.pdf.
 40

Peyman Afshani and Arash Farzan.
Cacheoblivious outputsensitive twodimensional convex hull.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 153155, 2007.
URL http://cccg.ca/proceedings/2007/07a3.pdf.
 41

Artur Czumaj, Gereon Frahling, and Christian Sohler.
Efficient kinetic data structures for maxcut.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 157160, 2007.
URL http://cccg.ca/proceedings/2007/07a4.pdf.
 42

Rodrigo I. Silveira and Marc J. van Kreveld.
Towards a definition of higher order constrained delaunay
triangulations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 161164, 2007.
URL http://cccg.ca/proceedings/2007/07b1.pdf.
 43

David Letscher.
Vector weighted anisotropic voronoi diagrams and delaunay
traingulations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 165168, 2007.
URL http://cccg.ca/proceedings/2007/07b2.pdf.
 44

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, and Sandip Das.
Covering points by isothetic unit squares.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 169172, 2007.
URL http://cccg.ca/proceedings/2007/07b3.pdf.
 45

Trung Nguyen, JeanDaniel Boissonnat, Frédéric Falzon, and Christian
Knauer.
A diskcovering problem with application in optical interferometry.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 173176, 2007.
URL http://cccg.ca/proceedings/2007/07b4.pdf.
URL http://cccg.ca/proceedings/2007/07b4full.pdf.
 46

Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, and Stefanie Wuhrer.
Approximations of geodesic distances for incomplete triangular
manifolds.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 177180, 2007.
URL http://cccg.ca/proceedings/2007/08a2.pdf.
URL http://cccg.ca/proceedings/2007/08a2full.pdf.
 47

Dror Aiger and Klara Kedem.
Exact and approximate geometric pattern matching for point sets in
the plane under similarity transformations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 181184, 2007.
URL http://cccg.ca/proceedings/2007/08a2.pdf.
URL http://cccg.ca/proceedings/2007/08a2full.pdf.
 48

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel
H. M. Smid, and Stefanie Wuhrer.
Linearspace algorithms for distance preserving embedding.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 185188, 2007.
URL http://cccg.ca/proceedings/2007/08a3.pdf.
 49

Sasanka Roy, Sachin Lodha, Sandip Das, and Anil Maheshwari.
Approximate shortest descent path on a terrain.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 189192, 2007.
URL http://cccg.ca/proceedings/2007/08b1.pdf.
URL http://cccg.ca/proceedings/2007/08b1full.pdf.
 50

Ethan Kim, Sue Whitesides, and Giuseppe Liotta.
A note on drawing directionconstrained paths in 3d.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 193196, 2007.
URL http://cccg.ca/proceedings/2007/08b2.pdf.
 51

Yury Kholondyrev and William Evans.
Optimistic and pessimistic shortest paths on uncertain terrains.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 197200, 2007.
URL http://cccg.ca/proceedings/2007/08b3.pdf.
 52

Cem Boyaci, Hale Erten, and Alper Üngör.
Triangulations loosing bundles and weight.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 201204, 2007.
URL http://cccg.ca/proceedings/2007/09a1.pdf.
URL http://cccg.ca/proceedings/2007/09a1full.pdf.
 53

Hale Erten and Alper Üngör.
Computing acute and nonobtuse triangulations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 205208, 2007.
URL http://cccg.ca/proceedings/2007/09a2.pdf.
 54

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, and Bettina Speckmann.
On (pointed) minimum weight pseudotriangulations.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 209212, 2007.
URL http://cccg.ca/proceedings/2007/09a3.pdf.
 55

Boris Aronov, Marc J. van Kreveld, Maarten Löffler, and Rodrigo I.
Silveira.
Largest subsets of triangles in a triangulation.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 213216, 2007.
URL http://cccg.ca/proceedings/2007/09a4.pdf.
 56

Masaki Moriguchi and Kokichi Sugihara.
Restricted edge contractions in triangulations of the sphere with
boundary.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 217220, 2007.
URL http://cccg.ca/proceedings/2007/09a5.pdf.
 57

Shabnam Aziza and Therese C. Biedl.
Improved layouts of the multigrid network.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 221224, 2007.
URL http://cccg.ca/proceedings/2007/09b1.pdf.
 58

Fabrizio Frati.
Straightline drawings of outerplanar graphs in o(dn log n) area.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 225228, 2007.
URL http://cccg.ca/proceedings/2007/09b2.pdf.
URL http://cccg.ca/proceedings/2007/09b2full.pdf.
 59

Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli
Heilala, Ethan Kim, Jonathan Li On Wing, LouisFrancois PrevilleRatelle, Sue
Whitesides, and Nuo Yu.
On bus graph realizability.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 229232, 2007.
URL http://cccg.ca/proceedings/2007/09b3.pdf.
 60

Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan
Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio
Patrignani, and Francesco Trotta.
Homothetic triangle contact representations of planar graphs.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 233236, 2007.
URL http://cccg.ca/proceedings/2007/09b4.pdf.
URL http://cccg.ca/proceedings/2007/09b4full.pdf.
 61

Oswin Aichholzer, Günter Rote, André Schulz, and Birgit Vogtenhuber.
Pointed drawings of planar graphs.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 237240, 2007.
URL http://cccg.ca/proceedings/2007/09b5.pdf.
 62

Pengpeng Wang, Ramesh Krishnamurti, and Kamal Gupta.
Generalized watchman route problem with discrete view cost.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 241244, 2007.
URL http://cccg.ca/proceedings/2007/11a1.pdf.
URL http://cccg.ca/proceedings/2007/11a1full.pdf.
 63

Stephen Bahun and Anna Lubiw.
Optimal schedules for 2guard room search.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 245248, 2007.
URL http://cccg.ca/proceedings/2007/11a2.pdf.
URL http://cccg.ca/proceedings/2007/11a2full.pdf.
 64

AmirAli Khosravi, Alireza Zarei, and Mohammad Ghodsi.
Efficient visibility maintenance of a moving segment observer inside
a simple polygon.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 249252, 2007.
URL http://cccg.ca/proceedings/2007/11a3.pdf.
 65

Arturo GonzalezGutierrez and Teofilo F. Gonzalez.
Approximation algorithms for the minimumlength corridor and related
problems.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 253256, 2007.
URL http://cccg.ca/proceedings/2007/11b1.pdf.
 66

Pierre Kraemer, David Cazier, and Dominique Bechmann.
A general and efficient representation for multiresolution meshes:
Application to quad/triangle subdivision.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 257260, 2007.
URL http://cccg.ca/proceedings/2007/11b2.pdf.
 67

Roman Rolinsky and François Dupret.
Practical c reparametrization of piecewise rational
bézier curves.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 261264, 2007.
URL http://cccg.ca/proceedings/2007/11b3.pdf.
 68

Asish Mukhopadhyay and Eugene Greene.
On a geometric approach to the segment sum problem and its
generalization.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 265268, 2007.
URL http://cccg.ca/proceedings/2007/12a1.pdf.
URL http://cccg.ca/proceedings/2007/12a1full.pdf.
 69

Amr Elmasry and Kazuhisa Makino.
Finding intersections of bichromatic segments defined by points.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 269272, 2007.
URL http://cccg.ca/proceedings/2007/12a2.pdf.
 70

Arindam Karmakar, Sasanka Roy, and Sandip Das.
Fast computation of smallest enclosing circle with center on a query
line segment.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG2007), pages 273276, 2007.
URL http://cccg.ca/proceedings/2007/12a3.pdf.
CCCG Website
20081028