15. CCCG 2003:
Halifax,
Nova Scotia,
Canada
Proceedings of the 15th Canadian Conference on Computational Geometry,
CCCG'03,
Halifax,
Canada,
August 11-13,
2003
- Karen Daniels, Arti Mathur, Roger Grinde:
A combinatorial maximum cover approach to 2D translational geometric covering.
2-5
- Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
On the parameterized complexity of the generalized rush hour puzzle.
6-9
- Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard.
10-13
- Ying Liu, Mikhail Nediak:
Planar case of the maximum box and related problems.
14-18
- Kensuke Onishi, Jin-ichi Itoh:
Estimation of the necessary number of points in Riemannian Voronoi.
19-24
- Anna Medvedeva, Asish Mukhopadhyay:
An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon.
25-28
- Therese C. Biedl, Anna Lubiw, Michael J. Spriggs:
Parallel morphing of trees and cycles.
29-34
- Weizhao Wang, Xiang-Yang Li, Yu Wang, Wen-Zhan Song:
The spanning ratios of beta-Skeleton.
35-38
- Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree.
39-42
- Mirela Damian-Iordache, Joseph O'Rourke:
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions.
43-46
- Masud Hasan, Anna Lubiw:
Equiprojective Polyhedra.
47-50
- Helmut Alt, Marc Glisse, Xavier Goaoc:
On the worst-case complexity of the silhouette of a polytope.
51-55
- Suzanne Gallagher, Joseph O'Rourke:
Coloring Objects Built From Bricks.
56-59
- Asish Mukhopadhyay, Quanbin Jing:
Encoding Quadrilateral Meshes.
60-63
- Petr Tobola, Karel Nechvíle:
Linear Binary Space Partitions and the Hierarchy of Object Classes.
64-67
- Eric Y. Chen, Timothy M. Chan:
A Space-Efficient Algorithm for Segment Intersection.
68-71
- Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper:
Curves of width one and the river shore problem.
73-75
- Jocelyn Smith, William S. Evans:
Triangle Guarding.
76-80
- Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint:
Computing the Similarity of two Melodies.
81-84
- Mahmoud Melkemi:
Molecular graphs of a finite points set: a generalization of the Delaunay triangulation.
85-88
- Nicolas Grislain, Jonathan Richard Shewchuk:
The Strange Complexity of Constrained Delaunay Triangulation.
89-93
- Ali Asghar Khanban, Abbas Edalat:
Computing Delaunay Triangulation with Imprecise Input Data.
94-97
- Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson:
Hinged Dissection of Polygons is Hard.
98-102
- Chris Worman:
Decomposing Polygons Into Diameter Bounded Components.
103-106
- Ferran Hurtado, Godfried T. Toussaint, Joan Trias:
On Polyhedra Induced by Point Sets in Space.
107-110
- Jaeil Choi, Andrzej Szymczak:
On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation.
111-114
- Ian Hsieh, Kiat-Choong Chen, Cao An Wang:
A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.
115-119
- Alexander Golynski, David Bremner:
Sufficiently Fat Polyhedra are Not 2-Castable.
120-122
- Stephane Durocher, David G. Kirkpatrick:
The Gaussian Centre of a Set of Mobile Points.
123-127
- Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekaran:
Network Design Subject to Facility Location.
128-131
- Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao:
Computing the Closest Point to a Circle.
132-135
- Marina L. Gavrilova, Sergei Bespamyatnikh:
On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces.
136-139
- Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann:
On the Number of Pseudo-Triangulations of Certain Point Sets.
141-144
- J. Mark Keil, Tzvetalin S. Vassilev:
An algorithm for the MaxMin area triangulation of a convex polygon.
145-149
- Shiyan Hu:
A Constant Approximation Algorithm for Maximum Weight Triangulation.
150-154
- Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth:
Degree Bounds for Constrained Pseudo-Triangulations.
155-158
- Erik D. Demaine, Jeff Erickson, Stefan Langerman:
On the Complexity of Halfspace Volume Queries.
159-160
- Lingke Bu, Bradford G. Nickerson:
Multidimensional Orthogonal Range Search Using Tries.
161-165
- David Hart:
Shortest Paths in Two Intersecting Pencils of Lines.
166-169
- Telikepalli Kavitha, Kasturi R. Varadarajan:
On shortest paths in line arrangements.
170-173
- Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides:
Transversals to line segments in R3.
174-177
Last update Mon May 21 02:24:10 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
