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)
1988 (conf/compgeom/88)

  1. Kenneth L. Clarkson
    Applications of Random Sampling in Computational Geometry, II. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:1-11 [Conf]
  2. Kenneth L. Clarkson, Peter W. Shor
    Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:12-17 [Conf]
  3. Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
    A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:18-22 [Conf]
  4. Emo Welzl
    Partition Trees for Triangle Counting and Other Range Searching Problems. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:23-33 [Conf]
  5. Dan E. Willard, Young C. Wee
    Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:34-43 [Conf]
  6. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity of Many Faces in Arrangements of Lines of Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:44-55 [Conf]
  7. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:56-69 [Conf]
  8. Pankaj K. Agarwal, Micha Sharir
    Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:70-80 [Conf]
  9. Bruno Buchberger
    Algebraic Methods for Non-Linear Computational Geometry (Invited Address). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:81-82 [Conf]
  10. L. W. Ericson, Chee-Keng Yap
    The Design of LINETOOL, a Geometric Editor. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:83-92 [Conf]
  11. David P. Dobkin, Deborah Silver
    Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:93-105 [Conf]
  12. Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick
    Towards Implementing Robust Geometric Computations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:106-117 [Conf]
  13. Herbert Edelsbrunner, Ernst P. Mücke
    Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:118-133 [Conf]
  14. Chee-Keng Yap
    A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:134-142 [Conf]
  15. David M. Mount, Alan Saalfeld
    Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:143-152 [Conf]
  16. Mordecai J. Golin, Robert Sedgewick
    Analysis of a Simple Yet Efficient Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:153-163 [Conf]
  17. Mark H. Overmars, Emo Welzl
    New Methods for Computing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:164-171 [Conf]
  18. Sanjiv Kapoor, S. N. Maheshwari
    Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:172-182 [Conf]
  19. Marshall W. Bern
    Hidden Surface Removal for Rectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:183-192 [Conf]
  20. John H. Reif, Sandeep Sen
    An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:193-200 [Conf]
  21. Richard Cole, Michael T. Goodrich
    Optimal Parallel Algorithms for Polygon and Point-Set Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:201-210 [Conf]
  22. Rajeev Motwani, Arvind Raghunathan, Huzur Saran
    Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:211-223 [Conf]
  23. David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
    Searching for Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:224-228 [Conf]
  24. Boris Aronov, Steven Fortune, Gordon T. Wilfong
    The Furthest-Site Geodesic Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:229-240 [Conf]
  25. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
    Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:241-251 [Conf]
  26. Tetsuo Asano, Binay K. Bhattacharya, Mark Keil, F. Frances Yao
    Clustering Algorithms Based on Minimum and Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:252-257 [Conf]
  27. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangements of Jordan Arcs with Three Intersections per Pair. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  28. Laxmi Gewali, Alex Meng, Joseph S. B. Mitchell, Simeon C. Ntafos
    Path Planning in 0/1/infinity Weighted Regions with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:266-278 [Conf]
  29. Gordon T. Wilfong
    Motion Planning in the Presence of Movable Obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:279-288 [Conf]
  30. Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony
    On the General Motion Planning Problem with Two Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:289-298 [Conf]
  31. B. K. Natarajan
    On Planning Assemblies. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:299-308 [Conf]
  32. Bruce Randall Donald
    The Complexity of Planar Compliant Motion Planning Under Uncertainty. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:309-318 [Conf]
  33. Micha Sharir, Shmuel Sifrony
    Coordinated Motion Planning for Two Independent Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:319-328 [Conf]
  34. Klara Kedem, Micha Sharir
    An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:329-340 [Conf]
  35. Joseph S. B. Mitchell
    On Maximum Flows in Polyhedral Domains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:341-351 [Conf]
  36. Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai
    Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:352-361 [Conf]
  37. Jerzy W. Jaromczyk, Miroslaw Kowaluk
    Skewed Projections with an Application to Line Stabbing in R3. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:362-370 [Conf]
  38. M. McKenna, Joseph O'Rourke
    Arrangements of Lines in 3-Space: A Data Structure with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:371-380 [Conf]
  39. Boris Aronov, Micha Sharir
    Triangles in Space or Building (and Analyzing) Castles in the Air. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:381-391 [Conf]
  40. Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:392-402 [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