The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata
    Robust Proximity Queries in Implicit Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:1-1 [Conf]
  2. V. Martynchik, Nikolai N. Metelski, Derick Wood
    O-Convexity Computing Hulls Approximations and Orientation Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:2-7 [Conf]
  3. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:8-13 [Conf]
  4. Jean-Daniel Boissonnat, Sylvain Lazard
    Convex Hulls of Bounded Curvature. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:14-19 [Conf]
  5. Michael Segal, Klara Kedem
    Enclosing K Points in the Smallest Axis Parallel Rectangle. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:20-25 [Conf]
  6. Joy Bhadury, Ramaswamy Chandrasekaran
    Finding the Set of All Minimal Nested Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:26-31 [Conf]
  7. Gill Barequet, Barbara Wolfers
    Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:32-37 [Conf]
  8. Thomas Auer, Martin Held
    Heuristics for the Generation of Random Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:38-43 [Conf]
  9. L. Jackson, Stephen K. Wismath
    Orthogonal Polygon Reconstruction. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:44-49 [Conf]
  10. Dong Wang, John A. Goldak
    Correcting Topological Defects of Tessellations. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:50-55 [Conf]
  11. David Avis, Chiu Ming Kong
    Generating Rooted Triangulations with Minimum Degree Four. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:56-61 [Conf]
  12. Andranik Mirzaian, Cao An Wang, Yin-Feng Xu
    On Stable Line Segments in Triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:62-67 [Conf]
  13. Prosenjit Bose, Luc Devroye, William S. Evans
    Diamonds Are Not a Minimum Weight Triangulation's Best Friend. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:68-73 [Conf]
  14. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:74-79 [Conf]
  15. Nina Amenta
    K-transversals of Parallel Convex Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:80-86 [Conf]
  16. Frank Nielsen
    Fast Stabbing of Boxes in High Dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:87-92 [Conf]
  17. Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya
    Shooter Location Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:93-98 [Conf]
  18. Chandrajit L. Bajaj
    Computational Geometry for Interrogative Visualization. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:99-100 [Conf]
  19. Sergei Bespamyatnikh
    An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:101-106 [Conf]
  20. Toshiyuki Imai
    A Topology Oriented Algorithm for the Voronoi Diagram of Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:107-112 [Conf]
  21. Ngoc-Minh Lê
    On Non-smooth Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:113-118 [Conf]
  22. Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
    Time-optimal Proximity Graph Computations on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:119-124 [Conf]
  23. Susan Hert, Vladimir J. Lumelsky
    Deforming Curves in the Plane for Tethered-robot Motion Planning. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:125-130 [Conf]
  24. Thomas Chadzelek, Jens Eckstein, Elmar Schömer
    Heuristic Motion Planning with Movable Obstacles. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:131-136 [Conf]
  25. Frank Follert
    Viewing a Set of Spheres while Moving on a Linear Flightpath. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:137-142 [Conf]
  26. Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
    Approximating Shortest Paths in Arrangements of Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:143-148 [Conf]
  27. Kamala Krithivasan, Anna Rema, Stefan Schirra, P. I. Vijaykumar
    Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:149-154 [Conf]
  28. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
    Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:155-160 [Conf]
  29. Naixun Pei, Sue Whitesides
    On the Reachable Regions of Chains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:161-166 [Conf]
  30. Thomas Chadzelek, Jens Eckstein, Elmar Schömer
    Heuristic Motion Planning with Many Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:167-172 [Conf]
  31. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
    Computing Largest Circles Separating Two Sets of Segments. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:173-178 [Conf]
  32. Hanspeter Bieri, Peter-Michael Schmidt
    On the Permutations Generated by Rotational Sweeps of Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:179-184 [Conf]
  33. Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
    Maximal Length Common Non-intersecting Paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:185-189 [Conf]
  34. Paola Magillo, Leila De Floriani
    Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Sub Divisions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:190-195 [Conf]
  35. Karen L. Daniels, Victor J. Milenkovic
    Distance-based Subdivision for Translational LP Containment. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:196-201 [Conf]
  36. Enrico Puppo
    Variable Resolution Terrain Surfaces. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:202-210 [Conf]
  37. Eugene Fink, Derick Wood
    Generalizing Halfspaces. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:211-216 [Conf]
  38. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
    Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:217-222 [Conf]
  39. Aldo Laurentini
    The Surveillance of the Walls of an Art Gallery. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:223-233 [Conf]
  40. Thomas C. Shermer
    On Rectangle Visibility Graphs. III. External Visibility and Complexity. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:234-239 [Conf]
  41. Danny Z. Chen, Ovidiu Daescu
    Maintaining Visibility of a Polygon with a Moving Point of View. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:240-245 [Conf]
  42. Yosser Atassi
    Visibility Graph of a Set of Line Sements: A Dynamic Sequential Algorithm and Its Parallel Version. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:246-251 [Conf]
  43. Sergei Bespamyatnikh
    Dynamic Algorithms for Approximate Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:252-257 [Conf]
  44. Eugene Fink, Derick Wood
    Three-dimensional Restricted-Orient at Ion Convexity. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:258-263 [Conf]
  45. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
    Efficient Algorithms for the Smallest Enclosing Cylinder Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:264-269 [Conf]
  46. Binhai Zhu
    On the omega(n4/3) Weak Lower Bounds for Some 3D Geometric Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:270-275 [Conf]
  47. Prabhakar Raghavan
    Computational Geometry Impact Potential: A Business and Industrial Perspective. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:276- [Conf]
  48. Marek Teichmann
    Probalistic Algorithms for Efficient Grasping and Fixturing. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:277-282 [Conf]
  49. Jurek Czyzowicz, Ivan Stojmenovic, Tomasz Szymacha
    On a Problem of Immobilizing Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:283-288 [Conf]
  50. Antonio Hernández-Barrera
    Finding an o(n2 log n) Algorithm Is Sometimes Hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:289-294 [Conf]
  51. Therese C. Biedl
    Improved Orthogonal Drawings of 3-graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:295-299 [Conf]
  52. Leizhen Cai
    Algorithms on Polygonal Embeddings of Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:300-305 [Conf]
  53. Therese C. Biedl
    Optimal Orthogonal Drawings of Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:306-311 [Conf]
  54. Netzahualcoyotl Castañeda, Jorge Urrutia
    Straight Line Embeddings of Planar Graphs on Point Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:312-318 [Conf]
  55. Robin Y. Flatland, Charles V. Stewart
    Extending Rectangular Range Reporting with Query Sensitive Analysis. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:319-324 [Conf]
  56. Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu
    The Complexity of Rivers in Triangulated Terrains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:325-330 [Conf]
  57. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:331-336 [Conf]
  58. Jay Bagga, Laxmi Gewali, David Glasser
    The Complexity of Illuminating Polygons by alpha-flood-lights. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:337-342 [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