Raimund Seidel

发表

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

Raimund Seidel, R. Seidel, 1995, Comput. Geom..

Four Results on Randomized Incremental Constructions

Kurt Mehlhorn, Kenneth L. Clarkson, Raimund Seidel, 1992, STACS.

Convex hulls of spheres and convex hulls of disjoint convex polytopes

Raimund Seidel, Menelaos I. Karavelas, Eleni Tzanaki, 2013, Comput. Geom..

Computing convolutions by reciprocal search

Leonidas J. Guibas, Raimund Seidel, 1986, SCG '86.

Counting triangulations and other crossing-free structures approximately

Raimund Seidel, Karl Bringmann, Victor Alvarez, 2015, Comput. Geom..

Computing convolutions by reciprocal search

Leonidas J. Guibas, Raimund Seidel, L. Guibas, 1986, SCG '86.

Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects

Raimund Seidel, John F. Canny, Ziv Gigus, 1988, [1988 Proceedings] Second International Conference on Computer Vision.

Linear programming and convex hulls made easy

Raimund Seidel, R. Seidel, 1990, SCG '90.

Maximizing a Voronoi Region: the Convex Case

Raimund Seidel, Rolf Klein, Frank Dehne, 2002, Int. J. Comput. Geom. Appl..

On the shape of a set of points in the plane

David G. Kirkpatrick, Raimund Seidel, Herbert Edelsbrunner, 1983, IEEE Trans. Inf. Theory.

Checking geometric programs or verification of geometric structures

Kurt Mehlhorn, Raimund Seidel, Stefan Schirra, 1996, SCG '96.

Average curve of n smooth planar curves

Brian Wyvill, Raimund Seidel, Jarek Rossignac, 2016, Comput. Aided Des..

Output-size sensitive algorithms for finding maximal vectors

David G. Kirkpatrick, Raimund Seidel, 1985, SCG '85.

Maintaining Ideally Distributed Random Search Trees without Extra Space

Raimund Seidel, R. Seidel, 2009, Efficient Algorithms.

The Nature and Meaning of Perturbations in Geometric Computing

Raimund Seidel, R. Seidel, 1994, STACS.

Slimming down by adding; selecting heavily covered points

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, SCG '90.

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

Hans Raj Tiwary, Raimund Seidel, Saurabh Ray, 2007, WADS.

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, SCG '88.

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

Raimund Seidel, R. Seidel, 1991, Comput. Geom..

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

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, Theor. Comput. Sci..

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

Raimund Seidel, 2006, SWAT.

Top-Down Analysis of Path Compression

Micha Sharir, Raimund Seidel, M. Sharir, 2005, SIAM J. Comput..

On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra

Raimund Seidel, Jim Ruppert, R. Seidel, 1989, SCG '89.

Implicitly representing arrangements of lines or segments

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1989, Discret. Comput. Geom..

On the complexity of umbra and penumbra

Hazel Everett, Sylvain Lazard, Raimund Seidel, 2009, Comput. Geom..

Teaching Computational Geometry, II

Raimund Seidel, 2009, CCCG.

On the Zone Theorem for Hyperplane Arrangements

Micha Sharir, Raimund Seidel, Herbert Edelsbrunner, 1991, New Results and New Trends in Computer Science.

Can Nearest Neighbor Searching Be Simple and Always Fast?

David G. Kirkpatrick, Raimund Seidel, Victor Alvarez, 2011, ESA.

Small-dimensional linear programming and convex hulls made easy

Raimund Seidel, R. Seidel, 1991, Discret. Comput. Geom..

Data-specific analysis of string sorting

Raimund Seidel, R. Seidel, 2010, SODA '10.

On the difficulty of triangulating three-dimensional Nonconvex Polyhedra

Raimund Seidel, Jim Ruppert, R. Seidel, 1992, Discret. Comput. Geom..

Voronoi diagrams and arrangements

Raimund Seidel, Herbert Edelsbrunner, H. Edelsbrunner, 1985, SCG '85.

How to net a lot with little: small ε-nets for disks and halfspaces

