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)
1986 (conf/compgeom/86)

  1. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
    Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:1-13 [Conf]
  2. Subhash Suri, Joseph O'Rourke
    Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:14-23 [Conf]
  3. Wei-pang Chin, Simeon C. Ntafos
    Optimum Watchman Routes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:24-33 [Conf]
  4. C. Wang, Edward P. F. Chan
    Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:34-42 [Conf]
  5. J. Mark Keil
    Minimally Covering a Horizontally Convex Orthogonal Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:43-51 [Conf]
  6. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
    On Computing Simple Circuits on a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:52-60 [Conf]
  7. David Haussler, Emo Welzl
    Epsilon-Nets and Simplex Range Queries. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:61-71 [Conf]
  8. Andrzej Lingas
    On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:72-79 [Conf]
  9. Dan E. Willard
    On the Application of Shared Retrieval to Orthogonal Range Queries. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:80-89 [Conf]
  10. Leonidas J. Guibas, Raimund Seidel
    Computing Convolutions by Reciprocal Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:90-99 [Conf]
  11. Christos Levcopoulos
    Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:100-108 [Conf]
  12. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
    Optimal Dynamic Solutions for Fixed Windowing Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:109-115 [Conf]
  13. V. Vijayan
    Geometry of Planar Graphs with Angles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:116-124 [Conf]
  14. Henry Crapo, Juliette Ryan
    Scene Analysis and Geometric Homology. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:125-132 [Conf]
  15. David Avis, Hossam A. ElGindy
    Triangulating Simplicial Point Sets in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:133-141 [Conf]
  16. Walter Whiteley
    Two Algorithms for Polyhedral Pictures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:142-149 [Conf]
  17. David M. Mount
    Storing the Subdivision of a Polyhedral Surface. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:150-158 [Conf]
  18. A. H. Schoen
    A Defect-Correction algorithm for Minimizing the Volume of a Simple Polyhedron Which Circumscribes a Sphere. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:159-168 [Conf]
  19. Paul Chew
    There is a Planar Graph Almost as Good as the Complete Graph. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:169-177 [Conf]
  20. Shmuel Sifrony, Micha Sharir
    A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:178-186 [Conf]
  21. S. Maddila, Chee-Keng Yap
    Moving a Polygon Around the Corner in a Corridor. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:187-192 [Conf]
  22. Micha Sharir, Avikam Baltsan
    On Shortest Paths Amidst Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:193-206 [Conf]
  23. V. Visvanathan, Linda S. Milor
    An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear Transformation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:207-215 [Conf]
  24. Mikhail J. Atallah, Michael T. Goodrich
    Efficient Plane Sweeping in Parallel. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:216-225 [Conf]
  25. Per-Olof Fjällström
    Smoothing of Polyhedral Hodels. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:226-235 [Conf]
  26. Dayong Zhang, Adrian Bowyer
    CSG Set-Theoretic Solid Modelling and NC Machining of Blend Aurfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:236-245 [Conf]
  27. D. A. Field
    Implementing Watson's Algorithm in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:246-259 [Conf]
  28. Jean-Daniel Boissonnat, Monique Teillaud
    The Hierarchical Representation of Objects: The Delaunay Tree. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:260-268 [Conf]
  29. Ferenc Dévai
    Quadratic Bounds for Hidden Line Elimination. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:269-275 [Conf]
  30. Rex A. Dwyer
    A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:276-284 [Conf]
  31. Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber
    Geometric Applications of a Matrix Searching Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:285-292 [Conf]
  32. Bernard Chazelle, Herbert Edelsbrunner
    Linear Data Structures for Two Types of Range Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:293-302 [Conf]
  33. Rajeev Motwani, Prabhakar Raghavan
    Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:303-312 [Conf]
  34. Steven Fortune
    A Sweepline Algorithm for Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:313-322 [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