The SCEAS System
Navigation Menu

Journals in DBLP

Comput. Geom.
1997, volume: 8, number:

  1. Komei Fukuda, Thomas M. Liebling, François Margot
    Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:1-12 [Journal]
  2. Jens Gravesen
    Adaptive Subdivision and the Length and Energy of Bézier Curves. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:13-31 [Journal]
  3. Géza Tóth
    The Shortest Distance Among Points in General Position. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:33-38 [Journal]
  4. Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill
    Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:39-56 [Journal]
  5. Edgar A. Ramos
    Intersection of Unit-balls and Diameter of a Point Set in 3. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:57-65 [Journal]
  6. Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
    Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:67-86 [Journal]
  7. Johann Hagauer, Günter Rote
    Three-clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:87-95 [Journal]
  8. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:97-114 [Journal]
  9. Arne Andersson, Kurt Swanson
    On the Difficulty of Range Searching. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:115-122 [Journal]
  10. Gautam Das, Michael T. Goodrich
    On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:123-137 [Journal]
  11. Boris Aronov, Micha Sharir
    The Common Exterior of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:139-149 [Journal]
  12. Neelima Gupta, Sandeep Sen
    Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:151-166 [Journal]
  13. Gill Barequet, Matthew T. Dickerson, Petru Pau
    Translating a Convex Polygon to Contain a Maximum Number of Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:167-179 [Journal]
  14. Binhai Zhu
    Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:181-193 [Journal]
  15. Sándor P. Fekete, Gerhard J. Woeginger
    Angle-Restricted Tours in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:195-218 [Journal]
  16. M. L. Mazón, Tomás Recio
    Voronoi Diagrams on Orbifolds. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:219-230 [Journal]
  17. David Eppstein
    Faster Geometric K-point MST Approximation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:231-240 [Journal]
  18. Subir Kumar Ghosh, Sanjeev Saluja
    Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:241-266 [Journal]
  19. Tamal K. Dey, Nimish R. Shah
    On the Number of Simplicial Complexes in D. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:267-277 [Journal]
  20. Ngoc-Minh Lê
    Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:279-298 [Journal]
  21. Matthew J. Katz
    3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:299-316 [Journal]
  22. Mark de Berg, Marko de Groot, Mark H. Overmars
    New Results on Binary Space Partitions in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:317-333 [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