12. CCCG 2000: Fredericton, New Brunswick, Canada
Proceedings of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, Canada, August 16-19, 2000. 2000
Session C1: Polygons
- Gill Barequet, Matthew Dickerson: The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon.
- Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin: Flipping your Lid.
- Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons.
Session I1: Invited Lecture
- Naoki Kato: Applications of Computational Geometry in Architecture.
Session C2.1: Circular Arcs
- Vladimir Filkov: Covering Points on a Circle with Circular Arcs.
- Stefan Langerman: On the Shooter Location Problem.
Session C2.2: Visibility
- David G. Kirkpatrick: Guarding Alcove-Free Galleries .
Session C3.1: Polyhedra
- Sonoko Moriyama, Fumihiko Takeuchi: Incremental construction properties in dimension two-- shellability, extendable shellability and vertex decomposability.
Session C3.2: Geometric Graphs
- Shin-ichi Tokunaga: On a straight-line embedding problem of forests.
Session C4: Voronoi and Relatives
- Martin Held: Computing Voronoi Diagrams of Line Segments Reliably and Efficiently.
- Guilherme Albuquerque Pinto, Pedro Jussieu de Rezende: Additively Weighted Voronoi Diagram on the Oriented Projective Plane.
- Mordecai J. Golin, Hyeon-Suk Na: On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes.
Session I2: Paul Erdos Memorial Lecture
- Gil Kalai: Fractional Helly theorem, weak epsilon nets and geometric piercing.
Session C5.1: Robustness
- Jean-Daniel Boissonnat, Antoine Vigneron: An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments.
Session C5.2: Area and Volume
- Therese C. Biedl: 1-bend 3-D orthogonal drawings: two open problems solved.
Session C6.1: Queries in High Dimensions
- John Iacono, Stefan Langerman: Dynamic point location in fat hyperrectangles with integer coordinates.
Session C6.2: Block Pushing, Discrete Geometry
- Michael Hoffmann: Push-* is NP-hard.
- Manuela Neagu: Equivalence of Arrangements of Curves.
Session C7: Triangulations
- Andrzej Szymczak, Davis King, Jarek Rossignac: An Edgebreaker-Based Efficient Compression Scheme for Connectivity of Regular Meshes.
Session I3: IVS-NVision Annual Lecture
- Colin Ware: Mapping Data to Dimensions of Perceptual Space.
Session O1: Open Problems and Planning
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team