14. CCCG 2002:
Lethbridge,
Alberta,
Canada
Proceedings of the 14th Canadian Conference on Computational Geometry,
University of Lethbridge,
Alberta,
Canada,
August 12-14,
2002
- Erik D. Demaine, John Iacono, Stefan Langerman:
Proximate point searching.
1-4
Electronic Edition (link) BibTeX
- Valentina Damerow, Lukas Finschi, Martin Ziegler:
Point location algorithms of minimum size.
5-9
Electronic Edition (link) BibTeX
- Asish Mukhopadhyay:
Using simplicial partitions to determine a closest point to a query line.
10-12
Electronic Edition (link) BibTeX
- Stephane Durocher, David G. Kirkpatrick:
On the hardness of turn-angle-restricted rectilinear cycle cover problems.
13-16
Electronic Edition (link) BibTeX
- Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs.
17-21
Electronic Edition (link) BibTeX
- Jens-Michael Wierum:
Logarithmic path-length in space-filling curves.
22-26
Electronic Edition (link) BibTeX
- Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles.
27-30
Electronic Edition (link) BibTeX
- Erik D. Demaine, Robert A. Hearn, Michael Hoffmann:
Push-2-f is pspace-complete.
31-35
Electronic Edition (link) BibTeX
- Benjamin Marlin, Godfried T. Toussaint:
Constructing convex 3-polytopes from two triangulations of a polygon.
36-39
Electronic Edition (link) BibTeX
- Imma Boada, Narcís Coll, Joan Antoni Sellarès:
Hierarchical planar voronoi diagram approximations.
40-44
Electronic Edition (link) BibTeX
- Joachim Giesen, Matthias John:
The complexity of flow diagrams in the plane.
45-48
Electronic Edition (link) BibTeX
- Meenakshisundaram Gopi:
On sampling and reconstructing surfaces with boundaries.
49-53
Electronic Edition (link) BibTeX
- Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Efficient answering of polyhedral queries in rd using bbs-trees.
54-57
Electronic Edition (link) BibTeX
- Mario A. Lopez, Bradford G. Nickerson:
Analysis of half-space range search using the k-d search skip list.
58-62
Electronic Edition (link) BibTeX
- Michael Hoffmann, Csaba D. Tóth:
Connecting points in the presence of obstacles in the plane.
63-67
Electronic Edition (link) BibTeX
19
- Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons.
68-71
Electronic Edition (link) BibTeX
- Francois Anton, David G. Kirkpatrick, Darka Mioc:
An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles.
72-76
Electronic Edition (link) BibTeX
- Robust algorithm for k-gon voronoi diagram construction.
77-81
Electronic Edition (link) BibTeX
- Marina L. Gavrilova:
A reliable algorithm for computing the generalized voronoi diagram for a set of spheres in the euclidean d-dimensional space.
82-87
Electronic Edition (link) BibTeX
- Leonard Hagger, Ian Sanders:
Partitioning a deformed urban grid.
88-92
Electronic Edition (link) BibTeX
- Mirela Damian-Iordache:
Exact and approximation algorithms for computing a-fat decompositions.
93-96
Electronic Edition (link) BibTeX
- Joseph O'Rourke, Geetika Tewari:
Partitioning orthogonal polygons into fat rectangles in polynomial time.
97-100
Electronic Edition (link) BibTeX
- Melody Donoso, Joseph O'Rourke:
Nonorthogonal polyhedra built from rectangles.
101-104
Electronic Edition (link) BibTeX
- Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.
105-108
Electronic Edition (link) BibTeX
- Hervé Brönnimann, Marc Glisse, David R. Wood:
Cost-optimal quadtrees for ray shooting.
109-112
Electronic Edition (link) BibTeX
- Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra.
113-117
Electronic Edition (link) BibTeX
- Sergei Bespamyatnikh:
Computing closest points for segments.
118-122
Electronic Edition (link) BibTeX
- Joao Dinis, Margarida Mamede:
A sweep line algorithm for nearest neighbour queries.
123-127
Electronic Edition (link) BibTeX
- Anil Maheshwari, Jan Vahrenhold, Norbert Zeh:
On reverse nearest neighbor queries.
128-132
Electronic Edition (link) BibTeX
- Po-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang:
A near-quadratic algorithm for the alpha-connected two-center decision problem.
133-136
Electronic Edition (link) BibTeX
- Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar:
Searching for the center of a circle.
137-141
Electronic Edition (link) BibTeX
- Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs.
142-145
Electronic Edition (link) BibTeX
- Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing k2, n: A lower bound.
146-148
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath:
Drawing series-parallel graphs on a box.
149-153
Electronic Edition (link) BibTeX
- Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
A linear algorithm for compact box-drawings of trees.
154-157
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
Convexity minimizes pseudo-triangulations.
158-161
Electronic Edition (link) BibTeX
- Sergei Bespamyatnikh:
Enumerating pseudo-triangulations in the plane.
162-166
Electronic Edition (link) BibTeX
- David Orden, Francisco Santos:
Asymptotically efficient triangulations of the d-cube.
167-169
Electronic Edition (link) BibTeX
- Frederick Crimins, Diane L. Souvaine:
Constructing differentiable homeomorphisms between isomorphic triangulations.
170-173
Electronic Edition (link) BibTeX
- Erik D. Demaine, Joseph O'Rourke:
Open problems from cccg 2001.
Electronic Edition (link) BibTeX
- Stan Wagon:
A machine resolution of a four-color hoax.
174-185
Electronic Edition (link) BibTeX
- Ulrich Kortenkamp:
Cinderella: Computation, complexity, geometry.
186-191
Electronic Edition (link) BibTeX
- Luc Devroye:
Paul Erdös memorial lecture.
Electronic Edition (link) BibTeX
Copyright © Wed Jun 4 18:27:48 2008
by Michael Ley (ley@uni-trier.de)
