11. CCCG 1999:
Vancouver, British Columbia, Canada
Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999.
1999
- Therese C. Biedl, Anna Lubiw, Julie Sun:
When can a net fold to a polyhedron.

- Roxana Cocan, Joseph O'Rourke:
Polygonal chains cannot lock in 4d.

- Godfried T. Toussaint:
The Erdös-Nagy theorem and its ramifications.

- Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo:
Ununfoldable polyhedra.

- Victor Klee:
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry.

- Bette Bultena, Branko Grünbaum, Frank Ruskey:
Convex drawings of intersecting families of simple closed curves.

- Ileana Streinu:
Non-stretchable pseudo-visibility graphs.

- Hélymar Balza-Gomez, Dominique Michelucci, Jean-Michel Moreau:
The periodicity of integral convex hulls for conics in r2.

- Vladimir Estivill-Castro:
Convex group clustering of large geo-referenced data sets.

- Herman J. Haverkort, Hans L. Bodlaender:
Finding a minimal tree in a polygon with its medial axis.

- Stefan Funke, Kurt Mehlhorn, Stefan Näher:
Structural filtering: A paradigm for efficient and exact geometric programs.

- Michael A. Soss:
On the size of the euclidean sphere of influence graph.

- Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
Partitioned neighborhood spanners of minimal outdegree.

- Evangelos Kranakis, Harvinder Singh, Jorge Urrutia:
Compass routing on geometric networks.

- Binhai Zhu:
A simple probablistic algorithm for approximating two and three-dimensional objects.

- Ian Ashdown:
Comparing photometric distributions.

- Robert J. MacG. Dawson, Wendy A. Finbow:
A computational approach to stability problems.

- Matthew J. Katz, Klara Kedem, Michael Segal:
Improved algorithms for placing undesirable facilities.

- Sergei Bespamyatnikh, David G. Kirkpatrick:
Rectilinear 2-center problems.

- Michael Hoffmann:
A simple linear algorithm for computing rectangle 3-centers.

- Boaz Ben-Moshe, Matthew J. Katz, Michael Segal:
Obnoxious facility location: Complete service with minimal harm.

- Ian Sanders:
Non-orthogonal ray guarding.

- Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A note on the path graph of a set of points in convex position in the plane.

- Otfried Cheong, René van Oostrum:
The visibility region of points in a simple polygon.

- Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
Some results on geometric independency trees.

- Dinesh K. Pai:
Touching geometry.

- Richard Hammersley, Karen Lu, S. Assa:
Geometric modeling with a multiresolution representation.

- Ernst Huber:
Surface-to-surface intersection based on triangular parameter domain subdivision 100.

- Michael McAllister:
A watershed algorithm for triangulated terrains.

- Subhas C. Nandy:
Shattering a set of objects in 2d.

- Adrian Dumitrescu:
On two lower bound constructions.

- Tetsuo Asano, Yasuyuki Kawamura:
Computational comparison of voting-based and arrangement-based schema for digital line detection.

- Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos:
On bisectors for convex distance functions in 3-space.

- Michael J. Spriggs, J. Mark Keil:
Minimum spanning trees on polyhedra.

- Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with skewed ejection direction revisited.

- Takayuki Ishizeki, Fumihiko Takeuchi:
Geometric shellings of 3-polytopes.

- Luc Devroye, Christophe Lemaire, Jean-Michel Moreau:
Fast delaunay point location with search structures.

- Christian Sohler:
Fast reconstruction of delaunay triangulations.

- Davis King, Jarek Rossignac:
Guaranteed 3.67v bit encoding of planar triangle graphs.

- Francois Anton, Darka Mioc:
On the conversion of ordinary voronoi diagrams into laguerre diagrams.

- György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia:
Domino tilings of orthogonal polygons.

- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
Dissections, cuts and triangulations.

- Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Dominic Lessard:
Near optimal-partitioning of rectangles and prisms.

- Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman:
Hinged dissections of polyominoes and polyforms.

- Roland Ulber:
On the number of star-shaped polygons and polyhedra.

- Christian Sohler:
Generating random star-shaped polygons.

- Adrian Dumitrescu, Géza Tóth:
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.

- David Bremner, Victor Klee:
Inner diagonals of convex polytopes.

- Suzanne Fortier:
Looking at molecules with smart computers.

Last update Tue May 21 16:20:16 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page