Raimund Seidel

According to our database, Raimund Seidel authored at least 82 papers between 1981 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Inserting One Edge into a Simple Drawing is Hard.

Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera

Discret. Comput. Geom., April, 2023

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.

Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek

CoRR, 2023

The Influence of Dimensions on the Complexity of Computing Decision Trees.

Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2019

Extending simple drawings with one edge is hard.

Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera

CoRR, 2019

2016

Average curve of n smooth planar curves.

Mukul Sati, Jarek Rossignac, Raimund Seidel, Brian Wyvill, Suraj Musuvathy

Comput. Aided Des., 2016

2015

Counting triangulations and other crossing-free structures approximately.

Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel

Comput. Geom., 2015

2013

Convex hulls of spheres and convex hulls of disjoint convex polytopes.

Menelaos I. Karavelas, Raimund Seidel, Eleni Tzanaki

Comput. Geom., 2013

A simple aggregative algorithm for counting triangulations of planar point sets and related problems.

Victor Alvarez, Raimund Seidel

Proceedings of the Symposium on Computational Geometry 2013, 2013

Counting Triangulations Approximately.

Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Determining an Aesthetic Inscribed Curve.

Brian Wyvill, Paul G. Kry, Raimund Seidel, David Mould

Proceedings of the 8th International Symposium on Computational Aesthetics in Graphics, 2012

2011

Can Nearest Neighbor Searching Be Simple and Always Fast?

Victor Alvarez, David G. Kirkpatrick, Raimund Seidel

Proceedings of the Algorithms - ESA 2011, 2011

2010

Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons.

Raimund Seidel

Comput. Geom., 2010

Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric.

Victor Alvarez, Raimund Seidel

Comput. Geom., 2010

Data-Specific Analysis of String Sorting.

Raimund Seidel

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

10091 Abstracts Collection - Data Structures.

Lars Arge, Erik D. Demaine, Raimund Seidel

Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010

2009

On the complexity of umbra and penumbra.

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel

Comput. Geom., 2009

Teaching Computational Geometry, II.

Raimund Seidel

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Maintaining Ideally Distributed Random Search Trees without Extra Space.

Raimund Seidel

Proceedings of the Efficient Algorithms, 2009

2008

Faires Teilen: Eine Weihnachtsstollengeschichte.

Raimund Seidel

Proceedings of the Taschenbuch der Algorithmen, 2008

Algorithm visualization using concrete and abstract shape graphs.

Sascha A. Parduhn, Raimund Seidel, Reinhard Wilhelm

Proceedings of the ACM 2008 Symposium on Software Visualization, 2008

08081 Abstracts Collection - Data Structures.

Lars Arge, Robert Sedgewick, Raimund Seidel

Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

2007

On Computing the Centroid of the Vertices of an Arrangement and Related Problems.

Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Between umbra and penumbra.

Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

On the Number of Cycles in Planar Graphs.

Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices.

Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel

Inf. Process. Lett., 2006

Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily).

Raimund Seidel

Proceedings of the Algorithm Theory, 2006

2005

Top-Down Analysis of Path Compression.

Raimund Seidel, Micha Sharir

SIAM J. Comput., 2005

Maximizing a Voronoi Region: the Convex Case.

Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel

Int. J. Comput. Geom. Appl., 2005

Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices

Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel

CoRR, 2005

Algorithm animation using shape analysis: visualising abstract executions.

Dierk Johannes, Raimund Seidel, Reinhard Wilhelm

Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Developments in Data Structure Research During the First 25 Years of FSTTCS.

Raimund Seidel

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

On the exact computation of the topology of real algebraic curves.

Raimund Seidel, Nicola Wolpert

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Convex Hull Computations.

Raimund Seidel

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003

A better upper bound on the number of triangulations of a planar point set.

Francisco Santos, Raimund Seidel

J. Comb. Theory, Ser. A, 2003

2001

Algorithm Explanation: Visualizing Abstract States and Invariants.

Reinhard Wilhelm, Tomasz Müldner, Raimund Seidel

Proceedings of the Software Visualization, 2001

2000

On the Exact Worst Case Query Complexity of Planar Point Location.

Raimund Seidel, Udo Adamy

J. Algorithms, 2000

1999

Checking geometric programs or verification of geometric structures.

Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig

Comput. Geom., 1999

1998

The Nature and Meaning of Perturbations in Geometric Computing.

