Raimund Seidel

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 7

Top Topics

Predictive Accuracy

Top Venues

Discret. Comput. Geom.

Comput. Aided Des.

Publications

Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI (2023)
Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69 (3) (2023)
Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR (2023)
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR (2022)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Inserting One Edge into a Simple Drawing Is Hard. WG (2020)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Extending simple drawings with one edge is hard. CoRR (2019)
Mukul Sati, Jarek Rossignac, Raimund Seidel, Brian Wyvill, Suraj Musuvathy
Average curve of n smooth planar curves. Comput. Aided Des. 70 (2016)
Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48 (5) (2015)
Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
Counting Triangulations and other Crossing-Free Structures Approximately. CoRR (2014)
Menelaos I. Karavelas, Raimund Seidel, Eleni Tzanaki
Convex hulls of spheres and convex hulls of disjoint convex polytopes. Comput. Geom. 46 (6) (2013)
Victor Alvarez, Raimund Seidel
A simple aggregative algorithm for counting triangulations of planar point sets and related problems. SoCG (2013)
Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel
Counting Triangulations Approximately. CCCG (2013)
Brian Wyvill, Paul G. Kry, Raimund Seidel, David Mould
Determining an Aesthetic Inscribed Curve. CAe@Expressive (2012)
Victor Alvarez, David G. Kirkpatrick, Raimund Seidel
Can Nearest Neighbor Searching Be Simple and Always Fast? ESA (2011)
Raimund Seidel
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. 43 (6-7) (2010)
Lars Arge, Erik D. Demaine, Raimund Seidel
10091 Abstracts Collection - Data Structures. Data Structures (2010)
Victor Alvarez, Raimund Seidel
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. Comput. Geom. 43 (2) (2010)
Raimund Seidel
Data-Specific Analysis of String Sorting. SODA (2010)
Raimund Seidel
Teaching Computational Geometry, II. CCCG (2009)
Raimund Seidel
Maintaining Ideally Distributed Random Search Trees without Extra Space. Efficient Algorithms (2009)
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
On the complexity of umbra and penumbra. Comput. Geom. 42 (8) (2009)
Lars Arge, Robert Sedgewick, Raimund Seidel
08081 Abstracts Collection - Data Structures. Data Structures (2008)
Sascha A. Parduhn, Raimund Seidel, Reinhard Wilhelm
Algorithm visualization using concrete and abstract shape graphs. SOFTVIS (2008)
Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
On the Number of Cycles in Planar Graphs. COCOON (2007)
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS (2007)
Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
Between umbra and penumbra. SCG (2007)
Raimund Seidel
Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). SWAT (2006)
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) (2006)
Raimund Seidel, Nicola Wolpert
On the exact computation of the topology of real algebraic curves. SCG (2005)
Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel
Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices CoRR (2005)
Raimund Seidel, Micha Sharir
Top-Down Analysis of Path Compression. SIAM J. Comput. 34 (3) (2005)
Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geom. Appl. 15 (5) (2005)
Dierk Johannes, Raimund Seidel, Reinhard Wilhelm
Algorithm animation using shape analysis: visualising abstract executions. SOFTVIS (2005)
Raimund Seidel
Developments in Data Structure Research During the First 25 Years of FSTTCS. FSTTCS (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) (2003)
Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
Maximizing a Voronoi Region: The Convex Case. ISAAC (2002)
Reinhard Wilhelm, Tomasz Müldner, Raimund Seidel
Algorithm Explanation: Visualizing Abstract States and Invariants. Software Visualization (2001)
Raimund Seidel, Udo Adamy
On the Exact Worst Case Query Complexity of Planar Point Location. J. Algorithms 37 (1) (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) (1999)
Udo Adamy, Raimund Seidel
On the Exact Worst Case Query Complexity of Planar Point Location. SODA (1998)
Raimund Seidel
Guest Editor's Foreword. Discret. Comput. Geom. 20 (3) (1998)
Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
-Facets via Continuous Motion. SCG (1998)
Raimund Seidel
On the Number of Triangulations of Planar Point Sets. Comb. 18 (2) (1998)
Raimund Seidel
The Nature and Meaning of Perturbations in Geometric Computing. Discret. Comput. Geom. 19 (1) (1998)
Ioannis Z. Emiris, John F. Canny, Raimund Seidel
Efficient Perturbations for Handling Geometric Degeneracies. Algorithmica 19 (1/2) (1997)
David Avis, David Bremner, Raimund Seidel
How Good Are Convex Hull Algorithms?. Comput. Geom. 7 (1997)
Jeff Erickson, Raimund Seidel
Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discret. Comput. Geom. 18 (2) (1997)
Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig
Checking Geometric Programs or Verification of Geometric Structures. SCG (1996)
Raimund Seidel, Cecilia R. Aragon
Randomized Search Trees. Algorithmica 16 (4/5) (1996)
Jeff Erickson, Raimund Seidel
Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discret. Comput. Geom. 13 (1995)
Raimund Seidel
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci. 51 (3) (1995)
Raimund Seidel
The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version. Comput. Geom. 5 (1995)
Raimund Seidel
The Nature and Meaning of Perturbations in Geometric Computing. STACS (1994)
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
Selecting Heavily Covered Points. SIAM J. Comput. 23 (6) (1994)
Jeff Erickson, Raimund Seidel
Better Lower Bounds on Detecting Affine and Spherical Degeneracies FOCS (1993)
Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22 (2) (1993)
Raimund Seidel
Teaching Computational Geometry. CCCG (1993)
Boris Aronov, Raimund Seidel, Diane L. Souvaine
On Compatible Triangulations of Simple Polygons. Comput. Geom. 3 (1993)
Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
Four Results on Randomized Incremental Constructions. Comput. Geom. 3 (1993)
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) (1992)
Jirí Matousek, Raimund Seidel
A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP (1992)
Raimund Seidel
On the All-Pairs-Shortest-Path Problem STOC (1992)
Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
Four Results on Randomized Incremental Constructions. STACS (1992)
Jim Ruppert, Raimund Seidel
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra. Discret. Comput. Geom. 7 (1992)
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 (1991)
Raimund Seidel
A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Comput. Geom. 1 (1991)
Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science (1991)
Raimund Seidel
Small-Dimensional Linear Programming and Convex Hulls Made Easy. Discret. Comput. Geom. 6 (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) (1991)
Raimund Seidel
Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams. Applied Geometry And Discrete Mathematics (1990)
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)
Raimund Seidel
Linear Programming and Convex Hulls Made Easy. SCG (1990)
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
Slimming Down by Adding: Selecting Heavily Covered Points. SCG (1990)
Jirí Matousek, Raimund Seidel, Emo Welzl
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. SCG (1990)
Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4 (1989)
Cecilia R. Aragon, Raimund Seidel
Randomized Search Trees FOCS (1989)
Jim Ruppert, Raimund Seidel
On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. SCG (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. Discret. Comput. Geom. 4 (1989)
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. SCG (1988)
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. Discret. Comput. Geom. 3 (1988)
Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
Implicitly Representing Arrangements of Lines or Segments. SCG (1988)
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)
Ziv Gigus, John F. Canny, Raimund Seidel
Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects. ICCV (1988)
Raimund Seidel
On the Number of Faces in Higher-Dimensional Voronoi Diagrams. SCG (1987)
Leonidas J. Guibas, Raimund Seidel
Computing Convolutions by Reciprocal Search. Discret. Comput. Geom. 2 (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. SCG (1987)
David G. Kirkpatrick, Raimund Seidel
The Ultimate Planar Convex Hull Algorithm? SIAM J. Comput. 15 (1) (1986)
Herbert Edelsbrunner, Raimund Seidel
Voronoi Diagrams and Arrangements. Discret. Comput. Geom. 1 (1986)
Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15 (2) (1986)
Raimund Seidel
Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face STOC (1986)
Leonidas J. Guibas, Raimund Seidel
Computing Convolutions by Reciprocal Search. SCG (1986)
Michael McKenna, Raimund Seidel
Finding the optimal shadows of a convex polytope. SCG (1985)
Herbert Edelsbrunner, Raimund Seidel
Voronoi diagrams and arrangements. SCG (1985)
David G. Kirkpatrick, Raimund Seidel
Output-size sensitive algorithms for finding maximal vectors. SCG (1985)
Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel
Some methods of computational geometry applied to computer graphics. Comput. Vis. Graph. Image Process. 28 (1) (1984)
Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
On the shape of a set of points in the plane. IEEE Trans. Inf. Theory 29 (4) (1983)
Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
Constructing Arrangements of Lines and Hyperplanes with Applications FOCS (1983)
Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
The Shape of a Set of Points in the Plane. WG (1981)
Raimund Seidel
A New Method for Solving Constraint Satisfaction Problems. IJCAI (1981)