@inproceedings{2216,
  author       = {{Grad, Mariusz and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)}},
  pages        = {{67--72}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Pruning the Design Space for Just-In-Time Processor Customization}}},
  doi          = {{10.1109/ReConFig.2010.19}},
  year         = {{2010}},
}

@inproceedings{2224,
  author       = {{Grad, Mariusz and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}},
  isbn         = {{1-60132-140-6}},
  pages        = {{144--150}},
  publisher    = {{CSREA Press}},
  title        = {{{An Open Source Circuit Library with Benchmarking Facilities}}},
  year         = {{2010}},
}

@inproceedings{2220,
  author       = {{Andrews, David and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}},
  isbn         = {{1-60132-140-6}},
  pages        = {{165}},
  publisher    = {{CSREA Press}},
  title        = {{{Configurable Processor Architectures: History and Trends}}},
  year         = {{2010}},
}

@proceedings{2222,
  editor       = {{Plaks, Toomas P. and Andrews, David and DeMara, Ronald and Lam, Herman and Lee, Jooheung and Plessl, Christian and Stitt, Greg}},
  isbn         = {{1-60132-140-6}},
  publisher    = {{CSREA Press}},
  title        = {{{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}},
  year         = {{2010}},
}

@inproceedings{2226,
  author       = {{Beisel, Tobias and Niekamp, Manuel and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}},
  isbn         = {{978-1-4244-6965-9}},
  pages        = {{65--72}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators}}},
  doi          = {{10.1109/ASAP.2010.5540798}},
  year         = {{2010}},
}

@inproceedings{2206,
  author       = {{Keller, Ariane and Plattner, Bernhard and Lübbers, Enno and Platzner, Marco and Plessl, Christian}},
  booktitle    = {{Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)}},
  isbn         = {{978-1-4244-8864-3}},
  pages        = {{372--376}},
  publisher    = {{IEEE}},
  title        = {{{Reconfigurable Nodes for Future Networks}}},
  doi          = {{10.1109/GLOCOMW.2010.5700341}},
  year         = {{2010}},
}

@inproceedings{2227,
  author       = {{Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}},
  booktitle    = {{Proc. Int. Conf. Networked Sensing Systems (INSS)}},
  isbn         = {{978-1-4244-7911-5}},
  pages        = {{245--248}},
  publisher    = {{IEEE}},
  title        = {{{Rupeas: Ruby Powered Event Analysis DSL}}},
  doi          = {{10.1109/INSS.2010.5572211}},
  year         = {{2010}},
}

@inproceedings{2228,
  author       = {{Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}},
  booktitle    = {{Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)}},
  editor       = {{Hammami, Omar and Larrabee, Sandra}},
  title        = {{{Performance Estimation for the Exploration of CPU-Accelerator Architectures}}},
  year         = {{2010}},
}

@article{60463,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self‐intersections. Depending on the modification strategy, this effectively results in operators for Boolean combinations or for the construction of outer hulls that are suited for mesh repair tasks and accurate mesh‐based front tracking of deformable materials that split and merge. By combining an adaptive octree with nested binary space partitions (BSP), we can guarantee exactness (= correctness) and robustness (= completeness) of the algorithm while still achieving higher performance and less memory consumption than previous approaches. The efficiency and scalability in terms of runtime and memory is obtained by an operation localization scheme. We restrict the essential computations to those cells in the adaptive octree where intersections actually occur. Within those critical cells, we convert the input geometry into a plane‐based BSP‐representation which allows us to perform all computations exactly even with fixed precision arithmetics. We carefully analyze the precision requirements of the involved geometric data and predicates in order to guarantee correctness and show how minimal input mesh quantization can be used to safely rely on computations with standard floating point numbers. We properly evaluate our method with respect to precision, robustness, and efficiency.</jats:p>}},
  author       = {{Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2}},
  pages        = {{397--406}},
  publisher    = {{Wiley}},
  title        = {{{Exact and Robust (Self‐)Intersections for Polygonal Meshes}}},
  doi          = {{10.1111/j.1467-8659.2009.01609.x}},
  volume       = {{29}},
  year         = {{2010}},
}

