@String{cccg2002 = {Proceedings of the 14th Canadian Conference on
Computational Geometry (CCCG'02)}}
@InProceedings{cccg2002_0,
title = {A Machine Resolution of a Four-Color Hoax},
booktitle = cccg2002,
author = {Stan Wagon},
pages = {174--185},
url = {http://www.cccg.ca/proceedings/2002/stan.ps},
year = {2002},
}
@InProceedings{cccg2002_1,
title = {Cinderella: Computation, Complexity, Geometry},
booktitle = cccg2002,
author = {Ulrich Kortenkamp},
pages = {186--191},
url = {http://www.cccg.ca/proceedings/2002/ulrich.pdf},
year = {2002},
}
@InProceedings{cccg2002_2,
title = {{P}aul {E}rd{\"o}s Memorial Lecture},
booktitle = cccg2002,
author = {Luc Devroye},
url = {http://www.cccg.ca/proceedings/2002/luc.ps},
year = {2002},
}
@InProceedings{cccg2002_3,
title = {Proximate Point Searching},
booktitle = cccg2002,
author = {Erik D. Demaine and John Iacono and Stefan Langerman},
pages = {1--4},
url = {http://www.cccg.ca/proceedings/2002/22.ps},
year = {2002},
}
@InProceedings{cccg2002_4,
title = {Point Location Algorithms of Minimum Size},
booktitle = cccg2002,
author = {Valentina Damerow and Lukas Finschi and Martin Ziegler},
pages = {5--9},
url = {http://www.cccg.ca/proceedings/2002/08.ps},
url2 = {http://www.cccg.ca/proceedings/2002/08l.ps},
year = {2002},
}
@InProceedings{cccg2002_5,
title = {Using Simplicial Partitions to Determine a Closest Point to a Query Line},
booktitle = cccg2002,
author = {Asish Mukhopadhyay},
pages = {10--12},
url = {http://www.cccg.ca/proceedings/2002/06.ps},
year = {2002},
}
@InProceedings{cccg2002_6,
title = {On the Hardness of Turn-Angle-Restricted Rectilinear Cycle Cover Problems},
booktitle = cccg2002,
author = {Steph Durocher and David Kirkpatrick},
pages = {13--16},
url = {http://www.cccg.ca/proceedings/2002/05.ps},
year = {2002},
}
@InProceedings{cccg2002_7,
title = {Ordered Theta Graphs},
booktitle = cccg2002,
author = {Prosenjit Bose and Joachim Gudmundsson and Pat Morin},
pages = {17--21},
url = {http://www.cccg.ca/proceedings/2002/34.ps},
year = {2002},
}
@InProceedings{cccg2002_8,
title = {Logarithmic Path-Length in Space-Filling Curves},
booktitle = cccg2002,
author = {Jens-Michael Wierum},
pages = {22--26},
url = {http://www.cccg.ca/proceedings/2002/27.ps},
url2 = {http://www.cccg.ca/proceedings/2002/27l.ps},
year = {2002},
}
@InProceedings{cccg2002_9,
title = {On Flat-State Connectivity of Chains with Fixed Acute Angles},
booktitle = cccg2002,
author = {Greg Aloupis and Erik D. Demaine and Henk Meijer and Joseph O'Rourke and Ileana Streinu and Godfried Toussaint},
pages = {27--30},
url = {http://www.cccg.ca/proceedings/2002/16.ps},
year = {2002},
}
@InProceedings{cccg2002_10,
title = {PUSH-2-F is PSPACE-Complete},
booktitle = cccg2002,
author = {Erik D. Demaine and Robert A. Hearn and Michael Hoffman},
pages = {31--35},
url = {http://www.cccg.ca/proceedings/2002/31.ps},
year = {2002},
}
@InProceedings{cccg2002_11,
title = {Constructing Convex 3-Polytopes from Two Triangulations of a Polygon},
booktitle = cccg2002,
author = {Benjamin Marlin and Godfried Toussaint},
pages = {36--39},
url = {http://www.cccg.ca/proceedings/2002/28.ps},
url2 = {http://www.cccg.ca/proceedings/2002/28l.ps},
year = {2002},
}
@InProceedings{cccg2002_12,
title = {Hierarchical Planar Voronoi Diagram Approximations},
booktitle = cccg2002,
author = {I. Boada and N. Coll and J. A. Sellar{\`e}s},
pages = {40--44},
url = {http://www.cccg.ca/proceedings/2002/17.ps},
year = {2002},
}
@InProceedings{cccg2002_13,
title = {The Complexity of Flow Diagrams in the Plane},
booktitle = cccg2002,
author = {Joachim Giesen and Matthias John},
pages = {45--48},
url = {http://www.cccg.ca/proceedings/2002/30.ps},
year = {2002},
}
@InProceedings{cccg2002_14,
title = {On Sampling and Reconstructing Surfaces with Boundaries},
booktitle = cccg2002,
author = {M. Gopi},
pages = {49--53},
url = {http://www.cccg.ca/proceedings/2002/19.ps},
year = {2002},
}
@InProceedings{cccg2002_15,
title = {Efficient Answering of Polyhedral Queries in Rd Using BBS-Trees},
booktitle = cccg2002,
author = {K. Elbassioni and A. Elmasry and I. Kamel},
pages = {54--57},
url = {http://www.cccg.ca/proceedings/2002/01.ps},
year = {2002},
}
@InProceedings{cccg2002_16,
title = {Analysis of Half-Space Range Search Using the k-d Search Skip List},
booktitle = cccg2002,
author = {Mario A. Lopez and Bradford G. Nickerson},
pages = {58--62},
url = {http://www.cccg.ca/proceedings/2002/25.ps},
year = {2002},
}
@InProceedings{cccg2002_17,
title = {Connecting Points in the Presence of Obstacles in the Plane},
booktitle = cccg2002,
author = {Michael Hoffmann and Csaba D. T{\'o}th},
pages = {63--67},
url = {http://www.cccg.ca/proceedings/2002/18.ps},
year = {2002},
}
@InProceedings{cccg2002_18,
title = {Computing Signed Permutations of Polygons},
booktitle = cccg2002,
author = {Greg Aloupis and Prosenjit Bose and Erik D. Demaine and Stefan Langerman and Henk Meijer and Mark Overmars and Godfried T. Toussaint},
pages = {68--71},
url = {http://www.cccg.ca/proceedings/2002/23m.ps},
url2 = {http://www.cccg.ca/proceedings/2002/23l.ps},
year = {2002},
}
@InProceedings{cccg2002_19,
title = {An Exact Algebraic Predicate for Maintaining the Topology of the Voronoi Diagram for Circles},
booktitle = cccg2002,
author = {Francois Anton and David Kirkpatrick and Darka Mioc},
pages = {72--76},
url = {http://www.cccg.ca/proceedings/2002/21.ps},
year = {2002},
}
@InProceedings{cccg2002_20,
title = {Robust Algorithm for {$k$}-Gon Voronoi Diagram Construction},
booktitle = cccg2002,
author = {Zhenming Chen and Jinhui Xu},
pages = {77--81},
url = {http://www.cccg.ca/proceedings/2002/24new.ps},
year = {2002},
}
@InProceedings{cccg2002_21,
title = {A Reliable Algorithm for Computing the Generalized Voronoi Diagram for a Set of Spheres in the Euclidean d-dimensional Space},
booktitle = cccg2002,
author = {M. L. Gavrilova},
pages = {82--87},
url = {http://www.cccg.ca/proceedings/2002/33.ps},
year = {2002},
}
@InProceedings{cccg2002_22,
title = {Partitioning a Deformed Urban Grid},
booktitle = cccg2002,
author = {Leonard Hagger and Ian Sanders},
pages = {88--92},
url = {http://www.cccg.ca/proceedings/2002/12.ps},
url2 = {http://www.cccg.ca/proceedings/2002/12l.ps},
year = {2002},
}
@InProceedings{cccg2002_23,
title = {Exact and Approximation Algorithms for Computing a-fat Decompositions},
booktitle = cccg2002,
author = {Mirela Damian-Iordache},
pages = {93--96},
url = {http://www.cccg.ca/proceedings/2002/15.ps},
year = {2002},
}
@InProceedings{cccg2002_24,
title = {Partitioning Orthogonal Polygons into Fat Rectangles in Polynomial Time},
booktitle = cccg2002,
author = {Joseph O'Rourke and Geetika Tewari},
pages = {97--100},
url = {http://www.cccg.ca/proceedings/2002/04.ps},
year = {2002},
}
@InProceedings{cccg2002_25,
title = {Nonorthogonal Polyhedra Built from Rectangles},
booktitle = cccg2002,
author = {Melody Donoso and Joseph O'Rourke},
pages = {101--104},
url = {http://www.cccg.ca/proceedings/2002/14.ps},
year = {2002},
}
@InProceedings{cccg2002_26,
title = {Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles},
booktitle = cccg2002,
author = {Therese Biedl and Timothy M. Chan and Erik D. Demaine and Martin L. Demaine and Paul Nijjar and Ryuhei Uehara and Ming-wei Wang},
pages = {105--108},
url = {http://www.cccg.ca/proceedings/2002/C95.ps},
year = {2002},
}
@InProceedings{cccg2002_27,
title = {Cost-Optimal Quadtrees for Ray Shooting},
booktitle = cccg2002,
author = {Herv{\'e} Br{\"o}nnimann and Marc Glisse and David R. Wood},
pages = {109--112},
url = {http://www.cccg.ca/proceedings/2002/29.ps},
year = {2002},
}
@InProceedings{cccg2002_28,
title = {On the Number of Lines Tangent to Four Convex Polyhedra},
booktitle = cccg2002,
author = {H. Br{\"o}nnimann and O. Devillers and V. Dujmovic and H. Everett and M. Glisse and X. Goaoc and S. Lazard and H.-S. Na and S. Whitesides},
pages = {113--117},
url = {http://www.cccg.ca/proceedings/2002/C96.ps},
year = {2002},
}
@InProceedings{cccg2002_29,
title = {Computing Closest Points for Segments},
booktitle = cccg2002,
author = {Sergei Bespamyatnikh},
pages = {118--122},
url = {http://www.cccg.ca/proceedings/2002/20.ps},
year = {2002},
}
@InProceedings{cccg2002_30,
title = {A Sweep Line Algorithm for Nearest Neighbour Queries},
booktitle = cccg2002,
author = {Joao Dinis and Margarida Mamede},
pages = {123--127},
url = {http://www.cccg.ca/proceedings/2002/07.ps},
year = {2002},
}
@InProceedings{cccg2002_31,
title = {On Reverse Nearest Neighbor Queries},
booktitle = cccg2002,
author = {Anil Maheshwari and Jan Vahrenhold and Norbert Zeh},
pages = {128--132},
url = {http://www.cccg.ca/proceedings/2002/32.ps},
year = {2002},
}
@InProceedings{cccg2002_32,
title = {A Near-Quadratic Algorithm for the Alpha-Connected Two-Center Decision Problem},
booktitle = cccg2002,
author = {P. H. Huang and Y. T. Tsai and C. Y. Tang},
pages = {133--136},
url = {http://www.cccg.ca/proceedings/2002/36.ps},
year = {2002},
}
@InProceedings{cccg2002_33,
title = {Searching for the Center of a Circle},
booktitle = cccg2002,
author = {T. Biedl and M. Hasan and J. D. Horton and A. L{\'o}pez-Ortiz and T. Vinar},
pages = {137--141},
url = {http://www.cccg.ca/proceedings/2002/C98.ps},
year = {2002},
}
@InProceedings{cccg2002_34,
title = {Light Edges in Degree-Constrained Graphs},
booktitle = cccg2002,
author = {Prosenjit Bose and Michiel Smid and David R. Wood},
pages = {142--145},
url = {http://www.cccg.ca/proceedings/2002/35.ps},
year = {2002},
}
@InProceedings{cccg2002_35,
title = {Drawing K2,n: A Lower Bound},
booktitle = cccg2002,
author = {Therese Biedl and Timothy M. Chan and Alejandro L{\'o}pez-Ortiz},
pages = {146--148},
url = {http://www.cccg.ca/proceedings/2002/C99.ps},
year = {2002},
}
@InProceedings{cccg2002_36,
title = {Drawing Series-Parallel Graphs on a Box},
booktitle = cccg2002,
author = {Emilio Di Giacomo and Giuseppe Liotta and Stephen K. Wismath},
pages = {149--153},
url = {http://www.cccg.ca/proceedings/2002/C97.ps},
year = {2002},
}
@InProceedings{cccg2002_37,
title = { A Linear Algorithm for Compact Box-Drawings of Trees},
booktitle = cccg2002,
author = {Masud Hasan and Md. Saidur Rahman and Takao Nishizeki},
pages = {154--157},
url = {http://www.cccg.ca/proceedings/2002/C94.ps},
year = {2002},
}
@InProceedings{cccg2002_38,
title = {Convexity Minimizes Pseudo-Triangulations},
booktitle = cccg2002,
author = {Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser and Bettina Speckmann},
pages = {158--161},
url = {http://www.cccg.ca/proceedings/2002/03.ps},
year = {2002},
}
@InProceedings{cccg2002_39,
title = {Enumerating Pseudo-Triangulations in the Plane},
booktitle = cccg2002,
author = {Sergei Bespamyatnikh},
pages = {162--166},
url = {http://www.cccg.ca/proceedings/2002/10.ps},
year = {2002},
}
@InProceedings{cccg2002_40,
title = {Asymptotically Efficient Triangulations of the d-cube},
booktitle = cccg2002,
author = {David Orden and Francisco Santos},
pages = {167--169},
url = {http://www.cccg.ca/proceedings/2002/02.ps},
year = {2002},
}
@InProceedings{cccg2002_41,
title = {Constructing Differentiable Homeomorphisms Between Isomorphic Triangulations},
booktitle = cccg2002,
author = {Frederick Crimins and Diane Souvaine},
pages = {170--173},
url = {http://www.cccg.ca/proceedings/2002/13.ps},
year = {2002},
}
@InProceedings{cccg2002_42,
title = {Open Problems from CCCG 2001},
booktitle = cccg2002,
author = {Erik Demaine and Joseph O'Rourke},
url = {http://www.cs.uleth.ca/~wismath/cccg/papers/open.ps},
url2 = {http://www.cs.uleth.ca/~wismath/cccg/papers/open.pdf},
year = {2002}
}