Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael Seel
dblp:07/729
· DBLP profile ↗
8ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5Graphics, computer vision, multimedia, augmented reality and games · 3
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
4 papers |
Computational geometry · 62% Mathematical optimization · 34% Algorithms and data structures · 4% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
linear programming |
0.0 | 1 | 2003 | Certifying and repairing solutions to large LPs how good are LP-solvers? · SODA 2003 |
Computational geometry › robust geometric computation
exact geometric computation |
0.0 | 1 | 1998 | Exact Geometric Predicates Using Cascaded Computation · SCG 1998 |
Computational geometry › robust geometric computation
floating-point filter |
0.0 | 1 | 1998 | Exact Geometric Predicates Using Cascaded Computation · SCG 1998 |
Methods — techniques the papers use, named apart from their topics
LP solver · 0.0cascaded computation · 0.0arbitrary precision arithmetic · 0.0computational basis · 0.0program checker · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | An adaptable and extensible geometry kernel
Susan Hert, Michael Hoffmann 0001, Lutz Kettner, Sylvain Pion, Michael Seel |
Comput. Geom. | 5 |
| 2003 | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel |
ESA | 6 |
| 2003 | Certifying and repairing solutions to large LPs how good are LP-solvers?
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber |
SODA | 5 |
| 1999 | Checking geometric programs or verification of geometric structuresabstractA program checker verifies that a particular program execution is correct. We give simple and efficient program checkers for some basic geometric tasks. We report about our experiences with program checking in the context of the LEDA system. We discuss program checking for data structures that have to rely on user-provided functions. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig |
Comput. Geom. | 3 |
| 1998 | Exact Geometric Predicates Using Cascaded ComputationabstractIn this paper we talk about a new efficient numerical approach to deal with inaccuracy when implementing geometric algorithms. Using various floating-point filters together with arbitrary precision packages, we develop an easy-to-use expression compiler called EXPCOMP. EXPCOMP supports all common operations +; \\Gamma; \\Delta; =; p . Applying a new semi-static filter, EXPCOMP combines the speed of static filters with the power of dynamic filters. The filter stages deal with all kinds of floating-point exceptions, including underflow. The resulting programs show a very good runtime behaviour. 1 Introduction When computer scientists design geometric algorithms, they usually assume the availability of exact arithmetic on real numbers. Since no computer directly provides exact arithmetic on real numbers, programmers implementing these algorithms must find some substitution. Quite commonly, they resort to floating-point arithmetic due to its support by hardand software as well as its co... Christoph Burnikel, Stefan Funke, Michael Seel |
SCG | 3 |
| 1998 | A computational basis for higher-dimensional computational geometry and applicationsabstractIn this paper we describe and discuss a kernel for higher-dimensional computational geometry and we present its application in the calculation of convex hulls and delaunay triangulations.We introduce the basic data types like points, vectors, directions, hyperplanes, segments, rays, lines, spheres, affine transformations, and operations connecting these types.The description consists of a motivation for the basic class layout as well as topics like layered software design, runtime correctness via checking routines and documentation issues.Finally we shortly describe the usage of the kernel in the application domain. Kurt Mehlhorn, Michael Müller 0002, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler |
Comput. Geom. | 5 |
| 1997 | A Computational Basis for Higher-Dimensional Computational Geometry and Applications
Kurt Mehlhorn, Michael Müller 0002, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler |
SCG | 5 |
| 1996 | Checking Geometric Programs or Verification of Geometric StructuresabstractA program checker verifies that a particular program execution is correct.We give simple and efficient program checkers for some basic geometric tasks.We report about our experiences with program checking in the context of the LEDA system.We discuss program checking for data structures that have to rely on userprovided functions. Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig |
SCG | 5 |