The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Computational Geometry (compgeom)
1993 (conf/compgeom/93)

  1. Mark de Berg
    Generalized Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:1-10 [Conf]
  2. Dan Halperin, Micha Sharir
    New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:11-18 [Conf]
  3. Marco Pellegrini
    On Lines Missing Polyhedral Sets in 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:19-28 [Conf]
  4. Dan Halperin, Chee-Keng Yap
    Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:29-37 [Conf]
  5. Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld
    An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:38-46 [Conf]
  6. David P. Dobkin, David Eppstein
    Computing the Discrepancy. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:47-52 [Conf]
  7. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Optimally Sparse Spanners in 3-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:53-62 [Conf]
  8. Nina Amenta
    Helly Theorems and Generalized Linear Programming. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:63-72 [Conf]
  9. Michael T. Goodrich
    Geometric Partitioning Made Easier, Even in Parallel. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:73-82 [Conf]
  10. Shreesh Jadhav, Asish Mukhopadhyay
    Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:83-90 [Conf]
  11. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
    Approximating Center Points with Iterated Radon Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:91-98 [Conf]
  12. David Eppstein, Gary L. Miller, Shang-Hua Teng
    A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:99-108 [Conf]
  13. A. Corbalan, M. L. Mazón, Tomás Recio, Francisco Santos
    On the Topological Shape of Planar Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:109-115 [Conf]
  14. Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
    Convex Distance Functions in 3-Space are Different. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:116-123 [Conf]
  15. Rolf Klein, Andrzej Lingas
    A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:124-132 [Conf]
  16. David G. Kirkpatrick, Jack Snoeyink
    Tentative Prune-and-Search for Computing Voronoi Vertices. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:133-142 [Conf]
  17. Yui-Bin Chen, Doug Ierardi
    Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:143-152 [Conf]
  18. Zhenyu Li, Victor Milenkovic
    A Compaction Algorithm for Non-Convex Polygons and Its Application. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:153-162 [Conf]
  19. Steven Fortune, Christopher J. Van Wyk
    Efficient Exact Arithmetic for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:163-172 [Conf]
  20. Sándor P. Fekete, William R. Pulleyblank
    Area Optimization of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:173-182 [Conf]
  21. Marshall W. Bern, David Eppstein
    Worst-Case Bounds for Subadditive Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:183-188 [Conf]
  22. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
    Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:189-197 [Conf]
  23. Matthew J. Katz, Micha Sharir
    An Expander-Based Approach to Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:198-207 [Conf]
  24. Thomas Dubé
    Dominance Range-Query: The One-Reporting Case. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:208-217 [Conf]
  25. Herbert Edelsbrunner
    The Union of Balls and Its Dual Shape. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:218-231 [Conf]
  26. Cecil Jose A. Delfinado, Herbert Edelsbrunner
    An Incremental Algorithm for Betti Numbers of Simplicial Complexes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:232-239 [Conf]
  27. Ketan Mulmuley
    Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:240-246 [Conf]
  28. Jack Snoeyink, Jorge Stolfi
    Objects That Cannot be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:247-256 [Conf]
  29. Noga Alon, Sridhar Rajagopalan, Subhash Suri
    Long Non-Crossing Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:257-263 [Conf]
  30. János Pach, Jenö Töröcsik
    Some Geometric Applications of Dilworth's Theorem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:264-269 [Conf]
  31. Tamal K. Dey, Herbert Edelsbrunner
    Counting Triangle Crossings and Halving Planes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:270-273 [Conf]
  32. L. Paul Chew
    Guaranteed-Quality Mesh Generation for Curved Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:274-280 [Conf]
  33. Marshall W. Bern
    Compatible Tetrahedralizations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:281-288 [Conf]
  34. Nancy M. Amato, Franco P. Preparata
    An NC Parallel 3D Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:289-297 [Conf]
  35. Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin
    Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:298-307 [Conf]
  36. Joseph S. B. Mitchell
    Shortest Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:308-317 [Conf]
  37. Michael T. Goodrich, Roberto Tamassia
    Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:318-327 [Conf]
  38. Michel Pocchiola, Gert Vegter
    The Visibility Complex. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:328-337 [Conf]
  39. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs be Represented Compactly? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:338-347 [Conf]
  40. Paul J. Heffernan
    An Optimal Algorithm for the Two-Guard Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:348-358 [Conf]
  41. Ashim Garg, Michael T. Goodrich, Roberto Tamassia
    Area-Efficient Upward Tree Drawings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:359-368 [Conf]
  42. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
    Decision Trees for Geometric Models. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:369-378 [Conf]
  43. Y. B. Karasik, Micha Sharir
    The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:379-388 [Conf]
  44. Seth J. Teller
    Visualizing Fortune's Sweepline Algorithm for Planar Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:393- [Conf]
  45. David P. Dobkin, Ayellet Tal
    Building and Using Polyhedral Hierarchies. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:394- [Conf]
  46. Stefan Schirra
    Moving a Disc Between Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:395-396 [Conf]
  47. John Hershberger
    Compliant Motion in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:397-398 [Conf]
  48. Estarose Wolfson, Micha Sharir
    Implementation of a Motion Planning System in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:399-400 [Conf]
  49. Pedro Jussieu de Rezende, Welson R. Jacometti
    Animation of Geometric Algorithms Using GeoLab. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:401-402 [Conf]
  50. Michael Murphy, Steven Skiena
    Ranger: A Tool for Nearest Neighbor Search in High Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:403-404 [Conf]
  51. Jack Snoeyink
    Video: Objects that Cannot be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:405- [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002