5. CCCG 1993:
Waterloo,
Ontario,
Canada
Proceedings of the 5th Canadian Conference on Computational Geometry,
Waterloo,
Ontario,
Canada,
August 1993,
University of Waterloo.
- Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides:
Folding Rulers inside Triangles.
1-6 BibTeX
- Zhenyu Li, Victor Milenkovic:
The Complexity of the Compaction Problem.
7-11 BibTeX
- Lydia E. Kavraki, Jean-Claude Latombe, Randall H. Wilson:
On the Complexity of Assembly Partitioning.
12-17 BibTeX
- Jesus Garcia-Lopez, Pedro Ramos-Alonso:
Circular Visibility and Separability.
18-23 BibTeX
- Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu:
Tetrahedralization of Simple and Non-Simple Polyhedra.
24-29 BibTeX
- Mary-Anne K. Posenau:
Approaches to High Aspect Ratio Triangulations.
30-35 BibTeX
- Scott A. Mitchell:
Approximating the Maxmin-angle Covering Triangulation.
36-41 BibTeX
- Maria-Cecilia Rivara:
A Discussion on the Triangulation Refinement Problem.
42-47 BibTeX
- William L. Steiger:
Algorithms for Ham Sandwich Cuts.
48-48 BibTeX
- Michael B. Dillencourt, David M. Mount, Alan Saalfeld:
On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions.
49-54 BibTeX
- Pankaj K. Agarwal, Micha Sharir:
On the Number of Views of Polyhedral Terrains.
55-60 BibTeX
- Jean-Marc Robert:
Geometric Orderings and Helly-type Theorem for Intersecting Translates in the Plane.
61-66 BibTeX
- Jacqueline D. Chang, Victor Milenkovic:
An Experiment Using LN for Exact Geometric Computations.
67-78 BibTeX
- David M. Mount, Nathan S. Netanyahu:
Efficient Algorithms for Robust Circular Arc Estimators.
79-84 BibTeX
- Svante Carlsson, Håkan Jonsson:
Guarding a Treasury.
85-90 BibTeX
- P. Pradeep Kumar, C. E. Veni Madhavan:
Shortest Watchman Tours in Weak Visibility Polygons.
91-96 BibTeX
- Bern-Cherng Liaw, N. F. Huang, Richard C. T. Lee:
The Minimum Cooperative Guards Problem on K-spiral Polygons.
97-102 BibTeX
- Shivakumar Viswanathan:
The Edge Guard Problem for Spiral Polygons.
103-108 BibTeX
- Mark de Berg, Marko de Groot, Mark H. Overmars:
Perfect Binary Space Partitions.
109-114 BibTeX
- Alon Efrat, Günter Rote, Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
115-120 BibTeX
- Viet Hai Nguyen, Thomas Roos, Peter Widmayer:
Balanced Cuts of a Set of Hyperrectangles.
121-126 BibTeX
- Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
127-132 BibTeX
- Larry Shafer, William L. Steiger:
Randomizing Optimal Geometric Algorithms.
133-138 BibTeX
- Matthew J. Katz, Micha Sharir:
Optimal Slope Selection Via Expanders.
139-144 BibTeX
- William Rucklidge:
Lower Bounds for the Complexity of the Hausdorff Distance.
145-150 BibTeX
- L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets:
Geometric Pattern Matching Under Euclidean Motion.
151-156 BibTeX
- Jocelyn Cloutier, Imed Bennour:
Topological Characterization of Hwang's Optimal Steiner Trees.
157-162 BibTeX
- David G. Kirkpatrick, Jack Snoeyink:
Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time.
163-168 BibTeX
- Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya:
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments.
169-174 BibTeX
- Pedro Jussieu de Rezende, Welson R. Jacometti:
GeoLab: An Environment for Development of Algorithms in Computational Geometry.
175-180 BibTeX
- Micha Sharir:
Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments.
181-186 BibTeX
- Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides:
Dominance Drawings of Bipartite Graphs.
187-191 BibTeX
- Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees.
192-197 BibTeX
- Anna Lubiw, Nora Sleumer:
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs.
198-203 BibTeX
- Klara Kedem, Micha Sharir, Sivan Toledo:
On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane.
204-209 BibTeX
- Mikhail J. Atallah, Danny Z. Chen:
On Parallel Rectilinear Obstacle-avoiding Paths.
210-215 BibTeX
- Erik L. Wynters, Joseph S. B. Mitchell:
Shortest Paths for a Two-robot Rendez-vous.
216-221 BibTeX
- Sven Schuierer, Derick Wood:
Generalized Kernels of Polygons with Holes.
222-227 BibTeX
- Ramasubramanian Venkatasubramanian, Akio Cullum:
Grazing inside a Convex Polygon.
228-233 BibTeX
- Ferran Hurtado:
Looking through a Window.
234-239 BibTeX
- Laxmi Gewali:
On Minimum and Maximum Visibility Problem.
240-245 BibTeX
- Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems.
246-251 BibTeX
- Reuven Bar-Yehuda, Alon Efrat, Alon Itai:
A Simple Algorithm for Maintaining the Center of a Planar Point-set.
252-257 BibTeX
- Günter Rote, Christian Schwarz, Jack Snoeyink:
Maintaining the Approximate Width of a Set of Points in the Plane.
258-263 BibTeX
- Yossi Matias:
Semi-dynamic Closest-pair Algorithms.
264-271 BibTeX
- Raimund Seidel:
Teaching Computational Geometry.
272-272 BibTeX
- Tamal K. Dey:
Optimal Algorithms to Detect Null-homologous Cycles on 2-manifolds.
273-278 BibTeX
- Michela Bertolotto, Elisabetta Bruzzone, Leila De Floriani:
Acyclic Hierarchical Cell Complexes.
279-284 BibTeX
- Aldo Laurentini:
On the Minimal Number of Volume Intersection Operations Necessary for Reconstructing a 3D Object.
285-290 BibTeX
- A. James Stewart, Sherif Ghali:
An Output Sensitive Algorithm for the Computation of Shadow Boundaries.
291-296 BibTeX
- Derick Wood, Peter Yamamoto:
Dent and Staircase Visibility.
297-302 BibTeX
- Gautam Das, Paul J. Heffernan, Giri Narasimhan:
LR-visibility in Polygons.
303-308 BibTeX
- Hazel Everett, Anna Lubiw, Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs.
309-314 BibTeX
- G. Srinivasaraghavan, Asish Mukhopadhyay:
On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs.
315-320 BibTeX
- Thomas C. Shermer:
The Continuous-graph Approach to Visibility Problems.
321-321 BibTeX
- Karen L. Daniels, Victor Milenkovic, Dan Roth:
Finding the Maximum Area Axis-parallel Rectangle in a Polygon.
322-327 BibTeX
- Ivan Stojmenovic:
Finding the Largest M-dimensional Circle in a K-dimensional Box.
328-333 BibTeX
- D. P. Wang, Richard C. T. Lee:
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem.
334-339 BibTeX
- Jean-Michel Moreau, Pascal Volino:
Constrained Delaunay Triangulation Revisited.
340-345 BibTeX
- Dominique Schmitt, Jean-Claude Spehner:
On Equiangularity of Delaunay Diagrams in Every Dimension.
346-351 BibTeX
- Timothy Lambert:
Systematic Local Flip Rules Are Generalized Delaunay Rules.
352-357 BibTeX
- Thomas Roos:
Tighter Bounds on Voronoi Diagrams of Moving Points.
358-363 BibTeX
- L. Paul Chew:
Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points.
364-369 BibTeX
- Rolf Klein, Andrzej Lingas:
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.
370-374 BibTeX
- Ngoc-Minh Lê:
On General Properties of Strictly Convex Smooth Distance Functions in RD.
375-380 BibTeX
- Henk Meijer, Steven Skiena:
Reconstructing Polygons From X-Rays.
381-386 BibTeX
- Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine:
Testing Simple Polygons.
387 BibTeX
-392
- Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages.
393-398 BibTeX
- Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem.
399-404 BibTeX
- Chee Yap:
Low Level Issues in Computational Geometry.
405-419 BibTeX
- Thorsten Hinrichs, Klaus Graf:
Algorithms for Proximity Problems on Colored Point Sets.
420-425 BibTeX
- Ravi Janardan, Franco P. Preparata:
Widest-corridor Problems.
426-431 BibTeX
- Alon Efrat, Micha Lindenbaum, Micha Sharir:
Finding Maximally Consistent Sets of Halfspaces.
432-436 BibTeX
- Michael McAllister, Jack Snoeyink:
Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head.
437-442 BibTeX
- Christian Icking, Rolf Klein, Lihong Ma:
How to Look Around a Corner.
443-448 BibTeX
- Abhi Dattasharma, S. Sathiya Keerthi:
Translational Motion Planning for a Convex Polyhedron in a 3D Polyhedral World Using an Efficient and New Roadmap.
449-454 BibTeX
- Gunter Bär, Claudia Iturriaga:
Rectangle Packing in Polynomial Time.
455-460 BibTeX
- Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
The Lawnmower Problem.
461-466 BibTeX
- Patrice Belleville:
On Restricted Boundary Covers and Convex Three-Covers.
467-472 BibTeX
- Victor Milenkovic:
Robust Construction of the Voronoi Diagram of a Polyhedron.
473-478 BibTeX
- C. Bradford Barber, Michael D. Hirsch:
A Robust Algorithm for Point in Polyhedron.
479-484 BibTeX
- Victor Milenkovic, Veljko Milenkovic:
Rational Orthogonal Approximations to Orthogonal Matrices.
485-490 BibTeX
Copyright © Sat May 16 23:00:46 2009
by Michael Ley (ley@uni-trier.de)
