@String{cccg2003 = {Proceedings of the 15th Canadian Conference on
	Computational Geometry (CCCG'03)}}

@inproceedings{dmg-acmc-03
, author = {Karen Daniels and Arti Mathur and Roger Grinde}
, title = {A combinatorial maximum cover approach to {2D} translational geometric covering}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {2--5}
}

@inproceedings{fhnr-opcg-03
, author = {Henning Fernau and Torben Hagerup and Naomi Nishimura and Prabhakar Ragde and Klaus Reinhardt}
, title = {On the parameterized complexity of the generalized rush hour puzzle}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {6--9}
}

@inproceedings{aky-mtlr-03
, author = {Tetsuo Asano and David Kirkpatrick and Chee Yap}
, title = {Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is {NP-hard}}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {10--13}
}

@inproceedings{ln-pcmb-03
, author = {Ying Liu and Mikhail Nediak}
, title = {Planar case of the maximum box and related problems}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {14--18}
}

@inproceedings{oi-ennp-03
, author = {Kensuke Onishi and Jin-ichi Itoh}
, title = {Estimation of the necessary number of points in {Riemannian} {Voronoi}}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {19--24}
}

@inproceedings{mm-ailt-03
, author = {Anna Medvedeva and Asish Mukhopadhyay}
, title = {An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {25--28}
}

@inproceedings{bls-pmtc-03
, author = {Therese Biedl and Anna Lubiw and Michael J. Spriggs}
, title = {Parallel morphing of trees and cycles}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {29--34}
}

@inproceedings{wlws-tsrb-03
, author = {Weizhao Wang and Xiang-Yang Li and Yu Wang and Wen-Zhan Song}
, title = {The spanning ratios of $\beta$-Skeleton}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {35--38}
}

@inproceedings{skbss-agmd-03
, author = {Michael J. Spriggs. and J. Mark Keil and Sergei Bespamyatnikh and Michael Segal and Jack Snoeyink}
, title = {Approximating the geometric minimum-diameter spanning tree}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {39--42}
}

@inproceedings{do-prpc-03
, author = {Mirela Damian and Joseph O'Rourke}
, title = {Partitioning Regular Polygons into Circular Pieces I: Convex Partitions}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {43--46}
}

@inproceedings{hl-ep-03
, author = {Masud Hasan and Anna Lubiw}
, title = {Equiprojective Polyhedra}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {47--50}
}

@inproceedings{agg-owcc-03
, author = {Helmut Alt and Marc Glisse and Xavier Goaoc}
, title = {On the worst-case complexity of the silhouette of a polytope}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {51--55}
}

@inproceedings{go-cobb-03
, author = {Suzanne Gallagher and Joseph O'Rourke}
, title = {Coloring Objects Built From Bricks}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {56--59}
}

@inproceedings{mj-eqm-03
, author = {Asish Mukhopadhyay and Quanbin Jing}
, title = {Encoding Quadrilateral Meshes}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {60--63}
}

@inproceedings{tn-lbsp-03
, author = {Petr Tobola and Karel Nechvile}
, title = {Linear Binary Space Partitions and the Hierarchy of Object Classes}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {64--67}
}

@inproceedings{cc-asea-03
, author = {Eric Chen and Timothy Chan}
, title = {A Space-Efficient Algorithm for Segment Intersection}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {68--71}
}

@inproceedings{cglq-cwor-03
, author = {Timothy M. Chan and Alexander Golynski and Alejandro L{\'o}pez-Ortiz and Claude-Guy Quimper}
, title = {Curves of width one and the river shore problem}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {73--75}
}

@inproceedings{se-tg-03
, author = {Jocelyn Smith and William Evans}
, title = {Triangle Guarding}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {76--80}
}

@inproceedings{aflm-cstm-03
, author = {Greg Aloupis and Thomas Fevens and Stefan Langerman and Tomomi Matsui and Antonio Mesa and David Rappaport and Godfried Toussaint}
, title = {Computing the Similarity of two Melodies}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {81--84}
}

@inproceedings{m-mgfp-03
, author = {Melkemi Mahmoud}
, title = {Molecular graphs of a finite points set: a generalization of the {Delaunay} triangulation}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {85--88}
}

@inproceedings{gs-tscc-03
, author = {Nicolas Grislain and Jonathan Richard Shewchuk}
, title = {The Strange Complexity of Constrained {Delaunay} Triangulation}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {89--93}
}

@inproceedings{ke-cdti-03
, author = {Ali Khanban and Abbas Edalat}
, title = {Computing {Delaunay} Triangulation with Imprecise Input Data}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {94--97}
}

@inproceedings{hdf-hdph-03
, author = {Robert Hearn and Erik Demaine and Greg Frederickson}
, title = {Hinged Dissection of Polygons is Hard}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {98--102}
}

@inproceedings{w-dpdb-03
, author = {Chris Worman}
, title = {Decomposing Polygons Into Diameter Bounded Components}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {103--106}
}

@inproceedings{htt-opip-03
, author = {Ferran Hurtado, Godfried Toussaint, and Joan Trias}
, title = {On Polyhedra Induced by Point Sets in Space}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {107--110}
}

@inproceedings{cs-ocra-03
, author = {Jaeil Choi and Andrzej Szymczak}
, title = {On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {111--114}
}

@inproceedings{hcw-agam-03
, author = {Ian Hsieh and Kiat-Choong Chen and Cao An Wang}
, title = {A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {115--119}
}

@inproceedings{gb-sfpn-03
, author = {Alexander Golynski and David Bremner}
, title = {Sufficiently Fat Polyhedra are Not 2-Castable}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {120--122}
}

@inproceedings{dk-tgcs-03
, author = { Steph Durocher and David Kirkpatrick}
, title = {The Gaussian Centre of a Set of Mobile Points}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {123--127}
}

@inproceedings{gbc-ndsf-03
, author = {Laxmi Gewali and Joy Bhadury and Ramaswamy Chandrasekaran}
, title = {Network Design Subject to Facility Location}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {128--131}
}

@inproceedings{mmr-ccpc-03
, author = {Pinaki Mitra and Asish Mukhopadhyay and S. V. Rao}
, title = {Computing the Closest Point to a Circle}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {132--135}
}

@inproceedings{gb-oespl-03
, author = {Marina Gavrilova and Sergei Bespamyatnikh}
, title = {On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {136--139}
}

@inproceedings{aoss-onpt-03
, author = {Oswin Aichholzer, David Orden, Francisco Santos, and Bettina Speckmann}
, title = {On the Number of Pseudo-Triangulations of Certain Point Sets}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {141--144}
}

@inproceedings{kv-aama-03
, author = {J. Mark Keil and Tzvetalin Vassilev}
, title = {An algorithm for the {MaxMin} area triangulation of a convex polygon}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {145--149}
}

@inproceedings{h-acaa-03
, author = {Shiyan Hu}
, title = {A Constant Approximation Algorithm for Maximum Weight Triangulation}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {150--154}
}

@inproceedings{ahst-dbcp-03
, author = {Oswin Aichholzer and Michael Hoffmann and Bettina Speckmann and Csaba David T\'oth}
, title = {Degree Bounds for Constrained Pseudo-Triangulations}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {155--158}
}

@inproceedings{del-ochv-03
, author = {Erik D. Demaine and Jeff Erickson and Stefan Langerman}
, title = {On the Complexity of Halfspace Volume Queries}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {159--160}
}

@inproceedings{bn-mors-03
, author = {Lingke Bu and Bradford Nickerson}
, title = {Multidimensional Orthogonal Range Search Using Tries}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {161--165}
}

@inproceedings{h-spti-03
, author = {David Hart}
, title = {Shortest Paths in Two Intersecting Pencils of Lines}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {166--169}
}

@inproceedings{kv-ospl-03
, author = {T. Kavitha and Kasturi Varadarajan}
, title = {On shortest paths in line arrangements}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {170--173}
}

@inproceedings{bels-tlsr-03
, author = {Herve Br{\}o}nnimann and Hazel Everett and Sylvain Lazard and Frank Sottile and Sue Whitesides}
, title = {Transversals to line segments in $\mathbb{R}^3$}
, booktitle = cccg2003
, site = {Halifax}
, year = 2003
, pages = {174--177}
}