The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Symposium on Computational Geometry (compgeom)
1989 (conf/compgeom/89)

  1. Jirí Matousek
    Construction of epsilon Nets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:1-10 [Conf]
  2. Pankaj K. Agarwal
    A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:11-22 [Conf]
  3. Mike Paterson, F. Frances Yao
    Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:23-32 [Conf]
  4. Ketan Mulmuley
    A Fast Planar Partition Algorithm, II. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:33-43 [Conf]
  5. Peter W. Shor, Christopher J. Van Wyk
    Detecting and Decomposing Self-Overlapping Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:44-50 [Conf]
  6. Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
    Area Requirement and Symmetry Display in Drawing Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:51-60 [Conf]
  7. Gert Vegter
    Kink-Free Deformations of Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:61-68 [Conf]
  8. Yan Ke
    An Efficient Algorithm for Link-Distance Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:69-78 [Conf]
  9. Erich Kaltofen
    Computing the Irreducible Real Factors and Components of an Algebraic Curve. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:79-87 [Conf]
  10. Shreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru
    Degree Complexity Bounds on the Intersection of Algebraic Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:88-93 [Conf]
  11. Chandrajit L. Bajaj, Insung Ihm
    Hermite Interpolation of Rational Space Curves Using Real Algebraic Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:94-103 [Conf]
  12. Mikhail J. Atallah, Jyh-Jong Tsay
    On the Parallel Decomposability of Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:104-113 [Conf]
  13. Mikhail J. Atallah, Danny Z. Chen
    Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:114-123 [Conf]
  14. Jirí Matousek, Emo Welzl
    Good Splitters for Counting Points in Triangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:124-130 [Conf]
  15. Bernard Chazelle, Burton Rosenberg
    Computing Partial Sums in Multidimensional Arrays. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:131-139 [Conf]
  16. Imre Bárány, Zoltán Füredi, László Lovász
    On the Number of Halving Planes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:140-144 [Conf]
  17. Herbert Edelsbrunner
    An Acyclicity Theorem for Cell Complexes in d Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:145-151 [Conf]
  18. Richard Pollack, Rephael Wenger
    Necessary and Sufficient Conditions for Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:152-155 [Conf]
  19. Dan Halperin, Mark H. Overmars
    Efficient Motion Planning for an L-Shaped Object. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:156-166 [Conf]
  20. L. Paul Chew, Klara Kedem
    Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:167-173 [Conf]
  21. Joseph Friedman, John Hershberger, Jack Snoeyink
    Compliant Motion in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:175-186 [Conf]
  22. Amy J. Briggs
    An Efficient Algorithm for One-Step Planar Complaint Motion Planning with Uncertainty. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:187-196 [Conf]
  23. Victor Milenkovic
    Calculating Approximate Curve Arrangements Using Rounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:197-207 [Conf]
  24. Keiko Imai, S. Sumino, Hiroshi Imai
    Minimax Geometric Fitting of Two Corresponding Sets of Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:206-275 [Conf]
  25. David Salesin, Jorge Stolfi, Leonidas J. Guibas
    Epsilon Geometry: Building Robust Algorithms from Imprecise Computations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:208-217 [Conf]
  26. Erik Brisson
    Representing Geometric Structures in d Dimensions: Topology and Order. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:218-227 [Conf]
  27. Pascal Lienhardt
    Subdivisions of n-Dimensional Spaces and n-Dimensional Generalized Maps. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:228-236 [Conf]
  28. Jean-Daniel Boissonnat, Mariette Yvinec
    Probing a Scene of Non Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:237-246 [Conf]
  29. Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
    Determining Sector Visibility of a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:247-253 [Conf]
  30. John Hershberger, Subhash Suri
    Finding Tailored Partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:255-265 [Conf]
  31. Jan-Ming Ho, D. T. Lee
    Bounded Diameter Minimum Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:276-282 [Conf]
  32. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Fining k Points with Minimum Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:283-291 [Conf]
  33. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
    Fast Geometric Approximation Techniques and Geometric Embedding Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:292-301 [Conf]
  34. Odile Marcotte, Subhash Suri
    On Geometric Matching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:302-314 [Conf]
  35. Pankaj K. Agarwal
    Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:315-325 [Conf]
  36. Rex A. Dwyer
    Higher-Dimensional Voronoi Diagrams in Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:326-333 [Conf]
  37. Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell
    On Monotone Paths Among Obstacles with Applications to Planning Assemblies. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:334-343 [Conf]
  38. W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee
    Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:344-353 [Conf]
  39. Jack Snoeyink, John Hershberger
    Sweeping Arrangements of Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:354-363 [Conf]
  40. Peter Egyed, Rephael Wenger
    Stabbing Pairwise Disjoint Translates in Linear Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:364-369 [Conf]
  41. Joseph O'Rourke, Catherine A. Schevon
    Computing the Geodesic Diameter of a 3-Polytope. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:370-379 [Conf]
  42. Jim Ruppert, Raimund Seidel
    On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:380-392 [Conf]
  43. Bernard Chazelle, Leonidas Palios
    Triangulating a Non-Convex Polytype. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:393-400 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002