Jirí Matousek, Raimund Seidel, Emo Welzl, 1990, SCG '90.

Data Structures and Algorithms (Summer 2008) Contents

Raimund Seidel, Kurt Mehlhorn, K. Mehlhorn, 2008 .

Checking geometric programs or verification of geometric structures

Kurt Mehlhorn, Raimund Seidel, Stefan Schirra, 1999, Comput. Geom..

Constructing higher-dimensional convex hulls at logarithmic cost per face

Raimund Seidel, R. Seidel, 1986, STOC '86.

Randomized search trees

Cecilia R. Aragon, Raimund Seidel, 2005, Algorithmica.

Between umbra and penumbra

Hazel Everett, Sylvain Lazard, Raimund Seidel, 2007, SCG '07.

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1989, Discret. Comput. Geom..

On the Zone Theorem for Hyperplane Arrangements

Micha Sharir, Raimund Seidel, Herbert Edelsbrunner, 1991, SIAM J. Comput..

Note – On the Number of Triangulations of Planar Point Sets

Raimund Seidel, 1998, Comb..

On the Number of Cycles in Planar Graphs

Raimund Seidel, Kevin Buchin, Christian Knauer, 2007, COCOON.

Extending simple drawings with one edge is hard pdf

Irene Parada, Raimund Seidel, Fabian Klute, 2019, ArXiv.

Algorithm visualization using concrete and abstract shape graphs

Raimund Seidel, Reinhard Wilhelm, Sascha A. Parduhn, 2008, SoftVis '08.

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

Raimund Seidel, Francisco Santos, 2003, J. Comb. Theory, Ser. A.

1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA

Raimund Seidel, R. Seidel, 2018, SOSA.

Constructing Arrangements of Lines and Hyperplanes with Applications

Raimund Seidel, Herbert Edelsbrunner, Joseph O'Rourke, 1986, SIAM J. Comput..

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

Khaled M. Elbassioni, Raimund Seidel, Zvi Lotker, 2005, Inf. Process. Lett..

Voronoi diagrams and arrangements

Raimund Seidel, Herbert Edelsbrunner, 1986, Discret. Comput. Geom..

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

Raimund Seidel, Victor Alvarez, 2013, SoCG '13.

Teaching Computational Geometry

Raimund Seidel, 1993, CCCG.

On Compatible Triangulations of Simple Polygons

Boris Aronov, Raimund Seidel, Diane L. Souvaine, 1993, Comput. Geom..

Selecting Heavily Covered Points

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1994, SIAM J. Comput..

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

Raimund Seidel, 2010, Comput. Geom..

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

Raimund Seidel, Victor Alvarez, 2010, Comput. Geom..

On the number of faces in higher-dimensional Voronoi diagrams

Raimund Seidel, R. Seidel, 1987, SCG '87.

Determining an aesthetic inscribed curve

Brian Wyvill, Raimund Seidel, Paul G. Kry, 2012, CAe '12.

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

Raimund Seidel, R. Seidel, 1990, Applied Geometry And Discrete Mathematics.

On the exact worst case query complexity of planar point location

Raimund Seidel, Udo Adamy, R. Seidel, 2000, SODA '98.

Maximizing a Voronoi Region: The Convex Case

Raimund Seidel, Rolf Klein, Frank Dehne, 2002, ISAAC.

Convex Hull Computations

Raimund Seidel, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

Raimund Seidel, R. Seidel, 2005, FSTTCS.

Efficient Perturbations for Handling Geometric Degeneracies

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

Algorithm Explanation: Visualizing Abstract States and Invariants

Raimund Seidel, Reinhard Wilhelm, Tomasz Müldner, 2001, Software Visualization.

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

Raimund Seidel, R. Seidel, 1995, J. Comput. Syst. Sci..

Randomized search trees

Cecilia R. Aragon, Raimund Seidel, R. Seidel, 1989, 30th Annual Symposium on Foundations of Computer Science.

Computing the link center of a simple polygon

Micha Sharir, Subhash Suri, Godfried T. Toussaint, 1987, SCG '87.

