Michael Seel

According to our database, Michael Seel authored at least 9 papers between 1996 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

Infimaximal Frames: A Technique for Making Lines Look Like Segments.

Kurt Mehlhorn, Michael Seel

Int. J. Comput. Geom. Appl., 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

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the Algorithms, 2003

2001

Planar Nef polyhedra and generic higher-dimensional geometry.

Michael Seel

PhD thesis, 2001

Exact Geometric Computation Using Cascading.

Christoph Burnikel, Stefan Funke, Michael Seel

Int. J. Comput. Geom. Appl., 2001

An Adaptable and Extensible Geometry Kernel.

Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel

Proceedings of the Algorithm Engineering, 2001

1998

Exact Geometric Predicates Using Cascaded Computation.

Christoph Burnikel, Stefan Funke, Michael Seel

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

A Computational Basis for Higher-Dimensional Computational Geometry and Applications.

Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Checking Geometric Programs or Verification of Geometric Structures.

Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996