Raimund Seidel

Discret. Comput. Geom., 1998

Guest Editor's Foreword.

Raimund Seidel

Discret. Comput. Geom., 1998

On the Number of Triangulations of Planar Point Sets.

Raimund Seidel

Comb., 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.

Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies.

Jeff Erickson, Raimund Seidel

Discret. Comput. Geom., 1997

How Good Are Convex Hull Algorithms?.

David Avis, David Bremner, Raimund Seidel

Comput. Geom., 1997

Efficient Perturbations for Handling Geometric Degeneracies.

Ioannis Z. Emiris, John F. Canny, Raimund Seidel

Algorithmica, 1997

1996

Randomized Search Trees.

Raimund Seidel, Cecilia R. Aragon

Algorithmica, 1996

1995

On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs.

Raimund Seidel

J. Comput. Syst. Sci., 1995

Better Lower Bounds on Detecting Affine and Spherical Degeneracies.

Jeff Erickson, Raimund Seidel

Discret. Comput. Geom., 1995

The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version.

Raimund Seidel

Comput. Geom., 1995

1994

Selecting Heavily Covered Points.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir

SIAM J. Comput., 1994

1993

On the Zone Theorem for Hyperplane Arrangements.

Herbert Edelsbrunner, Raimund Seidel, Micha Sharir

SIAM J. Comput., 1993

Four Results on Randomized Incremental Constructions.

Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel

Comput. Geom., 1993

On Compatible Triangulations of Simple Polygons.

Boris Aronov, Raimund Seidel, Diane L. Souvaine

Comput. Geom., 1993

Teaching Computational Geometry.

Raimund Seidel

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.

Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir

Theor. Comput. Sci., 1992

On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.

Jim Ruppert, Raimund Seidel

Discret. Comput. Geom., 1992

On the All-Pairs-Shortest-Path Problem

Raimund Seidel

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Tail Estimate for Mulmuley's Segment Intersection Algorithm.

Jirí Matousek, Raimund Seidel

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects.

Ziv Gigus, John F. Canny, Raimund Seidel

IEEE Trans. Pattern Anal. Mach. Intell., 1991

Small-Dimensional Linear Programming and Convex Hulls Made Easy.

Raimund Seidel

Discret. Comput. Geom., 1991

A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons.

Raimund Seidel

Comput. Geom., 1991

Counting and Cutting Cycles of Lines and Rods in Space.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Comput. Geom., 1991

1990

Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams.

Raimund Seidel

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Linear Programming and Convex Hulls Made Easy.

Raimund Seidel

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.

Jirí Matousek, Raimund Seidel, Emo Welzl

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Slimming Down by Adding: Selecting Heavily Covered Points.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Implicitly Representing Arrangements of Lines or Segments.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl

Discret. Comput. Geom., 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Discret. Comput. Geom., 1989

On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra.

Jim Ruppert, Raimund Seidel

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Computing the Link Center of a Simple Polygon.

William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap

Discret. Comput. Geom., 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Output-Size Sensitive Algorithms For Constructive Problems In Computational Geometry.

Raimund Seidel

PhD thesis, 1987

Computing Convolutions by Reciprocal Search.

Leonidas J. Guibas, Raimund Seidel

Discret. Comput. Geom., 1987

On the Number of Faces in Higher-Dimensional Voronoi Diagrams.

Raimund Seidel

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

The Ultimate Planar Convex Hull Algorithm?

David G. Kirkpatrick, Raimund Seidel

SIAM J. Comput., 1986

Constructing Arrangements of Lines and Hyperplanes with Applications.

Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel

SIAM J. Comput., 1986

Voronoi Diagrams and Arrangements.

Herbert Edelsbrunner, Raimund Seidel

Discret. Comput. Geom., 1986

Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face

Raimund Seidel

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Finding the optimal shadows of a convex polytope.

Michael McKenna, Raimund Seidel

Proceedings of the First Annual Symposium on Computational Geometry, 1985

Output-size sensitive algorithms for finding maximal vectors.

David G. Kirkpatrick, Raimund Seidel

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Some methods of computational geometry applied to computer graphics.

Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel

Comput. Vis. Graph. Image Process., 1984

1983

On the shape of a set of points in the plane.

Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel

IEEE Trans. Inf. Theory, 1983

1981

A New Method for Solving Constraint Satisfaction Problems.

Raimund Seidel

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981