A New Method for Solving Constraint Satisfaction Problems

Raimund Seidel, R. Seidel, 1981, IJCAI.

Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies

Raimund Seidel, Jeff Erickson, R. Seidel, 1993, Discret. Comput. Geom..

Better lower bounds on detecting affine and spherical degeneracies

Raimund Seidel, Jeff Erickson, 1995, Discret. Comput. Geom..

On the exact computation of the topology of real algebraic curves

Raimund Seidel, Nicola Wolpert, Nicola Wolpert, 2005, SCG.

The Ultimate Planar Convex Hull Algorithm?

David G. Kirkpatrick, Raimund Seidel, R. Seidel, 1986, SIAM J. Comput..

Implicitly representing arrangements of lines or segments

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2011, SCG '88.

Guest Editor's Foreword

Raimund Seidel, 1998, Discret. Comput. Geom..

On the all-pairs-shortest-path problem

Raimund Seidel, R. Seidel, 1992, STOC '92.

Some methods of computational geometry applied to computer graphics

Raimund Seidel, Mark H. Overmars, Herbert Edelsbrunner, 1984, Comput. Vis. Graph. Image Process..

Counting Triangulations Approximately

Raimund Seidel, Karl Bringmann, Saurabh Ray, 2013, CCCG.

Counting and cutting cycles of lines and rods in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Finding the optimal shadows of a convex polytope

Raimund Seidel, Michael McKenna, 1985, SCG '85.

Algorithm animation using shape analysis: visualising abstract executions

Raimund Seidel, Reinhard Wilhelm, Dierk Johannes, 2005, SoftVis '05.

Constructing arrangements of lines and hyperplanes with applications

Raimund Seidel, Herbert Edelsbrunner, Joseph O'Rourke, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

The Nature and Meaning of Perturbations in Geometric Computing

Raimund Seidel, 1998, Discret. Comput. Geom..

Counting and cutting cycles of lines and rods in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

A Tail Estimate for Mulmuley's Segment Intersection Algorithm

Jirí Matousek, Raimund Seidel, 1992, ICALP.

Book List for Algorithms and Data Structures Summer 2008

Kurt Mehlhorn, Raimund Seidel, K. Mehlhorn, 2008 .

Four Results on Randomized Incremental Constructions

Kurt Mehlhorn, Kenneth L. Clarkson, Raimund Seidel, 1992, Comput. Geom..

Convex hull computations

Raimund Seidel, 1997 .

Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990

Raimund Seidel, 1990, Symposium on Computational Geometry.

Faires Teilen: Eine Weihnachtsstollengeschichte

Raimund Seidel, 2008, Taschenbuch der Algorithmen.

Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects

Raimund Seidel, John F. Canny, Ziv Gigus, 1991, IEEE Trans. Pattern Anal. Mach. Intell..

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

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1988, ICALP.

Computing the link center of a simple polygon

Micha Sharir, Godfried T. Toussaint, Raimund Seidel, 2011, SCG '87.

How Good Are Convex Hull Algorithms?

Raimund Seidel, David Avis, David Bremner, 1997, Comput. Geom..

Circles through two points that always enclose many points

Raimund Seidel, Herbert Edelsbrunner, H. Edelsbrunner, 1989 .

Proofs with potential

Raimund Seidel, Edward Franklin Grove, 1993 .

Results on -Sets and -Facets via Continuous Motion

Boris Aronov, Raimund Seidel, Sariel Har-Peled, 1997 .

On the Complexity of Achieving K-Consistency

Raimund Seidel, 1983 .

Understanding the Inverse Ackermann Function

Raimund Seidel, 2006 .

Cache-Oblivious Dynamic Dictionaries with Optimal Update / Query Tradeo

Raimund Seidel, Lars Arge, Erik Demaine, 2010 .

A simple and less slow method for counting triangulations and for related problems

Raimund Seidel, Saurabh Ray, 2004 .

New lower bounds for the number of straight-edge triangulations of a planar point set

Raimund Seidel, Paul McCabe, 2004 .