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...
The Simulation Library: A Basis for Animation Programs Version 2.0 (2007)
This document introduces to the Simulation Library (the SL) through examples, explanation, and exposition. Sections 1.1 and 1.2 provide information about where the library is located and how to...
Deforming Curves in the Plane for Tethered-Robot Motion Planning (Extended Abstract) (2007)
) Susan Hert y Vladimir Lumelsky z Abstract We present an algorithm that deforms a given set of polygonal lines (polylines) defined on a set of 2n vertices into the new set of polylines that results...
Deforming Curves in the Plane for Tethered-Robot Motion Planning (2007)
We present an algorithm that deforms a given set of polygonal lines (polylines) defined on a set of 2n vertices into the new set of polylines that results from one of the vertices moving along a...
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...
Given an arbitrary polygon with n vertices, we wish to partition it into p connected pieces of given areas. The problem is motivated by a robotics application in which the polygon is a workspace that...
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...
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,...
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,...
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...
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)
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...
EXACUS : Efficient and Exact Algorithms for Curves and Surfaces (2004)
Berberich,Eric, Eigenwillig,Arno, Hemmer,Michael, Hert,Susan, Kettner,Lutz, Mehlhorn,Kurt, ...
EXACUS : Efficient and Exact Algorithms for Curves and Surfaces (2004)
Berberich, Eric, Eigenwillig, Arno, Hemmer, Michael, Hert, Susan, Kettner, Lutz, Mehlhorn, Kurt, ...
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...
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...
Multiple Robot Motion Planning = Parallel Processing + Geometry (2002)
We present two problems in multiple-robot motion planning that can be quite naturally solved using techniques from the parallel processing community to dictate how the robots interact with each other...
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons (2002)
Berberich,Eric, Eigenwillig,Arno, Hemmer,Michael, Hert,Susan, Mehlhorn,Kurt, Schömer,Elmar
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately...
Multiple Robot Motion Planning = Parallel Processing + Geometry (2002)
Hert, Susan, Richards, Brad, Christensen, Henrik, Hager, Greg
We present two problems in multiple-robot motion planning that can be quite naturally solved using techniques from the parallel processing community to dictate how the robots interact with each other...
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons (2002)
Berberich, Eric, Eigenwillig, Arno, Hemmer, Michael, Hert, Susan, Mehlhorn, Kurt, Schömer, Elmar, ...
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately...
A computational basis for conic arcs and Boolean operations on conic polygons (2002)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer
Abstract. We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that...
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons (2002)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately...
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)
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, 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...
Motion Planning in R³ for Multiple Tethered Robots (1999)
The problem of motion planning in three dimensions for n tethered robots is considered. Motivation for this problem comes from the need to coordinate the motion of a group of tethered underwater...
Polygon Area Decomposition for Multiple-Robot Workspace Division (1998)
We present a new polygon decomposition problem, the anchored area partition problem, which has applications to a multiple-robot terrain-covering problem. This problem concerns dividing a given...
Planar Curve Routing for Tethered-Robot Motion Planning (1996)
The following problem appears in robotics. A number of small, circular robots live in a common planar workspace. Each is attached by a flexible cable of finite length to a point on the boundary of...
Planar Curve Routing for Tethered-Robot Motion Planning (1996)
The following problem appears in robotics. A number of small, circular robots live in a common planar workspace. Each is attached by a flexible cable of finite length to a point on the boundary of...
A Terrain-Covering Algorithm for an AUV (1996)
Susan Hert, Sanjay Tiwari, Vladimir Lumelsky
An efficient, on-line terrain-covering algorithm is presented for a robot (AUV) moving in an unknown three-dimensional underwater environment. Such an algorithm is necessary for producing mosaicked...
Moving Multiple Tethered Robots between Arbitrary Configurations (1995)
We consider the problem of motion planning for a number of small, disc-like robots in a common planar workspace. Each robot is tethered to a point on the boundary of the worksapce by a flexible cable...