Raimund Seidel

According to our database1, Raimund Seidel authored at least 78 papers between 1981 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Extending simple drawings with one edge is hard.
CoRR, 2019

2016
Average curve of n smooth planar curves.
Comput. Aided Des., 2016

2015
Counting triangulations and other crossing-free structures approximately.
Comput. Geom., 2015

2013
Convex hulls of spheres and convex hulls of disjoint convex polytopes.
Comput. Geom., 2013

A simple aggregative algorithm for counting triangulations of planar point sets and related problems.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

Counting Triangulations Approximately.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Determining an Aesthetic Inscribed Curve.
Proceedings of the Computational Aesthetics 2012: Eurographics Workshop on Computational Aesthetics, 2012

2011
Can Nearest Neighbor Searching Be Simple and Always Fast?
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.
Comput. Geom., 2010

Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric.
Comput. Geom., 2010

Data-Specific Analysis of String Sorting.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

10091 Abstracts Collection - Data Structures.
Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010

2009
On the complexity of umbra and penumbra.
Comput. Geom., 2009

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

Maintaining Ideally Distributed Random Search Trees without Extra Space.
Proceedings of the Efficient Algorithms, 2009

2008
Faires Teilen: Eine Weihnachtsstollengeschichte.
Proceedings of the Taschenbuch der Algorithmen, 2008

Algorithm visualization using concrete and abstract shape graphs.
Proceedings of the ACM 2008 Symposium on Software Visualization, 2008

08081 Abstracts Collection - Data Structures.
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.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Between umbra and penumbra.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

On the Number of Cycles in Planar Graphs.
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.
Inf. Process. Lett., 2006

Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily).
Proceedings of the Algorithm Theory, 2006

2005
Top-Down Analysis of Path Compression.
SIAM J. Comput., 2005

Maximizing a Voronoi Region: the Convex Case.
Int. J. Comput. Geom. Appl., 2005

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

Algorithm animation using shape analysis: visualising abstract executions.
Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Developments in Data Structure Research During the First 25 Years of FSTTCS.
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.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Convex Hull Computations.
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.
J. Comb. Theory, Ser. A, 2003

2001
Algorithm Explanation: Visualizing Abstract States and Invariants.
Proceedings of the Software Visualization, 2001

2000
On the Exact Worst Case Query Complexity of Planar Point Location.
J. Algorithms, 2000

1999
Checking geometric programs or verification of geometric structures.
Comput. Geom., 1999

1998
The Nature and Meaning of Perturbations in Geometric Computing.
Discret. Comput. Geom., 1998

Guest Editor's Foreword.
Discret. Comput. Geom., 1998

On the Number of Triangulations of Planar Point Sets.
Comb., 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies.
Discret. Comput. Geom., 1997

How Good Are Convex Hull Algorithms?.
Comput. Geom., 1997

Efficient Perturbations for Handling Geometric Degeneracies.
Algorithmica, 1997

1996
Randomized Search Trees.
Algorithmica, 1996

1995
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs.
J. Comput. Syst. Sci., 1995

Better Lower Bounds on Detecting Affine and Spherical Degeneracies.
Discret. Comput. Geom., 1995

The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version.
Comput. Geom., 1995

1994
Selecting Heavily Covered Points.
SIAM J. Comput., 1994

1993
On the Zone Theorem for Hyperplane Arrangements.
SIAM J. Comput., 1993

Four Results on Randomized Incremental Constructions.
Comput. Geom., 1993

On Compatible Triangulations of Simple Polygons.
Comput. Geom., 1993

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

1992
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci., 1992

On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
Discret. Comput. Geom., 1992

On the All-Pairs-Shortest-Path Problem
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Tail Estimate for Mulmuley's Segment Intersection Algorithm.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

Small-Dimensional Linear Programming and Convex Hulls Made Easy.
Discret. Comput. Geom., 1991

A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons.
Comput. Geom., 1991

Counting and Cutting Cycles of Lines and Rods in Space.
Comput. Geom., 1991

1990
Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Linear Programming and Convex Hulls Made Easy.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Slimming Down by Adding: Selecting Heavily Covered Points.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Implicitly Representing Arrangements of Lines or Segments.
Discret. Comput. Geom., 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discret. Comput. Geom., 1989

On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Computing the Link Center of a Simple Polygon.
Discret. Comput. Geom., 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Computing Convolutions by Reciprocal Search.
Discret. Comput. Geom., 1987

On the Number of Faces in Higher-Dimensional Voronoi Diagrams.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
The Ultimate Planar Convex Hull Algorithm?
SIAM J. Comput., 1986

Constructing Arrangements of Lines and Hyperplanes with Applications.
SIAM J. Comput., 1986

Voronoi Diagrams and Arrangements.
Discret. Comput. Geom., 1986

Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
Finding the optimal shadows of a convex polytope.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

Output-size sensitive algorithms for finding maximal vectors.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Some methods of computational geometry applied to computer graphics.
Comput. Vis. Graph. Image Process., 1984

1983
On the shape of a set of points in the plane.
IEEE Trans. Inf. Theory, 1983

1981
A New Method for Solving Constraint Satisfaction Problems.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981


  Loading...