The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Computational Geometry (compgeom)
1999 (conf/compgeom/99)

  1. Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
    Sliver Exudation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:1-13 [Conf]
  2. Oswin Aichholzer
    The Path of a Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:14-23 [Conf]
  3. Herbert Edelsbrunner, Daniel R. Grayson
    Edgewise Subdivision of a Simplex. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:24-30 [Conf]
  4. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
    Efficient Algorithms for Maximum Regression Depth. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:31-40 [Conf]
  5. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:41-48 [Conf]
  6. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:49-58 [Conf]
  7. Steven Fortune
    Topological Beam Tracing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:59-68 [Conf]
  8. Marco Pellegrini
    A Geometric Approach to Computing Higher Order Form Factors. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:69-78 [Conf]
  9. Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
    Geometric Pattern Matching: A Performance Study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:79-85 [Conf]
  10. Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
    Empirical Design of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:86-94 [Conf]
  11. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    Geometric Algorithms for Trap Design. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:95-104 [Conf]
  12. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:105-114 [Conf]
  13. Richard J. Anderson, Sumeet Sobti
    The Table Layout Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:115-123 [Conf]
  14. János Pach, Joel Spencer, Géza Tóth
    New Bounds on Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:124-133 [Conf]
  15. Alon Efrat
    The Complexity of the Union of (alpha, beta)-Covered Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:134-142 [Conf]
  16. Pankaj K. Agarwal, Micha Sharir
    Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:143-153 [Conf]
  17. Boris Aronov, Tamal K. Dey
    Polytopes in Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:154-162 [Conf]
  18. Sigal Raab
    Controlled Perturbation for Arrangements of Polyhedral Surfaces with Application to Swept Volumes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:163-172 [Conf]
  19. Steven A. Wilmarth, Nancy M. Amato, Peter F. Stiller
    Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:173-180 [Conf]
  20. Olivier Devillers
    On Deletion in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:181-188 [Conf]
  21. Christopher M. Gold
    Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:189-196 [Conf]
  22. Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos
    Curve Reconstruction: Connecting Dots with Good Reason. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:197-206 [Conf]
  23. Joachim Giesen
    Curve Reconstruction, the Traveling Salesman Problem and Menger's Theorem on Length. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:207-216 [Conf]
  24. Sándor P. Fekete, Henk Meijer
    On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:217-226 [Conf]
  25. Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum
    Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:227-236 [Conf]
  26. John Hershberger, Subhash Suri
    Kinetic Connectivity of Rectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:237-246 [Conf]
  27. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:247-254 [Conf]
  28. Leonidas J. Guibas, Menelaos I. Karavelas
    Interval Methods for Kinetic Simulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:255-264 [Conf]
  29. Leonidas J. Guibas, David Hsu, Li Zhang
    H-Walk: Hierarchical Distance Computation for Moving Convex Bodies. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:265-273 [Conf]
  30. Ileana Streinu
    Stretchability of Star-Like Pseudo-Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:274-280 [Conf]
  31. Jae-Ha Lee, Sung Yong Shin, Kyung-Yong Chwa
    Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:281-290 [Conf]
  32. Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
    On Bisectors for Different Distance Functions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:291-299 [Conf]
  33. Satish Rao
    Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:300-306 [Conf]
  34. Pedro A. Ramos
    Computing Roundness is Easy if the Set is Almost Round. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:307-315 [Conf]
  35. David Lutterkort, Jörg Peters
    Smooth Paths in a Polygonal Channel. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:316-321 [Conf]
  36. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu
    Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:322-331 [Conf]
  37. Chandrajit L. Bajaj, Guoliang Xu
    Error Bounded Regular Algebraic Spline Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:332-340 [Conf]
  38. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra
    Efficient Exact Geometric Computation Made Easy. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:341-350 [Conf]
  39. Vijay Karamcheti, C. Li, Igor Pechtchanski, C. Yap
    A Core Library for Robust Numeric and Geometric Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:351-359 [Conf]
  40. John Keyser, Tim Culver, Dinesh Manocha, Shankar Krishnan
    MAPC: A Library for Efficient and Exact Manipulation of Algebraic Points and Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:360-369 [Conf]
  41. Jean-Daniel Boissonnat, Jack Snoeyink
    Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:370-379 [Conf]
  42. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:380-389 [Conf]
  43. Edgar A. Ramos
    On Range Reporting, Ray Shooting and k-Level Construction. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:390-399 [Conf]
  44. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:400-406 [Conf]
  45. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko
    Metamorphosis of the Cube. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:409-410 [Conf]
  46. Konrad Polthier, Markus Schmies, Martin Steffens, Christian Teitzel
    The Video "Geodesics and Waves". [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:411-412 [Conf]
  47. Maria Shneerson, Avner Shapiro, Ayellet Tal
    Polyhedron Realization and Its Application to Metamorphosis. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:413-414 [Conf]
  48. Arthur D. Gregory, Andrei State, Ming C. Lin, Dinesh Manocha, Mark A. Livingston
    Feature-Based Surface Decomposition for Polyhedral Morphing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:415-416 [Conf]
  49. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop
    Efficient Perspective-Accurate Silhouette Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:417-418 [Conf]
  50. Martin Isenburg, Jack Snoeyink
    Mesh Collapse Compression. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:419-420 [Conf]
  51. Jean-Daniel Boissonnat, Frédéric Cazals, Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, Mariette Yvinec
    Programming with CGAL: The Example of Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:421-422 [Conf]
  52. Nina Amenta
    The Crust Algorithm for 3D Surface Reconstruction. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:423-424 [Conf]
  53. David P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North
    Uncluttering Force-Directed Graph Layouts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:425-426 [Conf]
  54. Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang
    Kinetic Data Structures: Animating Proofs Through Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:427-428 [Conf]
  55. Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. Lin
    Graph Partitioning and Ordering for Interactive Proximity Queries. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:429-430 [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