Finding critical regions in a network

It is important that our vital networks (e.g., infrastructures) are robust to more than single-link failures. Failures might for instance affect a part of the network that resides in a certain geographical region. In this paper, considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region - that is,...

Architectural Robotics: Bridging the Divide between Academic Research and Industry

The presented research addresses the question of how to bridge the divide between academic research and industry in the domain of by investigating aspects of computational design , robotic fabrication and their impact on practice via a series of experiments and case studies. Research sub-questions related to the architectural model , geometry...

Delaunay Painting: Perceptual Image Colouring from Raster Contours with Gaps

We introduce Delaunay Painting, a novel and easy-to-use method to flat-colour contour-sketches with gaps. Starting from a Delaunay triangulation of the input contours, triangles are iteratively filled with the appropriate colours, thanks to the dynamic update of flow values calculated from colour hints. Aesthetic finish is then achieved,...

A Simple and Fast Hole Detection Algorithm for Triangulated Surfaces

We present a simple and fast algorithm for computing the exact holes in discrete two-dimensional manifolds embedded in a threedimensional Euclidean space. We deal with the intentionally created "through holes" or "tunnel holes" in the geometry as opposed to missing triangles. The algorithm detects the holes in the geometry directly without...