The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Raimund Seidel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Raimund Seidel
    Linear Programming and Convex Hulls Made Easy. [Citation Graph (3, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:211-215 [Conf]
  2. David G. Kirkpatrick, Raimund Seidel
    The Ultimate Planar Convex Hull Algorithm? [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:287-299 [Journal]
  3. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
    On the Zone Theorem for Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    New Results and New Trends in Computer Science, 1991, pp:108-123 [Conf]
  4. Raimund Seidel
    Teaching Computational Geometry. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:272-272 [Conf]
  5. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
    Results on k-Sets and j-Facets via Continuous Motion. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:192-199 [Conf]
  6. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Slimming Down by Adding: Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:116-127 [Conf]
  7. 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]
  8. 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]
  9. Leonidas J. Guibas, Raimund Seidel
    Computing Convolutions by Reciprocal Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:90-99 [Conf]
  10. 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]
  11. Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
    Checking Geometric Programs or Verification of Geometric Structures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:159-165 [Conf]
  12. Jim Ruppert, Raimund Seidel
    On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:380-392 [Conf]
  13. 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]
  14. Raimund Seidel, Nicola Wolpert
    On the exact computation of the topology of real algebraic curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:107-115 [Conf]
  15. Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
    Between umbra and penumbra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:265-274 [Conf]
  16. Reinhard Wilhelm, Tomasz Müldner, Raimund Seidel
    Algorithm Explanation: Visualizing Abstract States and Invariants. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:381-394 [Conf]
  17. Cecilia R. Aragon, Raimund Seidel
    Randomized Search Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:540-545 [Conf]
  18. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:242-251 [Conf]
  19. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
    Constructing Arrangements of Lines and Hyperplanes with Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:83-91 [Conf]
  20. Jeff Erickson, Raimund Seidel
    Better Lower Bounds on Detecting Affine and Spherical Degeneracies [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:528-536 [Conf]
  21. Raimund Seidel
    Developments in Data Structure Research During the First 25 Years of FSTTCS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:48-59 [Conf]
  22. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:214-229 [Conf]
  23. Jirí Matousek, Raimund Seidel
    A Tail Estimate for Mulmuley's Segment Intersection Algorithm. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:427-438 [Conf]
  24. Raimund Seidel
    A New Method for Solving Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1981, pp:338-342 [Conf]
  25. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: The Convex Case. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:624-634 [Conf]
  26. Udo Adamy, Raimund Seidel
    On the Exact Worst Case Query Complexity of Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:609-618 [Conf]
  27. Dierk Johannes, Raimund Seidel, Reinhard Wilhelm
    Algorithm animation using shape analysis: visualising abstract executions. [Citation Graph (0, 0)][DBLP]
    SOFTVIS, 2005, pp:17-26 [Conf]
  28. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:463-474 [Conf]
  29. Raimund Seidel
    The Nature and Meaning of Perturbations in Geometric Computing. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:3-17 [Conf]
  30. Raimund Seidel
    Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:404-413 [Conf]
  31. Raimund Seidel
    On the All-Pairs-Shortest-Path Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:745-749 [Conf]
  32. Raimund Seidel
    Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:1- [Conf]
  33. Ioannis Z. Emiris, John F. Canny, Raimund Seidel
    Efficient Perturbations for Handling Geometric Degeneracies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:1/2, pp:219-242 [Journal]
  34. Raimund Seidel, Cecilia R. Aragon
    Randomized Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:464-497 [Journal]
  35. Raimund Seidel
    On the Number of Triangulations of Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:2, pp:297-299 [Journal]
  36. Boris Aronov, Raimund Seidel, Diane L. Souvaine
    On Compatible Triangulations of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:27-35 [Journal]
  37. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:305-323 [Journal]
  38. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:185-212 [Journal]
  39. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
    Checking geometric programs or verification of geometric structures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:85-103 [Journal]
  40. Raimund Seidel
    The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:115-116 [Journal]
  41. Emo Welzl, David Avis, David Bremner, Raimund Seidel
    How Good Are Convex Hull Algorithms?. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:265-301 [Journal]
  42. Raimund Seidel
    A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:51-64 [Journal]
  43. Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel
    Some methods of computational geometry applied to computer graphics. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1984, v:28, n:1, pp:92-108 [Journal]
  44. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangement of Jordan Arcs with Three Intersection per Pair. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  45. 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]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:433-466 [Journal]
  46. Herbert Edelsbrunner, Raimund Seidel
    Voronoi Diagrams and Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:25-44 [Journal]
  47. Jeff Erickson, Raimund Seidel
    Better Lower Bounds on Detecting Affine and Spherical Degeneracies. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:41-57 [Journal]
  48. Jeff Erickson, Raimund Seidel
    Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:2, pp:239-240 [Journal]
  49. Leonidas J. Guibas, Raimund Seidel
    Computing Convolutions by Reciprocal Search. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:175-193 [Journal]
  50. 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]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  51. Raimund Seidel
    Small-Dimensional Linear Programming and Convex Hulls Made Easy. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:423-434 [Journal]
  52. Raimund Seidel
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:285-285 [Journal]
  53. Raimund Seidel
    The Nature and Meaning of Perturbations in Geometric Computing. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:1, pp:1-17 [Journal]
  54. Jim Ruppert, Raimund Seidel
    On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:227-253 [Journal]
  55. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: the Convex Case. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:5, pp:463-476 [Journal]
  56. Khaled Elbassioni, Zvi Lotker, Raimund Seidel
    Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:2, pp:69-71 [Journal]
  57. Raimund Seidel, Udo Adamy
    On the Exact Worst Case Query Complexity of Planar Point Location. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:1, pp:189-217 [Journal]
  58. Raimund Seidel
    On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:400-403 [Journal]
  59. Francisco Santos, Raimund Seidel
    A better upper bound on the number of triangulations of a planar point set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:102, n:1, pp:186-193 [Journal]
  60. Ziv Gigus, John F. Canny, Raimund Seidel
    Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:6, pp:542-551 [Journal]
  61. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1138-1151 [Journal]
  62. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
    Constructing Arrangements of Lines and Hyperplanes with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:341-363 [Journal]
  63. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
    On the Zone Theorem for Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:418-429 [Journal]
  64. Raimund Seidel, Micha Sharir
    Top-Down Analysis of Path Compression. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:515-525 [Journal]
  65. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:319-336 [Journal]
  66. Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
    On the shape of a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:551-558 [Journal]
  67. Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
    On the Number of Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:97-107 [Conf]
  68. Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
    On Computing the Centroid of the Vertices of an Arrangement and Related Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:519-528 [Conf]

  69. Maintaining Ideally Distributed Random Search Trees without Extra Space. [Citation Graph (, )][DBLP]


  70. Teaching Computational Geometry, II. [Citation Graph (, )][DBLP]


  71. Finding the optimal shadows of a convex polytope. [Citation Graph (, )][DBLP]


  72. Output-size sensitive algorithms for finding maximal vectors. [Citation Graph (, )][DBLP]


  73. Voronoi diagrams and arrangements. [Citation Graph (, )][DBLP]


  74. Data-Specific Analysis of String Sorting. [Citation Graph (, )][DBLP]


  75. Algorithm visualization using concrete and abstract shape graphs. [Citation Graph (, )][DBLP]


  76. On the complexity of umbra and penumbra. [Citation Graph (, )][DBLP]


  77. Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. [Citation Graph (, )][DBLP]


  78. Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. [Citation Graph (, )][DBLP]


  79. Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices [Citation Graph (, )][DBLP]


Search in 0.184secs, Finished in 0.186secs
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