Raimund Seidel

108 papers A* 14A 3B 4Misc 1Journal 49Unranked 30

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