Ligand Binding to the Pregnane X Receptor by Geometric Matching of Hydrogen Bonds (2009)
Robert-paul Berretty, David Hsu, Lutz Kettner, Ajith Mascarenhas, Matthew R. Redinbo, Jack Snoeyink, ...
Hydrogen bonds are important in protein-ligand interactions. We describe a geometric model of hydrogen bonds, which we use to study ligand binding to the pregnane X receptor (PXR). PXR binds drug...
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...
with the greedy flip algorithm (2008)
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
enumerating pointed pseudo-triangulations
ABSTRACT Complete, Exact, and Efficient Computations with Cubic Curves ∗ (2008)
Arno Eigenwillig, Elmar Schömer, Lutz Kettner, Nicola Wolpert
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We discuss the...
Contour-Edge Based Polyhedron Visualization (2008)
Abstract We present a new approach to computing visibility for threedimensional polyhedral surfaces based on contour edges. The advantages are supported by our extensive experimental study of contour...
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
and enumerating pointed pseudo-triangulations
Le-jeng Shiue, Pierre Alliez, Radu Ursu, Lutz Kettner
This document is a tutorial on how to get started with the polyhedron structure provided by CGAL, the Computational Geometry Algorithm Library. Assuming the reader to be familiar with the C++...
with the greedy flip algorithm (2008)
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
enumerating pseudo-triangulations
Eric Berberich, Elmar Schömer, Michael Hemmer, Nicola Wolpert, Lutz Kettner
We present the first exact, complete and efficient implementation that computes for a given set P = {p1,..., pn} of quadric surfaces the planar map induced by all intersection curves p1 ∩ pi, 2 ≤...
ABSTRACT Complete, Exact, and Efficient Computations with Cubic Curves ∗ (2008)
Arno Eigenwillig, Elmar Schömer, Lutz Kettner, Nicola Wolpert
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We discuss the...
David Blythe, Sherif Ghali, Lutz Kettner, Henry Sowizral
object-oriented oriented graphics APIs that is more fundamental than any one specific API. 1
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
and enumerating pointed pseudo-triangulations
Classroom examples of robustness problems in geometric computations (2008)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause...
Classroom examples of robustness problems in geometric computations (2008)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause...
Classroom Examples of Robustness Problems in Geometric Computations (2008)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee
Lutz Kettner, Stefan Schirra, Remco Veltkamp
We report on the use of the generic programming paradigm in the computational geometry algorithms library cgal. The parameterization of the geometric algorithms in cgal enhances exibility and...
4D Data Visualization Using Iso-surfaces and a Control Plane (2007)
Lutz Kettner, Jarek Rossignac, Jack Snoeyink
ability to efficiently analyze large data sets from a four-dimensional (4d) space-time domain. These
Applications of the Generic Programming Paradigm in the Design of CGAL (2007)
Hervé Brönnimann, Lutz Kettner, Herv Br#nnimann, Stefan Schirra, Remco Veltkamp
We report on the use of the generic programming paradigm in the Computational Geometry Algorithms Library Cgal. The parameterization of the geometric algorithms in Cgal enhances flexibility and...
Omega Psi, Andreas Fabri, Andreas Fabri, Geert-jan Giezeman, Geert-jan Giezeman, Lutz Kettner, ...
Cgal is a Computational Geometry Algorithms Library written in C++, which is developed in an Esprit Ltr project. The goal is to make the large body of geometric algorithms developed in the field of...
Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is ve. In addition, we demonstrate that every point set in general position has a...
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...
Snap rounding of bezier curves (2007)
Arno Eigenwillig, Lutz Kettner, Nicola Wolpert
We present an extension of snap rounding from straight-line segments (see Guibas and Marimont, 1998) to Bézier curves of arbitrary degree, and thus the first method for geometric rounding of...
The Bentley Ottmann sweep line algorithm is a standard tool to compute the arrangement of algebraic curves in the plane. If degenerate positions are not excluded from the input, variants of this...
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...
Snap rounding of Bézier curves (2007)
Eigenwillig, Arno, Kettner, Lutz, Wolpert, Nicola
We present an extension of snap roundingfrom straight-line segments (see Guibas and Marimont, 1998)to Bézier curves of arbitrary degree, and thus the first method for geometric roundingof...
Snap Rounding of Bézier Curves (2006)
Arno Eigenwillig, Lutz Kettner, Nicola Wolpert
We present an extension of snap rounding from straight-line segments (see Guibas and Marimont, 1998) to Bézier curves of arbitrary degree, and thus the first method for geometric rounding of...
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm (2006)
Brönnimann, Hervé, Kettner, Lutz, Pocchiola, Michel, Snoeyink, Jack
This paper studies pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons with more than three...
Reply to "Backward Error Analysis ..." (2006)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee, Gavrilova, Marina, ...
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause implementations...
Reference Counting in Library Design---Optionally and with Union-Find Optimization (2006)
Kettner, Lutz, Musser, David, Siek, Jeremy
Reference counting has been used and described in abundance. We present novel ideas aimed at class implementations in library design: (1) In library design, generic classes can have variable size,...
Exact, Efficient and Complete Arrangement Computation for Cubic Curves (2006)
Eigenwillig, Arno, Kettner, Lutz, Schömer, Elmar, Wolpert, Nicola
The Bentley-Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the...
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm (2006)
Brönnimann, Hervé, Kettner, Lutz, Pocchiola, Michel, Snoeyink, Jack
This paper studies pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons with more than three...
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients (2006)
Mehlhorn, Kurt, Eigenwillig, Arno, Kettner, Lutz, Krandick, Werner, Schmitt, Susanne, Wolpert, Nicola
The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite) bit-streams. In...
Stxxl: standard template library for XXL data sets (2005)
Dementiev, Roman, Kettner, Lutz, Sanders, Peter
We present a software library Stxxl, that enables practice-oriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library STL for external memory...
Eric Berberich, Elmar Schömer, Michael Hemmer, Lutz Kettner, Nicola Wolpert
Ú�ÖØ��×�ÒØ��×�Ö�Ô��Ö�Ø��×�Ò�ÙÐ�Ö�Ò�Ü�ÜØÖ�Ñ�ÔÓ�ÒØ ×...
Exacus: Efficient and exact algorithms for curves and surfaces (2005)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
Abstract. We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness,...
A Descartes algorithm for polynomials with bit-stream coefficients (2005)
Arno Eigenwillig, Lutz Kettner, Werner Kr, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
Abstract. The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite)...
Exacus: Efficient and exact algorithms for curves and surfaces (2005)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
Abstract. We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness,...
A Descartes algorithm for polynomials with bit-stream coefficients (2005)
Arno Eigenwillig, Lutz Kettner, Werner Kr, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
Abstract. The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite)...
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces (2005)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of...
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients (2005)
Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite) bit-streams. In...
STXXL: Standard template library for XXL data sets (2005)
Roman Dementiev, Lutz Kettner, Peter S
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library STL for external...
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
Project funded by the European Community under the “Information Society Technologies” Programme (1998–2002)
STXXL: Standard template library for XXL data sets (2005)
Roman Dementiev, Lutz Kettner, Peter S
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library STL for external...
Reference Counting in Library Design - Optionally and with Union-Find Optimization (2005)
Kettner, Lutz, Lumsdaine, Andrew, Schupp, Sibylle
Reference counting has been used and described in abundance. We present novel ideas aimed at class implementations in library design: (1) In library design, generic classes can have variable size,...
A Descartes algorithm for polynomials with bit-stream coefficients (2005)
Eigenwillig, Arno, Kettner, Lutz, Krandick, Werner, Mehlhorn, Kurt, Schmitt, Susanne, Wolpert, Nicola, ...
STXXL: Standard Template Library for XXL Data Sets (2005)
Dementiev, Roman, Kettner, Lutz, Sanders, Peter, Brodal, Gerth Stølting, Leonardi, Stefano
We present a software library \textsc{Stxxl}, that enables practice-oriented experimentation with huge data sets. \textsc{Stxxl} is an implementation of the C\texttt{++} standard template library STL...
Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm (2005)
Brönnimann, Hervé, Kettner, Lutz, Pocchiola, Michel, Snoeyink, Jack, Demetrescu, Camil, Tamassia, Roberto, ...
This paper studies (pointed, or minimal) pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons...
Berberich, Eric, Hemmer, Michael, Kettner, Lutz, Schömer, Elmar, Wolpert, Nicola, Mitchell, Joe, ...
We present the first exact, complete and efficient implementation that computes for a given set $P=\{p_1,\dots,p_n\}$ of quadric surfaces the planar map induced by all intersection curves $p_1\cap...
EXACUS: Efficient and exact algorithms for curves and surfaces (2005)
Berberich, Eric, Eigenwillig, Arno, Hemmer, Michael, Hert, Susan, Kettner, Lutz, Mehlhorn, Kurt, ...
We present the first open-source release of the C\texttt{++} libraries of the \textsc{Exacus} project of the Max-Planck-Institut f{\"u}r Informatik. Our software computes arrangements of curves and...
Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments (2005)
Hachenberger, Peter, Kettner, Lutz, Kobbelt, Leif, Shapiro, Vadim
Nef polyhedra in $d$-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, mixed-dimensional...
Classroom Examples of Robustness Problems in Geometric Computations (2004)
Kettner,Lutz, Mehlhorn,Kurt, Pion,Sylvain, Schirra,Stefan, Yap,Chee
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations...
Complete, Exact and Efficient Computations with Cubic Curves (2004)
Eigenwillig,Arno, Kettner,Lutz, Schömer,Elmar, Wolpert,Nicola
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We discuss the...
Engineering a Sorted List Data Structure for 32 Bit Key (2004)
Dementiev,Roman, Kettner,Lutz, Mehnert,Jens, Sanders,Peter
Search tree data structures like van Emde Boas trees are a theoretically attractive alternative to comparison based search trees because they have better asymptotic performance for small integer keys...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich,Eric, Eigenwillig,Arno, Emiris,Ioannis, Fogel,Efraim, Hemmer,Michael, Halperin,Dan, ...
EXACUS : Efficient and Exact Algorithms for Curves and Surfaces (2004)
Berberich,Eric, Eigenwillig,Arno, Hemmer,Michael, Hert,Susan, Kettner,Lutz, Mehlhorn,Kurt, ...
Classroom examples of robustness problems in geometric computations (2004)
Kettner,Lutz, Mehlhorn,Kurt, Pion,Sylvain, Schirra,Stefan, Yap,Chee
Classroom Examples of Robustness Problems in Geometric Computations (2004)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee, Albers, Susanne, ...
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations...
Two Computational Geometry Libraries: LEDA and CGAL (2004)
Kettner, Lutz, Näher, Stefan, Goodman, Jacob E., O'Rourke, Joseph
Complete, Exact and Efficient Computations with Cubic Curves (2004)
Eigenwillig, Arno, Kettner, Lutz, Schömer, Elmar, Wolpert, Nicola
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We discuss the...
Engineering a Sorted List Data Structure for 32 Bit Key (2004)
Dementiev, Roman, Kettner, Lutz, Mehnert, Jens, Sanders, Peter, Arge, Lars, Italiano, Giuseppe F., ...
Search tree data structures like van Emde Boas trees are a theoretically attractive alternative to comparison based search trees because they have better asymptotic performance for small integer keys...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich, Eric, Eigenwillig, Arno, Emiris, Ioannis, Fogel, Efraim, Hemmer, Michael, Halperin, Dan, ...
EXACUS : Efficient and Exact Algorithms for Curves and Surfaces (2004)
Berberich, Eric, Eigenwillig, Arno, Hemmer, Michael, Hert, Susan, Kettner, Lutz, Mehlhorn, Kurt, ...
Classroom examples of robustness problems in geometric computations (2004)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee
Classroom Examples of Robustness Problems in Geometric Computations (2004)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations...
Classroom Examples of Robustness Problems in Geometric Computations (2004)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations...
Effects of a modular filter on geometric applications (2004)
M. Hemmer, L. Kettner, E. Schömer, Michael Hemmer, Lutz Kettner, Elmar Schömer
We report on the effects of a filter based on modular arithmetic that has been introduced recently into the EXACUS library. Our experiments with planar arrangements for curves up to degree four show...
Engineering a sorted list data structure for 32 bit key (2004)
Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter S
Search tree data structures like van Emde Boas (vEB) trees are a theoretically attractive alternative to comparison based search trees because they have better asymptotic performance for small...
Classroom Examples of Robustness Problems In Geometric Computations (2004)
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee Yap
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations...
Effects of a modular filter on geometric applications (2004)
M. Hemmer, L. Kettner, E. Schömer, Michael Hemmer, Lutz Kettner, Elmar Schömer
We report on the effects of a filter based on modular arithmetic that has been introduced recently into the EXACUS library. Our experiments with planar arrangements for curves up to degree four show...
Classroom examples of robustness problems in geometric computations (2004)
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee Yap
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause implementations...
Classroom examples of robustness problems in geometric computations (2004)
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee Yap, Inria Sophia
Abstract. The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause...
Classroom examples of robustness problems in geometric computations (2004)
Lutz Kettner, Lutz Kettner, Kurt Mehlhorn, Kurt Mehlhorn, Sylvain Pion, Sylvain Pion, ...
Project funded by the European Community
Engineering a Sorted List Data Structure for 32 Bit Key (2004)
Dementiev, Roman, Kettner, Lutz, Mehnert, Jens, Sanders, Peter, Arge, Lars, Italiano, Giuseppe F., ...
Search tree data structures like van Emde Boas trees are a theoretically attractive alternative to comparison based search trees because they have better asymptotic performance for small integer keys...
Complete, Exact and Efficient Computations with Cubic Curves (2004)
Eigenwillig, Arno, Kettner, Lutz, Schömer, Elmar, Wolpert, Nicola
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We discuss the...
Classroom Examples of Robustness Problems in Geometric Computations (2004)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee, Albers, Susanne, ...
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating point arithmetic for the assumed real arithmetic may cause implementations...
Two Computational Geometry Libraries: LEDA and {CGAL} (2004)
Kettner, Lutz, Näher, Stefan, Goodman, Jacob E., O'Rourke, Joseph
Kettner,Lutz, Rossignac,Jarek, Snoeyink,Jack
We describe a geometric basis for the visualization of time-varying volume data of one or several variables as they occur in scientific and engineering applications. We demonstrate a prototype...
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...
Tight Degree Bounds for Pseudo-triangulations of Points (2003)
Kettner,Lutz, Kirkpatrick,David, Mantler,Andrea, Snoeyink,Jack, Speckmann,Bettina, Takeuchi,Fumihiko
We show that every set of $n$ points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position...
Kettner, Lutz, Rossignac, Jarek, Snoeyink, Jack
We describe a geometric basis for the visualization of time-varying volume data of one or several variables as they occur in scientific and engineering applications. We demonstrate a prototype...
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...
Tight Degree Bounds for Pseudo-triangulations of Points (2003)
Kettner, Lutz, Kirkpatrick, David, Mantler, Andrea, Snoeyink, Jack, Speckmann, Bettina, Takeuchi, Fumihiko
We show that every set of $n$ points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position...
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...
Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operations. In consequence, they can represent non-manifold situations, open and closed sets, mixed-dimensional...
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...
Kettner, Lutz, Rossignac, Jaroslaw R., Snoeyink, Jack
We describe a prototype interface for the visualization of time-varying volume data of one or several variables as they occur in scientific and engineering applications. We partition the data...
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...
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
A prototype system for visualizing timedependent volume data (2001)
This video shows a prototype system for the visualization of time-varying volume data of one or several variables as they occur in scientific and engineering applications. It partitions the data...
Tight degree bounds for pseudo-triangulations of points (2001)
Lutz Kettner, David Kirkpatrick, Bettina Speckmann
We show that every point set in general position has a minimum pseudo-triangulation whose maximum vertex degree is ve. This bound is tight. Furthermore we illustrate that every point set in general...
An adaptable and extensible geometry kernel (2001)
Susan Hert, Michael Hoffmann, Lutz Kettner, Sophia Antipolis France
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...
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...
Tight degree bounds for pseudo-triangulations of points (2001)
Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position has...
Kettner, Lutz, Rossignac, Jaroslaw R., Snoeyink, Jack
We describe a prototype interface for the visualization of time-varying volume data of one or several variables as they occur in scientific and engineering applications. We partition the data...
Thesis (doctoral)--Swiss Federal Institute of Technology Zurich, 1999.
Using generic programming for designing a data structure for polyhedral surfaces (1999)
Software design solutions are presented for combinatorial data structures, such as polyhedral surfaces and planar maps, tailored for program libraries in computational geometry. Design issues...
On the Design of CGAL, the Computational Geometry Algorithms Library (1998)
Fabri, Andreas, Giezeman, Geert-Jan, Kettner, Lutz, Schirra, Stefan, Schönherr, Sven
CGAL is a Computational Geometry Algorithms Library written in C++. The goal is to make the large body of geometric algorithms developed inthe field of computational geometry available for industrial...
On the Design of CGAL, the Computational Geometry Algorithms Library (1998)
Fabri, Andreas, Giezeman, Geert-Jan, Kettner, Lutz, Schirra, Stefan, Schönherr, Sven
CGAL is a Computational Geometry Algorithms Library written in C++. The goal is to make the large body of geometric algorithms developed inthe field of computational geometry available for industrial...
On the Design of CGAL, the Computational Geometry Algorithms Library (1998)
Fabri, Andreas, Giezeman, Geert-Jan, Kettner, Lutz, Schirra, Stefan, Schönherr, Sven
CGAL is a Computational Geometry Algorithms Library written in C++. The goal is to make the large body of geometric algorithms developed inthe field of computational geometry available for industrial...
On the design of CGAL a computational geometry algorithms library (1998)
Andreas Fabri, Geert-jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr
CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms...
One sided error predicates in geometric computing (1998)
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicates, such as...
Designing a Data Structure for Polyhedral Surfaces (1998)
Design solutions for a program library are presented for combinatorial data structures in computational geometry, such as planar maps and polyhedral surfaces. Design issues considered are genericity,...
Applications of the Generic Programming Paradigm in the Design of CGAL (1998)
Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco Veltkamp
We report on the use of the generic programming paradigm in the computational geometry algorithms library cgal. The parameterization of the geometric algorithms in cgal enhances flexibility and...
On the Design of CGAL, the Computational Geometry Algorithms Library (1998)
Andreas Fabri, Andreas Fabri, Geert-jan Giezeman, Geert-jan Giezeman, Lutz Kettner, Lutz Kettner, ...
Cgal is a Computational Geometry Algorithms Library written in C++, which is developed in an Esprit Ltr project. The goal is to make the large body of geometric algorithms developed in the field of...
On the Design of CGAL, the Computational Geometry Algorithms Library (1998)
Geert-jan Giezeman, Lutz Kettner, Sven Schönherr, Unit Inria, Sophia Antipolis, Andreas Fabri, ...
CGAL is a Computational Geometry Algorithms Library written in C++. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for...
Designing a Data Structure for Polyhedral Surfaces (1997)
Design solutions for a program library are presented for combinatorial data structures in computational geometry, such as planar maps and polyhedral surfaces. Design issues considered are genericity,...
Contour Edge Analysis for Polyhedron Projections (1997)
Lutz Kettner, Emo Welzl, R. Klein, R. Rau (eds
. Given a polyhedron (in 3-space) and a view point, an edge of the polyhedron is called contour edge, if one of the two incident facets is directed towards the view point, and the other incident...
Contour Edge Analysis for Polyhedron Projections (1997)
. Given a polyhedron (in 3-space) and a view point, an edge of the polyhedron is called contour edge, if one of the two incident facets is directed towards the view point, and the other incident...
The CGAL kernel: A basis for geometric computation (1996)
Andreas Fabri, Geert-jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schonherr
Only a few of the many algorithms developed over the past two decades in computational geometry found their way into practice. Reasons for this are the dissimilarity
A Classification Scheme of 3D Interaction Techniques (1995)
An enhanced classification scheme is described, capable to provide accurate analysis of 3D interaction techniques. It is based on examples found in the literature and summarized here in a review. The...
Theoretical Foundations of 3D-Metaphors (1994)
Lutz Kettner, Prof Dr, A. Schmitt
Introduction A 3D-metaphor explains the handling of a 3Doperation with a two dimensional input device. It consists of two parts: the metaphorical concept [8] that describes the structural mapping...