Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
Abstract. We describe a data structure for three-dimensional Nef complexes, al-gorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef polyhedra were...
Christoph Burnikel, Stefan Funke, Michael Seel
In 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...
Abstract Certifying and Repairing Solutions to Large LPs (2008)
Marcel Dhiflaoui, Stefan Funke, Kurt Mehlhorn, Michael Seel, Elmar Schömer, ...
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is generally believed that the...
Certifying and Repairing Solutions to Large LPs - How Good are LP-solvers? (2008)
Marcel Dhiflaoui, Carsten Kwappik, Stefan Funke, Kurt Mehlhorn, Michael Seel, ...
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is generally believed that the...
Susan Hert, Michael Hoffmann, Sylvain Pion, Michael Seel
Abstract. Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constantsize geometric objects and...
We implement a generic linear algebra package consisting of a matrix and vector type parameterized by the arithmetic ring type. To make the package easy to be used as part of higher order geometric...
Certifying and Repairing Solutions to Large LPs - How Good are LP-solvers? (2007)
Marcel Dhiflaoui, Carsten Kwappik, Stefan Funke, Kurt Mehlhorn, Michael Seel, ...
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is generally believed that the...
An Adaptable and Extensible Geometry Kernel (2007)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2007)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on...
An adaptable and extensible geometry kernel (2007)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on...
Planar Nef polyhedra and generic higher-dimensional geometry (2004)
We present two generic software projects that are part of the software library CGAL. The first part described the design of a geometry kernel for higher-dimensional Euclidian geometry and the...
Planar Nef polyhedra and generic higher-dimensional geometry (2004)
We present two generic software projects that are part of the software library CGAL. The first part described the design of a geometry kernel for higher-dimensional Euclidian geometry and the...
Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers? (2003)
Dhiflaoui,Marcel, Funke,Stefan, Kwappik,Carsten, Mehlhorn,Kurt, Seel,Michael, Schömer,Elmar, ...
Granados,Miguel, Hachenberger,Peter, Hert,Susan, Kettner,Lutz, Mehlhorn,Kurt, Seel,Michael
We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef polyhedra were introduced by...
Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers? (2003)
Dhiflaoui, Marcel, Funke, Stefan, Kwappik, Carsten, Mehlhorn, Kurt, Seel, Michael, Schömer, Elmar, ...
Granados, Miguel, Hachenberger, Peter, Hert, Susan, Kettner, Lutz, Mehlhorn, Kurt, Seel, Michael, ...
We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef polyhedra were introduced by...
Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel, ...
Project funded by the European Community under the “Information Society Technologies”
Boolean Operations on 3D Selective Nef Complexes (2003)
Data Structure Algorithms, Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
this paper has been partially supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473 (ECG - Effective Computational Geometry for Curves and...
Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef polyhedra were...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
Planar Nef polyhedra and generic higher dimensional geometry / (2001)
Saarbrücken, University, Diss., 2001.
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An adaptable and extensible geometry kernel (2001)
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
ii
An adaptable and extensible geometry kernel (2001)
Susan Hert, Lutz Kettner, Michael Seel
Abstract. Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and...
der Universität des Saarlandes von (2001)
We present two generic software projects that are part of the software library CGAL. The first part describes the design of a geometry kernel for higher-dimensional Euclidean geometry and the...
Exact Geometric Computation Using Cascading (2000)
Christoph Burnikel, Stefan Funke, Michael Seel
In this paper we talk about a new ecient numerical approach to deal with inaccuracy when implementing geometric algorithms. Using various oating-point lters together with arbitrary precision...
Technique For Making, Kurt Mehlhorn, Michael Seel
Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a...
Infimaximal frames: A technique for making lines look like segments (2000)
Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a...
Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a...
Checking geometric programs or verification of geometric structures (1999)
Mehlhorn, Kurt, Näher, Stefan, Seel, Michael, Seidel, Raimund, Schilz, Thomas, Schirra, Stefan, ...
Exact Geometric Predicates using Cascaded Computation (1998)
Christoph Burnikel, Stefan Funke, Michael Seel
In 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...
Convex Hulls in Higher-dimensional Space (1998)
Michael Müller, Joachim Ziegler, Kurt Mehlhorn, Michael Seel
We define and implement the data type chull . It maintains convex hulls in arbitrary dimensions and supports insertions of points and membership queries. The interior of the hull and the boundary of...
Delaunay Triangulations in Higher-dimensional Space (1998)
We define and implement the data type delaunay . It maintains Delaunay triangulations in arbitrary dimensions and supports insertions of points, lookup and location queries. The delaunay...
A computational basis for higher-dimensional computational geometry and applications (1998)
Mehlhorn, Kurt, Müller, Michael, Näher, Stefan, Schirra, Stefan, Seel, Michael, Uhrig, Christian, ...
A Computational Basis for Higher-dimensional Computational Geometry and Applications (1997)
Mehlhorn, Kurt, Müller, Michael, Näher, Stefan, Schirra, Stefan, Seel, Michael, Uhrig, Christian, ...
Checking geometric programs or verification of geometric structures (1996)
Kurt Mehlhorn, Stefan Naher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, ...
A 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 Geometric Programs or Verification of Geometric Structures (1996)
Kurt Mehlhorn Stefan, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, ...
A 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...