The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Karen Daniels, Arti Mathur, Roger Grinde
    A combinatorial maximum cover approach to 2D translational geometric covering. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:2-5 [Conf]
  2. Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
    On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:6-9 [Conf]
  3. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:10-13 [Conf]
  4. Ying Liu, Mikhail Nediak
    Planar case of the maximum box and related problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:14-18 [Conf]
  5. Kensuke Onishi, Jin-ichi Itoh
    Estimation of the necessary number of points in Riemannian Voronoi. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:19-24 [Conf]
  6. Anna Medvedeva, Asish Mukhopadhyay
    An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:25-28 [Conf]
  7. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Parallel morphing of trees and cycles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:29-34 [Conf]
  8. Weizhao Wang, Xiang-Yang Li, Yu Wang, Wen-Zhan Song
    The spanning ratios of beta-Skeleton. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:35-38 [Conf]
  9. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
    Approximating the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:39-42 [Conf]
  10. Mirela Damian-Iordache, Joseph O'Rourke
    Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:43-46 [Conf]
  11. Masud Hasan, Anna Lubiw
    Equiprojective Polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:47-50 [Conf]
  12. Helmut Alt, Marc Glisse, Xavier Goaoc
    On the worst-case complexity of the silhouette of a polytope. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:51-55 [Conf]
  13. Suzanne Gallagher, Joseph O'Rourke
    Coloring Objects Built From Bricks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:56-59 [Conf]
  14. Asish Mukhopadhyay, Quanbin Jing
    Encoding Quadrilateral Meshes. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:60-63 [Conf]
  15. Petr Tobola, Karel Nechvíle
    Linear Binary Space Partitions and the Hierarchy of Object Classes. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:64-67 [Conf]
  16. Eric Y. Chen, Timothy M. Chan
    A Space-Efficient Algorithm for Segment Intersection. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:68-71 [Conf]
  17. Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
    Curves of width one and the river shore problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:73-75 [Conf]
  18. Jocelyn Smith, William S. Evans
    Triangle Guarding. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:76-80 [Conf]
  19. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint
    Computing the Similarity of two Melodies. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:81-84 [Conf]
  20. Mahmoud Melkemi
    Molecular graphs of a finite points set: a generalization of the Delaunay triangulation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:85-88 [Conf]
  21. Nicolas Grislain, Jonathan Richard Shewchuk
    The Strange Complexity of Constrained Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:89-93 [Conf]
  22. Ali Asghar Khanban, Abbas Edalat
    Computing Delaunay Triangulation with Imprecise Input Data. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:94-97 [Conf]
  23. Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson
    Hinged Dissection of Polygons is Hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:98-102 [Conf]
  24. Chris Worman
    Decomposing Polygons Into Diameter Bounded Components. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:103-106 [Conf]
  25. Ferran Hurtado, Godfried T. Toussaint, Joan Trias
    On Polyhedra Induced by Point Sets in Space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:107-110 [Conf]
  26. Jaeil Choi, Andrzej Szymczak
    On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:111-114 [Conf]
  27. Ian Hsieh, Kiat-Choong Chen, Cao An Wang
    A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:115-119 [Conf]
  28. Alexander Golynski, David Bremner
    Sufficiently Fat Polyhedra are Not 2-Castable. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:120-122 [Conf]
  29. Stephane Durocher, David G. Kirkpatrick
    The Gaussian Centre of a Set of Mobile Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:123-127 [Conf]
  30. Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekaran
    Network Design Subject to Facility Location. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:128-131 [Conf]
  31. Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
    Computing the Closest Point to a Circle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:132-135 [Conf]
  32. Marina L. Gavrilova, Sergei Bespamyatnikh
    On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:136-139 [Conf]
  33. Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann
    On the Number of Pseudo-Triangulations of Certain Point Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:141-144 [Conf]
  34. J. Mark Keil, Tzvetalin S. Vassilev
    An algorithm for the MaxMin area triangulation of a convex polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:145-149 [Conf]
  35. Shiyan Hu
    A Constant Approximation Algorithm for Maximum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:150-154 [Conf]
  36. Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
    Degree Bounds for Constrained Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:155-158 [Conf]
  37. Erik D. Demaine, Jeff Erickson, Stefan Langerman
    On the Complexity of Halfspace Volume Queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:159-160 [Conf]
  38. Lingke Bu, Bradford G. Nickerson
    Multidimensional Orthogonal Range Search Using Tries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:161-165 [Conf]
  39. David Hart
    Shortest Paths in Two Intersecting Pencils of Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:166-169 [Conf]
  40. Telikepalli Kavitha, Kasturi R. Varadarajan
    On shortest paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:170-173 [Conf]
  41. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to line segments in R3. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:174-177 [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