Fabian Schwarzer

General Terms (2008)

Itay Lotan, Fabian Schwarzer, Jean-claude Latombe, Dan Halperin

The kinematic chain is a ubiquitous and extensively studied representation in robotics as well as a useful model for studying the motion of biological macro-molecules. Both fields stand to benefit...

Downloaded from (2008)

Fabian Schwarzer, Achim Schweikard, Leo Joskowicz, Fabian Schwarzer, Achim Schweikard, ...

Citations (this article cites 7 articles hosted on the

to appear: Artificial Intelligence Detecting Geometric Infeasibility (2008)

Achim Schweikard, Fabian Schwarzer

Abstract: The problem of deciding whether one or more objects can be removed from a set of other planar or spatial objects arises in assembly planning, computer-aided design, robotics and...

1-- the RoboCup (2007)

Michael Klupsch, Thorsten B, Marc Grimme, Ignaz Kellerer, Maximilian Luckenhaus, Fabian Schwarzer, ...

. With a team of five Pioneer 1 robots, equipped with a CCD camera and single board computer each and coached by a master PC outside the field we intend to take part in the medium size RoboCup league...

E#cient Maintenance and Self-Collision Testing for Kinematic Chains (2007)

Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-claude Latombe

The kinematic chain is a ubiquitous and extensively studied representation in robotics as well as a useful model for studying the motion of biological macro-molecules. Both fields stand to benefit...

2 (2007)

Fabian Schwarzer, Florian Bieberbach, Achim Schweikard, Leo Joskowicz

We address the problem of efficiently determining if the intersection of a given set of d-dimensional halfspaces is unbounded. It is shown that detecting unboundedness can be reduced to a single...

Geometric Reasoning About Translational Motions (2007)

Schwarzer, Fabian

This thesis addresses the problems of planning highly coordinated collision-free translational motions of multiple objects (general polygons or polyhedra) and finding sequences of translations that...

Adaptive dynamic collision checking for single and multiple articulated robots in complex environments (2005)

Fabian Schwarzer, Mitul Saha, Jean-claude Latombe

Abstract — Static collision checking amounts to testing a given configuration of objects for overlaps. In contrast, the goal of dynamic checking is to determine whether all configurations along a...

References (2005)

Jeff M. Phillips, Fabian Schwarzer, Mitul Saha

A common subroutine in robotics, especially path planning, is to check for collisions between the robot and obstacles along a planned route of the robot. In fact, this is often the bottleneck in most...

Algorithm and data structures for efficient energy maintenance during Monte Carlo simulation of proteins (2004)

Itay Lotan, Fabian Schwarzer

Monte Carlo simulation (MCS) is a common methodology to compute pathways and thermodynamic prop-erties of proteins. A simulation run is a series of random steps in conformation space, each perturbing...

Algorithm and data structures for efficient energy maintenance during Monte Carlo simulation of proteins (2004)

Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-claude Latombe

Monte Carlo simulation (MCS) is a common methodology to compute pathways and thermodynamic properties of proteins. A simulation run is a series of random steps in conformation space, each perturbing...

Algorithm and Data Structures for Ecient Energy Maintenance during (2004)

Monte Carlo Simulation, Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-claude Latombe

Monte Carlo simulation (MCS) is a common methodology to compute pathways and thermodynamic properties of proteins. A simulation run is a series of random steps in conformation space, each perturbing...

Efficient Energy Computation for Monte Carlo Simulation (2003)

Itay Lotan, Fabian Schwarzer, Jean-claude Latombe

Abstract. Monte Carlo simulation (MCS) is a common methodology to compute pathways and thermodynamic properties of proteins. A simulation run is a series of random steps in conformation space, each...

Approximation of protein structure for fast similarity measures (2003)

Fabian Schwarzer

It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full Cα representation contains redundant...

Tolerance Envelopes of Parametric Planar Part Models (2003)

Yaron Ostrovsky-berman, Leo Joskowicz, Fabian Schwarzer

We present a framework for modeling parametric variation in planar parts and for efficiently computing approximations of their tolerance envelopes. Part features are specified by algebraic equations...

Efficient Energy Computation for Monte Carlo Simulation (2003)

Itay Lotan, Fabian Schwarzer, Jean-claude Latombe

Abstract. Monte Carlo simulation (MCS) is a common methodology to compute pathways and thermodynamic properties of proteins. A simulation run is a series of random steps in conformation space, each...

1 To whom correspondences should be addressed (2003)

Itay Lotan, Fabian Schwarzer

The structural comparison of two proteins comes up in many applications in structural biology, where it is often necessary to find similarities in very large conformation sets. This work describes...

Geometric Reasoning About Translational Motions. Dissertation, Fakultat fur Informatik, Technische Universitat Munchen (2000)

Fabian Schwarzer, Fabian Schwarzer

zur Erlangung des akademischen Grades eines genehmigten Dissertation. Doktors der Naturwissenschaften (Dr. rer. nat.)

Detecting geometric infeasibility (1998)

Achim Schweikard, Fabian Schwarzer

Abstract: The problem of deciding whether one or more objects can be removed from a set of other planar or spatial objects arises in assembly planning, computer-aided design, robotics and...

Detecting Geometric Infeasibility (1998)

Achim Schweikard, Fabian Schwarzer

: The problem of deciding whether one or more objects can be removed from a set of other planar or spatial objects arises in assembly planning, computer-aided design, robotics and pharmaceutical drug...

Efficiently Testing for Unboundedness and m-handed Assembly (1997)

Fabian Schwarzer, Florian Bieberbach, Leo Joskowicz, Achim Schweikard

We address the problem of efficiently determining whether the intersection of a given set of d-dimensional halfspaces is unbounded. It is shown that detecting unboundedness can be reduced to a single...

General translational assembly planning (1997)

Achim Schweikard, Fabian Schwarzer

Abstract: An exact and practical method for translational motion planning with many degrees of freedom is derived. It is shown that certain D\Gammadimensional arrangements of hyperplanes can be...

General Translational Assembly Planning (1997)

Achim Schweikard, Fabian Schwarzer

: An exact and practical method for translational motion planning with many degrees of freedom is derived. It is shown that certain D\Gammadimensional arrangements of hyperplanes can be searched in...

Approximation of Protein Structure for Fast Similarity Measures

Fabian Schwarzer And, Fabian Schwarzer, Itay Lotan

It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C# representation contains redundant...