The SCEAS System
Navigation Menu

Conferences in DBLP

Canadian Conference on Computational Geometry (cccg)
1999 (conf/cccg/1999)

  1. Roland Ulber
    On the number of star-shaped polygons and polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  2. Davis King, Jarek Rossignac
    Guaranteed 3.67v bit encoding of planar triangle graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  3. Matthew J. Katz, Klara Kedem, Michael Segal
    Improved algorithms for placing undesirable facilities. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  4. Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
    Some results on geometric independency trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  5. Takayuki Ishizeki, Fumihiko Takeuchi
    Geometric shellings of 3-polytopes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  6. Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos
    On bisectors for convex distance functions in 3-space. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  7. Ernst Huber
    Surface-to-surface intersection based on triangular parameter domain subdivision 100. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  8. Michael Hoffmann
    A simple linear algorithm for computing rectangle 3-centers. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  9. Herman J. Haverkort, Hans L. Bodlaender
    Finding a minimal tree in a polygon with its medial axis. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  10. Richard Hammersley, Karen Lu, S. Assa
    Geometric modeling with a multiresolution representation. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  11. Stefan Funke, Kurt Mehlhorn, Stefan Näher
    Structural filtering: A paradigm for efficient and exact geometric programs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  12. Victor Klee
    Shapes of the future - some unsolved problems in high-dimensional intuitive geometry. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  13. Evangelos Kranakis, Harvinder Singh, Jorge Urrutia
    Compass routing on geometric networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  14. Godfried T. Toussaint
    The Erdös-Nagy theorem and its ramifications. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  15. Ileana Streinu
    Non-stretchable pseudo-visibility graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  16. Michael J. Spriggs, J. Mark Keil
    Minimum spanning trees on polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  17. Michael A. Soss
    On the size of the euclidean sphere of influence graph. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  18. Christian Sohler
    Generating random star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  19. Christian Sohler
    Fast reconstruction of delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  20. Ian Sanders
    Non-orthogonal ray guarding. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  21. Eduardo Rivera-Campo, Virginia Urrutia-Galicia
    A note on the path graph of a set of points in convex position in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  22. Subhas C. Nandy
    Shattering a set of objects in 2d. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  23. Michael McAllister
    A watershed algorithm for triangulated terrains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  24. Suzanne Fortier
    Looking at molecules with smart computers. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  25. Matthias Fischer, Tamás Lukovszki, Martin Ziegler
    Partitioned neighborhood spanners of minimal outdegree. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  26. Vladimir Estivill-Castro
    Convex group clustering of large geo-referenced data sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  27. David Bremner, Victor Klee
    Inner diagonals of convex polytopes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  28. Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Dominic Lessard
    Near optimal-partitioning of rectangles and prisms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  29. Ian Ashdown
    Comparing photometric distributions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  30. Tetsuo Asano, Yasuyuki Kawamura
    Computational comparison of voting-based and arrangement-based schema for digital line detection. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  31. Therese C. Biedl, Anna Lubiw, Julie Sun
    When can a net fold to a polyhedron. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  32. Francois Anton, Darka Mioc
    On the conversion of ordinary voronoi diagrams into laguerre diagrams. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  33. Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
    Obnoxious facility location: Complete service with minimal harm. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  34. Hélymar Balza-Gomez, Dominique Michelucci, Jean-Michel Moreau
    The periodicity of integral convex hulls for conics in r2. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  35. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
    Casting with skewed ejection direction revisited. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  36. Sergei Bespamyatnikh, David Kirkpatrick
    Rectilinear 2-center problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  37. Dinesh K. Pai
    Touching geometry. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  38. Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman
    Hinged dissections of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  39. Binhai Zhu
    A simple probablistic algorithm for approximating two and three-dimensional objects. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  40. Robert J. MacG. Dawson, Wendy A. Finbow
    A computational approach to stability problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  41. Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
    Dissections, cuts and triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  42. György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia
    Domino tilings of orthogonal polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  43. Roxana Cocan, Joseph O'Rourke
    Polygonal chains cannot lock in 4d. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  44. Adrian Dumitrescu, Géza Tóth
    Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  45. Adrian Dumitrescu
    On two lower bound constructions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  46. Otfried Cheong, René van Oostrum
    The visibility region of points in a simple polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  47. Luc Devroye, Christophe Lemaire, Jean-Michel Moreau
    Fast delaunay point location with search structures. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  48. Bette Bultena, Branko Grünbaum, Frank Ruskey
    Convex drawings of intersecting families of simple closed curves. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  49. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo
    Ununfoldable polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002