8. CCCG 1996:
Ottawa,
Ontario,
Canada
Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack (Eds.):
Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996.
Carleton University Press 1996, ISBN 0-88629-307-3 
- Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata:
Robust Proximity Queries in Implicit Voronoi Diagrams.
1-1
- V. Martynchik, Nikolai N. Metelski, Derick Wood:
O-Convexity Computing Hulls Approximations and Orientation Sets.
2-7
- Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
8-13
- Jean-Daniel Boissonnat, Sylvain Lazard:
Convex Hulls of Bounded Curvature.
14-19
- Michael Segal, Klara Kedem:
Enclosing K Points in the Smallest Axis Parallel Rectangle.
20-25
- Joy Bhadury, Ramaswamy Chandrasekaran:
Finding the Set of All Minimal Nested Convex Polygons.
26-31
- Gill Barequet, Barbara Wolfers:
Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation.
32-37
- Thomas Auer, Martin Held:
Heuristics for the Generation of Random Polygons.
38-43
- L. Jackson, Stephen K. Wismath:
Orthogonal Polygon Reconstruction.
44-49
- Dong Wang, John A. Goldak:
Correcting Topological Defects of Tessellations.
50-55
- David Avis, Chiu Ming Kong:
Generating Rooted Triangulations with Minimum Degree Four.
56-61
- Andranik Mirzaian, Cao An Wang, Yin-Feng Xu:
On Stable Line Segments in Triangulations.
62-67
- Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds Are Not a Minimum Weight Triangulation's Best Friend.
68-73
- Hazel Everett, Ferran Hurtado, Marc Noy:
Stabbing Information of a Simple Polygon.
74-79
- Nina Amenta:
K-transversals of Parallel Convex Sets.
80-86
- Frank Nielsen:
Fast Stabbing of Boxes in High Dimensions.
87-92
- Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Shooter Location Problem.
93-98
- Chandrajit L. Bajaj:
Computational Geometry for Interrogative Visualization.
99-100
- Sergei Bespamyatnikh:
An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems.
101-106
- Toshiyuki Imai:
A Topology Oriented Algorithm for the Voronoi Diagram of Polygons.
107-112
- Ngoc-Minh Lê:
On Non-smooth Convex Distance Functions.
113-118
- Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya:
Time-optimal Proximity Graph Computations on Enhanced Meshes.
119-124
- Susan Hert, Vladimir J. Lumelsky:
Deforming Curves in the Plane for Tethered-robot Motion Planning.
125-130
- Thomas Chadzelek, Jens Eckstein, Elmar Schömer:
Heuristic Motion Planning with Movable Obstacles.
131-136
- Frank Follert:
Viewing a Set of Spheres while Moving on a Linear Flightpath.
137-142
- Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink:
Approximating Shortest Paths in Arrangements of Lines.
143-148
- Kamala Krithivasan, Anna Rema, Stefan Schirra, P. I. Vijaykumar:
Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles.
149-154
- Danny Z. Chen, Gautam Das, Michiel H. M. Smid:
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths.
155-160
- Naixun Pei, Sue Whitesides:
On the Reachable Regions of Chains.
161-166
- Thomas Chadzelek, Jens Eckstein, Elmar Schömer:
Heuristic Motion Planning with Many Degrees of Freedom.
167-172
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments.
173-178
- Hanspeter Bieri, Peter-Michael Schmidt:
On the Permutations Generated by Rotational Sweeps of Planar Point Sets.
179-184
- Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Maximal Length Common Non-intersecting Paths.
185-189
- Paola Magillo, Leila De Floriani:
Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Sub Divisions.
190-195
- Karen L. Daniels, Victor J. Milenkovic:
Distance-based Subdivision for Translational LP Containment.
196-201
- Enrico Puppo:
Variable Resolution Terrain Surfaces.
202-210
- Eugene Fink, Derick Wood:
Generalizing Halfspaces.
211-216
- Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li:
Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain.
217-222
- Aldo Laurentini:
The Surveillance of the Walls of an Art Gallery.
223-233
- Thomas C. Shermer:
On Rectangle Visibility Graphs. III. External Visibility and Complexity.
234-239
- Danny Z. Chen, Ovidiu Daescu:
Maintaining Visibility of a Polygon with a Moving Point of View.
240-245
- Yosser Atassi:
Visibility Graph of a Set of Line Sements: A Dynamic Sequential Algorithm and Its Parallel Version.
246-251
- Sergei Bespamyatnikh:
Dynamic Algorithms for Approximate Neighbor Searching.
252-257
- Eugene Fink, Derick Wood:
Three-dimensional Restricted-Orient at Ion Convexity.
258-263
- Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap:
Efficient Algorithms for the Smallest Enclosing Cylinder Problem.
264-269
- Binhai Zhu:
On the omega(n4/3) Weak Lower Bounds for Some 3D Geometric Problems.
270-275
- Prabhakar Raghavan:
Computational Geometry Impact Potential: A Business and Industrial Perspective.
276
- Marek Teichmann:
Probalistic Algorithms for Efficient Grasping and Fixturing.
277-282
- Jurek Czyzowicz, Ivan Stojmenovic, Tomasz Szymacha:
On a Problem of Immobilizing Polygons.
283-288
- Antonio Hernández-Barrera:
Finding an o(n2 log n) Algorithm Is Sometimes Hard.
289-294
- Therese C. Biedl:
Improved Orthogonal Drawings of 3-graphs.
295-299
- Leizhen Cai:
Algorithms on Polygonal Embeddings of Graphs.
300-305
- Therese C. Biedl:
Optimal Orthogonal Drawings of Connected Plane Graphs.
306-311
- Netzahualcoyotl Castañeda, Jorge Urrutia:
Straight Line Embeddings of Planar Graphs on Point Sets.
312-318
- Robin Y. Flatland, Charles V. Stewart:
Extending Rectangular Range Reporting with Query Sensitive Analysis.
319-324
- Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu:
The Complexity of Rivers in Triangulated Terrains.
325-330
- Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance.
331-336
- Jay Bagga, Laxmi Gewali, David Glasser:
The Complexity of Illuminating Polygons by alpha-flood-lights.
337-342
Copyright © Fri Nov 27 19:32:19 2009
by Michael Ley (ley@uni-trier.de)
