Accepted Papers (in no particular order)

Home

Submission
Accepted Papers
Program
Fees and Registration
Accomodation
Travel Information
Halifax
Contact
  • Bibtex entries of all conference papers

  • On Polyhedra Induced by Point Sets in Space
    Ferran Hurtado, Godfried Toussaint, and Joan Trias
    (ps, pdf, bibtex entry)

  • The spanning ratios of Beta-Skeleton
    Weizhao Wang, Xiang-Yang Li, Yu Wang, and Wen-Zhan Song
    (ps, pdf, bibtex entry)

  • Encoding Quadrilateral Meshes
    Asish Mukhopadhyay and Quanbin Jing
    (ps, pdf, bibtex entry)

  • Decomposing Polygons Into Diameter Bounded Components
    Chris Worman
    (ps, pdf, bibtex entry)

  • Linear Binary Space Partitions and Hierarchy of Object Classes
    Petr Tobola and Karel Nechvile
    (ps, pdf, bibtex entry)

  • Computing a closest point to a circular ring
    Pinaki Mitra, Asish Mukhopadhyay, and S.Veerabhadreshawra Rao
    (ps, pdf, bibtex entry)

  • On the worst-case complexity of the silhouette of a polytope
    Helmut Alt, Marc Glisse, and Xavier Goaoc
    (ps, pdf, bibtex entry)

  • Planar case of the maximum box and related problems
    Ying Liu and Mikhail Nediak
    (ps, pdf, bibtex entry)

  • Estimation of the necessary number of points in Riemannian Voronoi diagram
    Kensuke Onishi and Jin-ichi Itoh
    (ps, pdf, bibtex entry)

  • A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering
    Karen Daniels, Arti Mathur, and Roger Grinde
    (ps, pdf, bibtex entry)

  • Approximating the Geometric Minimum-Diameter Spanning Tree
    Michael Spriggs, Mark Keil, Sergei Bespamyatnikh, Michael Segal, and Jack Snoeyink
    (ps, pdf, bibtex entry)

  • On Shortest Paths in Line Arrangements
    T. Kavitha and Kasturi Varadarajan
    (ps, pdf, bibtex entry)

  • Curves of Width One and the River Shore Problem
    Timothy M. Chan, Alexander Golynski, Alejandro Lopez-Ortiz, and Claude-Guy Quimper
    (ps, pdf, bibtex entry)

  • An Algorithm for the MaxMin Area Triangulation of a Convex Polygon
    J. Mark Keil and Tzvetalin Vassilev
    (ps, pdf, bibtex entry)

  • Parallel Morphing of Trees and Cycles
    Therese Biedl, Anna Lubiw, and Michael Spriggs
    (ps, pdf, bibtex entry)

  • On the parameterized complexity of a generalized Rush Hour puzzle
    Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, and Klaus Reinhardt
    (ps, pdf, bibtex entry)

  • On Exact Solution for a Point-Location Problem in a System of d-dimensional Hyperbolic Surfaces
    Sergei Bespamyatnikh and Marina Gavrilova
    (ps, pdf, bibtex entry)

  • Coloring Objects Built From Bricks
    Suzanne Gallagher and Joseph O'Rourke
    (ps, pdf, bibtex entry)

  • An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon
    Anna Medvedeva and Asish Mukhopadhyay
    (ps, pdf, bibtex entry)

  • Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
    Mirela Damian and Joseph O'Rourke
    (ps, pdf, bibtex entry)

  • A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron
    Ian Hsieh, Kiat-Choong Chen, and Cao An Wang
    (ps, pdf, bibtex entry)

  • A Space-Efficient Algorithm for Segment Intersection
    Eric Chen and Timothy Chan
    (ps, pdf, bibtex entry)

  • Equiprojective Polyhedra
    Masud Hasan and Anna Lubiw
    (ps, pdf, bibtex entry)

  • Degree Bounds for Constrained Pseudo-Triangulations
    Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, and Csaba David Tóth
    (ps, pdf, bibtex entry)

  • On the Complexity of Halfspace Volume Queries
    Erik D. Demaine, Jeff Erickson, and Stefan Langerman
    (ps, pdf, bibtex entry)

  • Computing Delaunay Triangulation with Imprecise Input Data
    Ali Khanban and Abbas Edalat
    (ps, pdf, bibtex entry)

  • The Strange Complexity of Constrained Delaunay Triangulation
    Nicolas Grislain and Jonathan Shewchuk
    (ps, pdf, bibtex entry)

  • The Gaussian Centre of a Set of Mobile Points
    Steph Durocher and David Kirkpatrick
    (ps, pdf, bibtex entry)

  • Computing the Similarity of two Melodies
    Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, and Godfried Toussaint
    (ps, pdf, bibtex entry)

  • On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation
    Jaeil Choi and Andrzej Szymczak
    (ps, pdf, bibtex entry)

  • Sufficiently Fat Polyhedra are Not 2-Castable
    Alexander Golynski and David Bremner
    (ps, pdf, bibtex entry)

  • Hinged Dissection of Polygons is Hard
    Robert Hearn, Erik Demaine, and Greg Frederickson
    (ps, pdf, bibtex entry)

  • Triangle Guarding
    Jocelyn Smith and William Evans
    (ps, pdf, bibtex entry)

  • Molecular graphs of a finite points set : a generalization of the Delaunay triangulation
    Melkemi Mahmoud
    (ps, pdf, bibtex entry)

  • Shortest Paths in Two Intersecting Pencils of Lines
    David Hart
    (ps, pdf, bibtex entry)

  • On the number of transversals to line segments in R^3
    Herve Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, and Sue Whitesides
    (ps, pdf, bibtex entry)

  • Network Design Subject to Facility Location
    Laxmi Gewali, Joy Bhadury, and Ramaswamy Chandrasekaran
    (ps, pdf, bibtex entry)

  • A Constant Approximation Algorithm for Maximum Weight Triangulation
    Shiyan Hu
    (ps, pdf, bibtex entry)

  • On the Number of Pseudo-Triangulations of Certain Point Sets
    Oswin Aichholzer, David Orden, Francisco Santos, and Bettina Speckmann
    (ps, pdf, bibtex entry)

  • Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard
    Tetsuo Asano, David Kirkpatrick, and Chee Yap
    (ps, pdf, bibtex entry)

  • Multidimensional Orthogonal Range Search Using Tries
    Lingke Bu and Bradford Nickerson
    (ps, pdf, bibtex entry)

  08-Jan-2004 / cccg@cs.dal.ca