24 Result(s)
within
Christian Scheffer
English
-
Article
Open AccessConnected coordinated motion planning with bounded stretch
We consider the problem of connected coordinated motion planning for a large collective of simple, identical robots: From a given start grid configuration of robots, we need to reach a desired target configura...
-
Article
Open AccessWorst-Case Optimal Covering of Rectangles by Disks
We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any
-
Article
Open AccessPacking Disks into Disks with Optimal Worst-Case Density
We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily e...
-
Article
Open AccessConnected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
We provide algorithmic methods for connected reconfiguration of lattice-based cellular structures by finite-state robots, motivated by large-scale constructions in space. We present algorithms that are able to...
-
Article
Open AccessParticle-Based Assembly Using Precise Global Control
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to de...
-
Chapter and Conference Paper
Particle-Based Assembly Using Precise Global Control
In micro- and nano-scale systems, particles can be moved by using an external force such as gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to...
-
Article
Open AccessCADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of particles by a finite automaton t...
-
Article
Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-asse...
-
Chapter and Conference Paper
Train Scheduling: Hardness and Algorithms
We introduce the Train Scheduling Problem which can be described as follows: Given m trains via their tracks, i.e., curves in the plane, and the trains’ lengths, we want to compute a schedule that moves collision...
-
Chapter and Conference Paper
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of particles by a finite automaton t...
-
Chapter and Conference Paper
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
We provide algorithmic methods for reconfiguration of lattice-based cellular structures by finite-state robots, motivated by large-scale constructions in space. We present algorithms that are able to detect an...
-
Article
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density
In the classic, \(\mathsf {NP}\) NP ...
-
Chapter and Conference Paper
Online Circle Packing
We consider the online problem of packing circles into a square con...
-
Chapter and Conference Paper
The Prefix Fréchet Similarity
We present the prefix Fréchet similarity as a new measure for similarity of curves which is e.g. motivated by evacuation analysis and defined as follows. Given two (polygonal) curves T and
-
Article
Path Refinement in Weighted Regions
In this paper, we study the weighted region problem (WRP) which is to compute a shortest path in a weighted partitioning of a plane. Recent results show that WRP is not solvable in any algebraic computation mo...
-
Chapter and Conference Paper
Don’t Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
We consider dynamic loading and unloading problems for heavy geometric objects. The challenge is to maintain balanced configurations at all times: minimize the maximal motion of the overall center of gravity. ...
-
Article
Open AccessWorld Congress Integrative Medicine & Health 2017: Part one
-
Chapter and Conference Paper
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density
In the circle packing problem for triangular containers, one asks whether a given set of circles can be packed into a given triangle. Packing problems like this have been shown to be
-
Article
Open AccessReflective practice and its role in facilitating creative responses to dilemmas within clinical communication - a qualitative analysis
Good communication is a major factor in delivering high quality in care. Research indicates that current communication skills training alone might not sufficiently enable students to find context-specific crea...
-
Chapter and Conference Paper
An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration
In the presence of dynamic insertions and deletions into a partially reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of develo** efficient approaches to dynamic defragmentation an...
