Canadian Conference on Computational Geometry
1st Edition
Published on 15. August 1996
355 pages
978-0-7735-9113-4 (ISBN)
Description
The 8th Canadian conference on computational geometry had an international flavour. Sixty-one papers were submitted by authors from over 20 countries representing four continents. The conference was held at Carleton University in August 1996.
More details
Other editions
Additional editions
Frank Fiala
Canadian Conference on Computational Geometry
Book
08/1996
McGill-Queen's University Press
€72.00
Article not available at the moment
Content
- Cover
- Title
- Copyright
- Table of Contents
- Preface
- Robust proximity queries in implicit Voronoi diagrams
- O-Convexity: Computing hulls, approximations, and orientation sets
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons
- Convex hulls of bounded curvature
- Enclosing k points in the smallest axis parallel rectangle
- Finding the set of all minimal nested convex polygons
- Optimizing a corridor between two polygons with an application to polyhedral interpolation
- Heuristics for the generation of random polygons
- Orthogonal polygon reconstruction
- Correcting topological defects of tessellations
- Generating rooted triangulations with minimum degree four
- On stable line segments in triangulations
- Diamonds are not a minimum weight triangulation's best friend
- Stabbing information of a simple polygon
- K-transversals of parallel convex sets
- Fast stabbing of boxes in high dimensions
- Shooter location problem
- Computational geometry for interrogative visualization
- An optimal algorithm for dynamic post-office problem in R² and related problems
- A topology-oriented algorithm for the Voronoi diagram of polygons
- On non-smooth convex distance functions
- Time-optimal proximity graph computations on enhanced meshes
- Deforming curves in the plane for tethered-robot motion planning
- Heuristic motion planning with movable obstacles
- Viewing a set of spheres while moving on a linear flightpath
- Approximating shortest paths in arrangments of lines
- Velocity planning for a robot moving along the shortest straight line path among moving obstacles
- Lower bounds for computing geometric spanners and approximate shortest paths
- On the reachable regions of chains
- Heuristic motion planning with many degrees of freedom
- C omputing largest circles separating two sets of segments
- On the permutations generated by rotational sweeps of planar point sets
- Maximal length common non-intersecting paths
- Maintaining multiple levels of detail in the overlay of hierarchical subdivisions
- Distance-based subdivision for translational LP containment
- Variable resolution terrain surfaces
- Generalizing halfspaces
- Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain
- The surveillance of the walls of an art gallery
- On rectangle visibility graphs. III. External visibility and complexity
- Maintaining visibility of a polygon with a moving point of view
- Visibility graph of a set of line sements: A dynamic sequential algorithm and its parallel version
- Dynamic algorithms for approximate neighbor searching
- Three-dimensional restricted-orientation convexity
- Efficient algorithms for the smallest enclosing cylinder problem
- On the O(n4/3) weak lower bounds for some 3D geometric problems
- Computational geometry impact potential: A business and industrial perspective
- Probalistic algorithms for efficient grasping and fixturing
- On a problem of immobilizing polygons
- Finding an o(n²log n) algorithm is sometimes hard
- Improved orthogonal drawings of 3-graphs
- Algorithms on polygonal embeddings of graphs
- Optimal orthogonal drawings of connected plane graphs
- Straight line embeddings of planar graphs on point sets
- Extending rectangular range reporting with query sensitive analysis
- The complexity of rivers in triangulated terrains
- Computing the angularity tolerance
- The complexity of illuminating polygons by a-flood-lights
- Author Index