@article{60464,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and sweeping along a discrete rigid motion trajectory. Many previous methods focus on the construction of a polygonal superset (containing self‐intersections and spurious internal geometry) of the boundary of the volumes which are swept. Only few are able to determine a clean representation of the actual boundary, most of them in a discrete volumetric setting. We unify such superset constructions into a succinct common formulation and present a technique for the robust extraction of a polygonal mesh representing the outer boundary, i.e. it makes no general position assumptions and always yields a manifold, watertight mesh. It is exact for Minkowski sums and approximates swept volumes polygonally. By using plane‐based geometry in conjunction with hierarchical arrangement computations we avoid the necessity of arbitrary precision arithmetics and extensive special case handling. By restricting operations to regions containing pieces of the boundary, we significantly enhance the performance of the algorithm.</jats:p>}},
  author       = {{Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{5}},
  pages        = {{1613--1622}},
  publisher    = {{Wiley}},
  title        = {{{Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes}}},
  doi          = {{10.1111/j.1467-8659.2010.01770.x}},
  volume       = {{29}},
  year         = {{2010}},
}

@article{60462,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p> <jats:italic>In this paper, we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new features appearing along the intersections of the input meshes. The term “hybrid” applies to our method in two ways: First, our algorithm operates on a hybrid data structure which stores the original input polygons (surface data) in an adaptively refined octree (volume data). By this we combine the robustness of volumetric techniques with the accuracy of surface‐oriented techniques. Second, we generate a new triangulation only in a close vicinity around the intersections of the input meshes and thus preserve as much of the original mesh structure as possible (hybrid mesh). Since the actual processing of the Boolean operation is confined to a very small region around the intersections of the input meshes, we can achieve very high adaptive refinement resolutions and hence very high precision. We demonstrate our method on a number of challenging examples.</jats:italic> </jats:p>}},
  author       = {{Pavić, Darko and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{1}},
  pages        = {{75--87}},
  publisher    = {{Wiley}},
  title        = {{{Hybrid Booleans}}},
  doi          = {{10.1111/j.1467-8659.2009.01545.x}},
  volume       = {{29}},
  year         = {{2010}},
}

@phdthesis{19605,
  author       = {{Lürwer-Brüggemeier, Katharina}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}}},
  volume       = {{261}},
  year         = {{2009}},
}

@phdthesis{19614,
  author       = {{Mense, Mario}},
  isbn         = {{978-3-939350-79-8}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{On Fault-Tolerant Data Placement in Storage Networks}}},
  volume       = {{260}},
  year         = {{2009}},
}

@phdthesis{19617,
  author       = {{Kortenjan, Michael}},
  isbn         = {{978-3-939350-77-4}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}}},
  volume       = {{258}},
  year         = {{2009}},
}

@phdthesis{19618,
  author       = {{Bonorden, Olaf}},
  isbn         = {{978-3-939350-76-7}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}}},
  volume       = {{257}},
  year         = {{2009}},
}

@techreport{19722,
  author       = {{Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}},
  title        = {{{Complexity and approximation of a geometric local robot assignment problem}}},
  year         = {{2009}},
}

@inbook{19724,
  abstract     = {{We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.}},
  author       = {{Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}},
  booktitle    = {{Algorithmic Aspects of Wireless Sensor Networks}},
  isbn         = {{9783642054334}},
  issn         = {{0302-9743}},
  pages        = {{252--262}},
  publisher    = {{Springer}},
  title        = {{{Complexity and Approximation of a Geometric Local Robot Assignment Problem}}},
  doi          = {{10.1007/978-3-642-05434-1_25}},
  year         = {{2009}},
}

@techreport{19825,
  abstract     = {{Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.}},
  author       = {{Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}},
  publisher    = {{Paderborn, Germany}},
  title        = {{{3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}}},
  year         = {{2009}},
}

@article{19830,
  author       = {{Ooi, Chia Ching and Schindelhauer, Christian}},
  issn         = {{1383-469X}},
  journal      = {{Mobile Networks and Applications (MONET)}},
  pages        = {{309--321}},
  title        = {{{Minimal Energy Path Planning for Wireless Robots}}},
  doi          = {{10.1007/s11036-008-0150-5}},
  year         = {{2009}},
}

@article{19831,
  author       = {{Ooi, Chia Ching and Schindelhauer, Christian}},
  issn         = {{1018-4864}},
  journal      = {{Telecommunication Systems}},
  pages        = {{25--37}},
  title        = {{{Utilizing detours for energy conservation in mobile wireless networks}}},
  doi          = {{10.1007/s11235-009-9188-3}},
  volume       = {{43}},
  year         = {{2009}},
}