default search action
Raimund Seidel
Person information
- affiliation: Saarland University, Computer Science Department, Saarbrücken, Germany
- affiliation: Schloss Dagstuhl - Leibniz Center for Informatics, Wadern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j42]Alan Arroyo
, Fabian Klute
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69(3): 745-770 (2023) - [c50]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: 8343-8350 - [i7]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 abs/2312.01935 (2023) - 2022
- [i6]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 abs/2205.07756 (2022) - 2020
- [c49]Alan Arroyo
Inserting One Edge into a Simple Drawing Is Hard. WG 2020: 325-338
2010 – 2019
- 2019
- [i5]Alan Arroyo, Fabian Klute
Extending simple drawings with one edge is hard. CoRR abs/1909.07347 (2019) - 2018
- [e4]Raimund Seidel:
1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA. OASIcs 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-064-4 [contents] - 2016
- [j41]Mukul Sati, Jarek Rossignac, Raimund Seidel, Brian Wyvill, Suraj Musuvathy:
Average curve of n smooth planar curves. Comput. Aided Des. 70: 46-55 (2016) - 2015
- [j40]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5): 386-397 (2015) - 2014
- [i4]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations and other Crossing-Free Structures Approximately. CoRR abs/1404.0261 (2014) - 2013
- [j39]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) - [c48]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations Approximately. CCCG 2013 - [c47]Victor Alvarez, Raimund Seidel:
A simple aggregative algorithm for counting triangulations of planar point sets and related problems. SoCG 2013: 1-8 - 2012
- [c46]Brian Wyvill, Paul G. Kry, Raimund Seidel, David Mould:
Determining an Aesthetic Inscribed Curve. CAe@Expressive 2012: 63-70 - 2011
- [c45]Victor Alvarez, David G. Kirkpatrick, Raimund Seidel:
Can Nearest Neighbor Searching Be Simple and Always Fast? ESA 2011: 82-92 - 2010
- [j38]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) - [j37]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) - [c44]Raimund Seidel:
Data-Specific Analysis of String Sorting. SODA 2010: 1278-1286 - [e3]Lars Arge, Erik D. Demaine, Raimund Seidel:
Data Structures, 28.02. - 05.03.2010. Dagstuhl Seminar Proceedings 10091, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i3]Lars Arge, Erik D. Demaine, Raimund Seidel:
10091 Abstracts Collection - Data Structures. Data Structures 2010
2000 – 2009
- 2009
- [j36]Julien Demouth, Olivier Devillers
On the complexity of umbra and penumbra. Comput. Geom. 42(8): 758-771 (2009) - [c43]Raimund Seidel:
Maintaining Ideally Distributed Random Search Trees without Extra Space. Efficient Algorithms 2009: 134-142 - [c42]Raimund Seidel:
Teaching Computational Geometry, II. CCCG 2009: 173 - 2008
- [c41]Sascha A. Parduhn, Raimund Seidel, Reinhard Wilhelm:
Algorithm visualization using concrete and abstract shape graphs. SOFTVIS 2008: 33-36 - [p1]Raimund Seidel:
Faires Teilen: Eine Weihnachtsstollengeschichte. Taschenbuch der Algorithmen 2008: 331-340 - [e2]Lars Arge, Robert Sedgewick, Raimund Seidel:
Data Structures, 17.02. - 22.02.2008. Dagstuhl Seminar Proceedings 08081, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i2]Lars Arge, Robert Sedgewick, Raimund Seidel:
08081 Abstracts Collection - Data Structures. Data Structures 2008 - 2007
- [c40]Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel:
On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107 - [c39]Julien Demouth, Olivier Devillers
Between umbra and penumbra. SCG 2007: 265-274 - [c38]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 - 2006
- [j35]Khaled M. Elbassioni
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. Inf. Process. Lett. 100(2): 69-71 (2006) - [c37]Raimund Seidel:
Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). SWAT 2006: 1 - 2005
- [j34]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geom. Appl. 15(5): 463-476 (2005) - [j33]Raimund Seidel, Micha Sharir:
Top-Down Analysis of Path Compression. SIAM J. Comput. 34(3): 515-525 (2005) - [c36]Raimund Seidel, Nicola Wolpert:
On the exact computation of the topology of real algebraic curves. SCG 2005: 107-115 - [c35]Raimund Seidel:
Developments in Data Structure Research During the First 25 Years of FSTTCS. FSTTCS 2005: 48-59 - [c34]Dierk Johannes, Raimund Seidel, Reinhard Wilhelm:
Algorithm animation using shape analysis: visualising abstract executions. SOFTVIS 2005: 17-26 - [i1]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) - 2004
- [r1]Raimund Seidel:
Convex Hull Computations. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 495-512 - 2003
- [j32]Francisco Santos
A better upper bound on the number of triangulations of a planar point set. J. Comb. Theory A 102(1): 186-193 (2003) - 2002
- [c33]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: The Convex Case. ISAAC 2002: 624-634 - 2001
- [c32]Reinhard Wilhelm, Tomasz Müldner, Raimund Seidel:
Algorithm Explanation: Visualizing Abstract States and Invariants. Software Visualization 2001: 381-394 - 2000
- [j31]Raimund Seidel, Udo Adamy:
On the Exact Worst Case Query Complexity of Planar Point Location. J. Algorithms 37(1): 189-217 (2000)
1990 – 1999
- 1999
- [j30]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) - 1998
- [j29]Raimund Seidel:
On the Number of Triangulations of Planar Point Sets. Comb. 18(2): 297-299 (1998) - [j28]Raimund Seidel:
The Nature and Meaning of Perturbations in Geometric Computing. Discret. Comput. Geom. 19(1): 1-17 (1998) - [j27]Raimund Seidel:
Guest Editor's Foreword. Discret. Comput. Geom. 20(3): 285 (1998) - [c31]Artur Andrzejak, Boris Aronov, Sariel Har-Peled
Results on k-Sets and j-Facets via Continuous Motion. SCG 1998: 192-199 - [c30]Udo Adamy, Raimund Seidel:
On the Exact Worst Case Query Complexity of Planar Point Location. SODA 1998: 609-618 - 1997
- [j26]Ioannis Z. Emiris, John F. Canny, Raimund Seidel:
Efficient Perturbations for Handling Geometric Degeneracies. Algorithmica 19(1/2): 219-242 (1997) - [j25]David Avis, David Bremner, Raimund Seidel:
How Good Are Convex Hull Algorithms?. Comput. Geom. 7: 265-301 (1997) - [j24]Jeff Erickson, Raimund Seidel:
Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discret. Comput. Geom. 18(2): 239-240 (1997) - 1996
- [j23]Raimund Seidel, Cecilia R. Aragon:
Randomized Search Trees. Algorithmica 16(4/5): 464-497 (1996) - [c29]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: 159-165 - 1995
- [j22]Raimund Seidel:
The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version. Comput. Geom. 5: 115-116 (1995) - [j21]Jeff Erickson, Raimund Seidel:
Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discret. Comput. Geom. 13: 41-57 (1995) - [j20]Raimund Seidel:
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci. 51(3): 400-403 (1995) - 1994
- [j19]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) - [c28]Raimund Seidel:
The Nature and Meaning of Perturbations in Geometric Computing. STACS 1994: 3-17 - 1993
- [j18]Boris Aronov
On Compatible Triangulations of Simple Polygons. Comput. Geom. 3: 27-35 (1993) - [j17]Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993) - [j16]Herbert Edelsbrunner, Raimund Seidel, Micha Sharir:
On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993) - [c27]Raimund Seidel:
Teaching Computational Geometry. CCCG 1993: 272-272 - [c26]Jeff Erickson, Raimund Seidel:
Better Lower Bounds on Detecting Affine and Spherical Degeneracies. FOCS 1993: 528-536 - 1992
- [j15]Jim Ruppert, Raimund Seidel:
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra. Discret. Comput. Geom. 7: 227-253 (1992) - [j14]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) - [c25]Jirí Matousek, Raimund Seidel:
A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP 1992: 427-438 - [c24]Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. STACS 1992: 463-474 - [c23]Raimund Seidel:
On the All-Pairs-Shortest-Path Problem. STOC 1992: 745-749 - 1991
- [j13]Raimund Seidel:
A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Comput. Geom. 1: 51-64 (1991) - [j12]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) - [j11]Raimund Seidel:
Small-Dimensional Linear Programming and Convex Hulls Made Easy. Discret. Comput. Geom. 6: 423-434 (1991) - [j10]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) - [c22]Herbert Edelsbrunner, Raimund Seidel, Micha Sharir:
On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science 1991: 108-123 - 1990
- [c21]Jirí Matousek, Raimund Seidel, Emo Welzl:
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. SCG 1990: 16-22 - [c20]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir:
Slimming Down by Adding: Selecting Heavily Covered Points. SCG 1990: 116-127 - [c19]Raimund Seidel:
Linear Programming and Convex Hulls Made Easy. SCG 1990: 211-215 - [c18]Raimund Seidel:
Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams. Applied Geometry And Discrete Mathematics 1990: 517-530 - [c17]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 - [e1]Raimund Seidel:
Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990. ACM 1990, ISBN 0-89791-362-0 [contents]
1980 – 1989
- 1989
- [j9]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4: 433-466 (1989) - [j8]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: 523-539 (1989) - [c16]Jim Ruppert, Raimund Seidel:
On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. SCG 1989: 380-392 - [c15]Cecilia R. Aragon, Raimund Seidel:
Randomized Search Trees. FOCS 1989: 540-545 - 1988
- [j7]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - [c14]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - [c13]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: 258-265 - [c12]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 - [c11]Ziv Gigus, John F. Canny, Raimund Seidel:
Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects. ICCV 1988: 30-39 - 1987
- [b1]Raimund Seidel:
Output-Size Sensitive Algorithms For Constructive Problems In Computational Geometry. Cornell University, USA, 1987 - [j6]Leonidas J. Guibas, Raimund Seidel:
Computing Convolutions by Reciprocal Search. Discret. Comput. Geom. 2: 175-193 (1987) - [c10]William J. 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: 1-10 - [c9]Raimund Seidel:
On the Number of Faces in Higher-Dimensional Voronoi Diagrams. SCG 1987: 181-185 - 1986
- [j5]Herbert Edelsbrunner, Raimund Seidel:
Voronoi Diagrams and Arrangements. Discret. Comput. Geom. 1: 25-44 (1986) - [j4]David G. Kirkpatrick, Raimund Seidel:
The Ultimate Planar Convex Hull Algorithm? SIAM J. Comput. 15(1): 287-299 (1986) - [j3]Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15(2): 341-363 (1986) - [c8]Leonidas J. Guibas, Raimund Seidel:
Computing Convolutions by Reciprocal Search. SCG 1986: 90-99 - [c7]Raimund Seidel:
Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face. STOC 1986: 404-413 - 1985
- [c6]Michael McKenna, Raimund Seidel:
Finding the optimal shadows of a convex polytope. SCG 1985: 24-28 - [c5]David G. Kirkpatrick, Raimund Seidel:
Output-size sensitive algorithms for finding maximal vectors. SCG 1985: 89-96 - [c4]Herbert Edelsbrunner, Raimund Seidel:
Voronoi diagrams and arrangements. SCG 1985: 251-262 - 1984
- [j2]Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel:
Some methods of computational geometry applied to computer graphics. Comput. Vis. Graph. Image Process. 28(1): 92-108 (1984) - 1983
- [j1]Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel:
On the shape of a set of points in the plane. IEEE Trans. Inf. Theory 29(4): 551-558 (1983) - [c3]Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. FOCS 1983: 83-91 - 1981
- [c2]Raimund Seidel:
A New Method for Solving Constraint Satisfaction Problems. IJCAI 1981: 338-342 - [c1]Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel:
The Shape of a Set of Points in the Plane. WG 1981: 157-162
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: