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)
1987 (conf/compgeom/87)

  1. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
    Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  2. John Hershberger
    Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:11-20 [Conf]
  3. Franz Aurenhammer
    Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:21-29 [Conf]
  4. Joseph S. B. Mitchell, Christos H. Papadimitriou
    The Weighted Region Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:30-38 [Conf]
  5. Boris Aronov
    On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:39-49 [Conf]
  6. Leonidas J. Guibas, John Hershberger
    Optimal Shortest Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:50-63 [Conf]
  7. Subhash Suri
    The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:64-75 [Conf]
  8. Jorge Stolfi
    Oriented Projective Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:76-85 [Conf]
  9. David P. Dobkin, Michael J. Laszlo
    Primitives for the Manipulation of Three-Dimensional Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:86-99 [Conf]
  10. Leila De Floriani
    A Graph Based Approach to Object Feature Recognition. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:100-109 [Conf]
  11. Wm. Randolph Franklin
    Polygon Properties Calculated from the Vertex Neighborhoods. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:110-118 [Conf]
  12. Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich
    Numerical Stability of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:119-125 [Conf]
  13. Robert L. (Scot) Drysdale III, Robert B. Jerard
    Discrete Simulation of NC Machining. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:126-135 [Conf]
  14. Yan Ke, Joseph O'Rourke
    Moving a Ladder in Three Dimensions: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:136-146 [Conf]
  15. B. K. Natarajan
    On Detecting the Orientation of Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:147-152 [Conf]
  16. John F. Canny, Bruce Randall Donald
    Simplified Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:153-161 [Conf]
  17. Panagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec
    An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:162-170 [Conf]
  18. Chandrajit L. Bajaj, Myung-Soo Kim
    Compliant Motion Planning with Geometric Models. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:171-180 [Conf]
  19. Raimund Seidel
    On the Number of Faces in Higher-Dimensional Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:181-185 [Conf]
  20. Michael B. Dillencourt
    Toughness and Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:186-194 [Conf]
  21. Alan Saalfeld
    Joint Triangulations and Triangulation Maps. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:195-204 [Conf]
  22. N. Dadoun, David G. Kirkpatrick
    Parallel Processing for Efficient Subdivision Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:205-214 [Conf]
  23. L. Paul Chew
    Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:215-222 [Conf]
  24. Cao An Wang, Lenhart K. Schubert
    An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:223-232 [Conf]
  25. Jerzy W. Jaromczyk, Miroslaw Kowaluk
    A Note on Relative Neighborhood Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:233-241 [Conf]
  26. Francis Avnaim, Jean-Daniel Boissonnat
    Simultaneous Containment of Several Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:242-247 [Conf]
  27. Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
    Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:251-257 [Conf]
  28. Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano
    A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:258-267 [Conf]
  29. Robert A. Reckhow, Joseph C. Culberson
    Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:268-277 [Conf]
  30. Alok Aggarwal, Subhash Suri
    Fast Algorithms for Computing the Largest Empty Rectangle. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:278-290 [Conf]
  31. J. Ian Munro, Mark H. Overmars, Derick Wood
    Variations on Visibility. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:291-299 [Conf]
  32. David Avis, Rephael Wenger
    Algorithms for Line Transversals in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:300-307 [Conf]
  33. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:308-315 [Conf]
  34. David G. Kirkpatrick
    Establishing Order in Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:316-321 [Conf]
  35. David Rappaport
    Computing Simple Circuits from a Set of Line Segments is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:322-330 [Conf]
  36. Noga Alon, David Haussler, Emo Welzl
    Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:331-340 [Conf]
  37. Joe D. Warren
    Blending Quadric Surfaces with Wuadric and Cubic Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:341-347 [Conf]
  38. Art J. Schwartz, Charles Stanton
    Analyzing Surfaces: The Truth About Elimination Theory. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:348-353 [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