The SCEAS System
Navigation Menu

Journals in DBLP

Comput. Geom.
1992, volume: 2, number:

  1. Pankaj K. Agarwal, Jirí Matousek
    Relative Neighborhood Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:1-14 [Journal]
  2. Andranik Mirzaian
    Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:15-30 [Journal]
  3. Peter W. Shor, Christopher J. Van Wyk
    Detecting and Decomposing Self-overlapping Curves. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:31-50 [Journal]
  4. Masatsugu Urabe, Mamoru Watanabe
    On a Counterexample to a Conjecture of Mirzaian. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:51-53 [Journal]
  5. Olivier Devillers, Stefan Meiser, Monique Teillaud
    Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:55-80 [Journal]
  6. Peter C. Fishburn, James A. Reeds
    Unit Distances Between Vertices of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:81-91 [Journal]
  7. John Hershberger
    Upper Envelope Onion Peeling. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:93-110 [Journal]
  8. John Hershberger
    Minimizing the Sum of Diameters Efficiently. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:111-118 [Journal]
  9. Mark de Berg
    Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:119-140 [Journal]
  10. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    Parallel Fractional Cascading on Hypercube Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:141-167 [Journal]
  11. Jirí Matousek
    Reporting Points in Halfspaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:169-186 [Journal]
  12. Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno
    A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:187-200 [Journal]
  13. Michael E. Hohmeyer, Seth J. Teller
    Stabbing Isothetic Boxes and Rectangles in O(n Log N) Time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:201-207 [Journal]
  14. Eugene Joseph, Steven Skiena
    Model-based Probing Strategies for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:209-221 [Journal]
  15. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with Small Union Size. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:223-234 [Journal]
  16. Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov
    Vector Summation within Minimal Angle. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:235-239 [Journal]
  17. David Avis, Viatcheslav P. Grishukhin
    A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:241-254 [Journal]
  18. Patrice Belleville, Thomas C. Shermer
    Probing Polygons Minimally Is Hard. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:255-265 [Journal]
  19. Michael T. Goodrich
    Constructing the Convex Hull of a Partially Sorted Set of Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:267-278 [Journal]
  20. Jirí Matousek
    On Vertical Ray Shooting in Arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:279-285 [Journal]
  21. Peter W. Sauer
    On the Recognition of Digital Circles in Linear Time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:287-302 [Journal]
  22. Vangelis Bistiolas, Dimitris Sofotassios, Athanasios K. Tsakalidis
    Computing Rectangle Enclosures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:303-308 [Journal]
  23. Laxmi Gewali, Simeon C. Ntafos
    Covering Grids and Orthogonal Polygons with Periscope Guards. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:309-334 [Journal]
  24. Mordecai J. Golin
    How Many Maxima Can There Be? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:335-353 [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