Raimund Seidel

Menelaos I. Karavelas, Raimund Seidel, Eleni Tzanaki: Convex hulls of spheres and convex hulls of disjoint convex polytopes. Comput. Geom. 46(6): 615-630 (2013)

Brian Wyvill, Paul G. Kry, Raimund Seidel, David Mould: Determining an Aesthetic Inscribed Curve. Computational Aesthetics 2012: 63-70

Victor Alvarez, David G. Kirkpatrick, Raimund Seidel: Can Nearest Neighbor Searching Be Simple and Always Fast? ESA 2011: 82-92

Victor Alvarez, Raimund Seidel: Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. Comput. Geom. 43(2): 94-98 (2010)

Raimund Seidel: Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. 43(6-7): 556-564 (2010)

Raimund Seidel: Data-Specific Analysis of String Sorting. SODA 2010: 1278-1286

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel: On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (2009)

Raimund Seidel: Maintaining Ideally Distributed Random Search Trees without Extra Space. Efficient Algorithms 2009: 134-142

Raimund Seidel: Teaching Computational Geometry, II. CCCG 2009: 173

Sascha A. Parduhn, Raimund Seidel, Reinhard Wilhelm: Algorithm visualization using concrete and abstract shape graphs. SOFTVIS 2008: 33-36

Raimund Seidel: Faires Teilen: Eine Weihnachtsstollengeschichte. Taschenbuch der Algorithmen 2008: 331-340

Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel: On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel: Between umbra and penumbra. Symposium on Computational Geometry 2007: 265-274

Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary: On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS 2007: 519-528

Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. Inf. Process. Lett. 100(2): 69-71 (2006)

Raimund Seidel: Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). SWAT 2006: 1

Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel: Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geometry Appl. 15(5): 463-476 (2005)

Raimund Seidel, Micha Sharir: Top-Down Analysis of Path Compression. SIAM J. Comput. 34(3): 515-525 (2005)

Raimund Seidel, Nicola Wolpert: On the exact computation of the topology of real algebraic curves. Symposium on Computational Geometry 2005: 107-115

Raimund Seidel: Developments in Data Structure Research During the First 25 Years of FSTTCS. FSTTCS 2005: 48-59

Dierk Johannes, Raimund Seidel, Reinhard Wilhelm: Algorithm animation using shape analysis: visualising abstract executions. SOFTVIS 2005: 17-26

Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices. CoRR abs/cs/0507038 (2005)

Francisco Santos, Raimund Seidel: A better upper bound on the number of triangulations of a planar point set. J. Comb. Theory, Ser. A 102(1): 186-193 (2003)

Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel: Maximizing a Voronoi Region: The Convex Case. ISAAC 2002: 624-634

Reinhard Wilhelm, Tomasz Müldner, Raimund Seidel: Algorithm Explanation: Visualizing Abstract States and Invariants. Software Visualization 2001: 381-394

Raimund Seidel, Udo Adamy: On the Exact Worst Case Query Complexity of Planar Point Location. J. Algorithms 37(1): 189-217 (2000)

Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig: Checking geometric programs or verification of geometric structures. Comput. Geom. 12(1-2): 85-103 (1999)

Raimund Seidel: On the Number of Triangulations of Planar Point Sets. Combinatorica 18(2): 297-299 (1998)

Raimund Seidel: The Nature and Meaning of Perturbations in Geometric Computing. Discrete & Computational Geometry 19(1): 1-17 (1998)

Raimund Seidel: Guest Editor's Foreword. Discrete & Computational Geometry 20(3): 285 (1998)

Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl: Results on k-Sets and j-Facets via Continuous Motion. Symposium on Computational Geometry 1998: 192-199

Udo Adamy, Raimund Seidel: On the Exact Worst Case Query Complexity of Planar Point Location. SODA 1998: 609-618

Ioannis Z. Emiris, John F. Canny, Raimund Seidel: Efficient Perturbations for Handling Geometric Degeneracies. Algorithmica 19(1/2): 219-242 (1997)

David Avis, David Bremner, Raimund Seidel: How Good Are Convex Hull Algorithms?. Comput. Geom. 7: 265-301 (1997)

Jeff Erickson, Raimund Seidel: Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 18(2): 239-240 (1997)

