The SCEAS System
Navigation Menu

Journals in DBLP

Comput. Geom.
1993, volume: 3, number:

  1. Muhammad H. Alsuwaiyel, D. T. Lee
    Minimal Link Visibility Paths Inside a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:1-25 [Journal]
  2. Boris Aronov, Raimund Seidel, Diane L. Souvaine
    On Compatible Triangulations of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:27-35 [Journal]
  3. Sumanta Guha
    An Optimal Parallel Algorithm Using Exclusive Read/writes for the Rectilinear Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:37-52 [Journal]
  4. Marco Pellegrini
    Lower Bounds on Stabbing Lines in 3-space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:53-58 [Journal]
  5. L. Paul Chew, Klara Kedem
    A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:59-89 [Journal]
  6. Susanne E. Hambrusch, Frank K. H. A. Dehne
    Determining Maximum K-width-connectivity on Meshes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:91-105 [Journal]
  7. Klaus Jansen
    One Strike Against the Min-max Degree Triangulation Problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:107-120 [Journal]
  8. Paul J. Heffernan
    Linear-time Algorithms for Weakly-monotone Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:121-137 [Journal]
  9. Bala Kalyanasundaram, Kirk Pruhs
    A Competitive Analysis of Algorithms for Searching Unknown Scenes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:139-155 [Journal]
  10. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    Randomized Incremental Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:157-184 [Journal]
  11. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:185-212 [Journal]
  12. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Characterizing and Recognizing Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:213-233 [Journal]
  13. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:235-246 [Journal]
  14. Efthymios Anagnostou, Derek G. Corneil
    Polynomial-time Instances of the Minimum Weight Triangulation Problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:247-259 [Journal]
  15. Rex A. Dwyer
    Maximal and Minimal Balls. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:261-275 [Journal]
  16. Alon Efrat, Günter Rote, Micha Sharir
    On the Union of Fat Wedges and Separating a Collection of Segments By a Line. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:277-288 [Journal]
  17. David G. Heath, Simon Kasif
    The Complexity of Finding Minimal Voronoi Covers with Applications to Machine Learning. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:289-305 [Journal]
  18. Mikhail J. Atallah, Danny Z. Chen
    On Parallel Rectilinear Obstacle- Avoiding Paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:307-313 [Journal]
  19. Tamal K. Dey
    On Counting Triangulations in D Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:315-325 [Journal]
  20. Lenwood S. Heath, Praveen K. Paripati, John W. Roach
    Representing Polyhedra: Faces Are Better Than Vertices. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:327-351 [Journal]
  21. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
    The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:353-373 [Journal]
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