Raimund Seidel, Cecilia R. Aragon: Randomized Search Trees. Algorithmica 16(4/5): 464-497 (1996)

Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig: Checking Geometric Programs or Verification of Geometric Structures. Symposium on Computational Geometry 1996: 159-165

Raimund Seidel: The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version. Comput. Geom. 5: 115-116 (1995)

Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 13: 41-57 (1995)

Raimund Seidel: On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci. 51(3): 400-403 (1995)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994)

Raimund Seidel: The Nature and Meaning of Perturbations in Geometric Computing. STACS 1994: 3-17

Boris Aronov, Raimund Seidel, Diane L. Souvaine: On Compatible Triangulations of Simple Polygons. Comput. Geom. 3: 27-35 (1993)

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993)

Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993)

Raimund Seidel: Teaching Computational Geometry. CCCG 1993: 272-272

Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies. FOCS 1993: 528-536

Jim Ruppert, Raimund Seidel: On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra. Discrete & Computational Geometry 7: 227-253 (1992)

Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992)

Jirí Matousek, Raimund Seidel: A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP 1992: 427-438

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. STACS 1992: 463-474

Raimund Seidel: On the All-Pairs-Shortest-Path Problem. STOC 1992: 745-749

Raimund Seidel: A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Comput. Geom. 1: 51-64 (1991)

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. Comput. Geom. 1: 305-323 (1991)

Raimund Seidel: Small-Dimensional Linear Programming and Convex Hulls Made Easy. Discrete & Computational Geometry 6: 423-434 (1991)

Ziv Gigus, John F. Canny, Raimund Seidel: Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects. IEEE Trans. Pattern Anal. Mach. Intell. 13(6): 542-551 (1991)

Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science 1991: 108-123

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Slimming Down by Adding: Selecting Heavily Covered Points. Symposium on Computational Geometry 1990: 116-127

Raimund Seidel: Linear Programming and Convex Hulls Made Easy. Symposium on Computational Geometry 1990: 211-215

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. FOCS 1990: 242-251

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989)

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. Discrete & Computational Geometry 4: 523-539 (1989)

Jim Ruppert, Raimund Seidel: On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. Symposium on Computational Geometry 1989: 380-392

Cecilia R. Aragon, Raimund Seidel: Randomized Search Trees. FOCS 1989: 540-545

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. Discrete & Computational Geometry 3: 281-293 (1988)

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69

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. Symposium on Computational Geometry 1988: 258-265

Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229

Ziv Gigus, John F. Canny, Raimund Seidel: Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects. ICCV 1988: 30-39

Leonidas J. Guibas, Raimund Seidel: Computing Convolutions by Reciprocal Search. Discrete & Computational Geometry 2: 175-193 (1987)

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. Symposium on Computational Geometry 1987: 1-10

Raimund Seidel: On the Number of Faces in Higher-Dimensional Voronoi Diagrams. Symposium on Computational Geometry 1987: 181-185

Herbert Edelsbrunner, Raimund Seidel: Voronoi Diagrams and Arrangements. Discrete & Computational Geometry 1: 25-44 (1986)

David G. Kirkpatrick, Raimund Seidel: The Ultimate Planar Convex Hull Algorithm? SIAM J. Comput. 15(1): 287-299 (1986)

Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel: Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15(2): 341-363 (1986)

Leonidas J. Guibas, Raimund Seidel: Computing Convolutions by Reciprocal Search. Symposium on Computational Geometry 1986: 90-99

Raimund Seidel: Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face. STOC 1986: 404-413

Michael McKenna, Raimund Seidel: Finding the optimal shadows of a convex polytope. Symposium on Computational Geometry 1985: 24-28

David G. Kirkpatrick, Raimund Seidel: Output-size sensitive algorithms for finding maximal vectors. Symposium on Computational Geometry 1985: 89-96

Herbert Edelsbrunner, Raimund Seidel: Voronoi diagrams and arrangements. Symposium on Computational Geometry 1985: 251-262

Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel: Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing 28(1): 92-108 (1984)

Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel: On the shape of a set of points in the plane. IEEE Transactions on Information Theory 29(4): 551-558 (1983)

Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel: Constructing Arrangements of Lines and Hyperplanes with Applications. FOCS 1983: 83-91

Raimund Seidel: A New Method for Solving Constraint Satisfaction Problems. IJCAI 1981: 338-342