EG 2016 - Short Papers

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/15066

Browse

Browsing EG 2016 - Short Papers by Subject "I.3.5 [Computer Graphics]"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    A Generic Physically-based Approach to the Opening Design Problem
    (The Eurographics Association, 2016) Κalampokis, Konstantinos; Papaioannou, Georgios; Gkaravelis, Anastasios; T. Bashford-Rogers and L. P. Santos
    Today architectural design harnesses photorealistic rendering to accurately assess energy transport for the design of energyefficient buildings. In this context, we present an automatic physically-based solution to the opening design problem, i.e. the goal-driven process of defining openings on the input geometry given a set of lighting constraints, to better exploit natural daylight. Based on a hierarchical approach that combines a linear optimization strategy and a genetic algorithm, our method computes the optimal number, position, size and shape of openings, using a path tracing-based estimator to precisely model the light transport for arbitrary materials and geometry. The method quickly converges to an opening configuration that optimally approximates the desired illumination, with no special geometry editing requirements and the ability to trade quality for performance for interactive applications. We validate our results against ground truth experiments for various scenes and time-of-day intervals.
  • Thumbnail Image
    Item
    Mesh Saliency Analysis via Local Curvature Entropy
    (The Eurographics Association, 2016) Limper, Max; Kuijper, Arjan; Fellner, Dieter W.; T. Bashford-Rogers and L. P. Santos
    We present a novel approach for estimating mesh saliency. Our method is fast, flexible, and easy to implement. By applying the well-known concept of Shannon entropy to 3D mesh data, we obtain an efficient method to determine mesh saliency. Comparing our method to the most recent, state-of-the-art approach, we show that results of at least similar quality can be achieved within a fraction of the original computation time. We present saliency-guided mesh simplification as a possible application.
  • Thumbnail Image
    Item
    Smooth Interpolation of Curve Networks with Surface Normals
    (The Eurographics Association, 2016) Stanko, Tibor; Hahmann, Stefanie; Bonneau, Georges-Pierre; Saguin-Sprynski, Nathalie; T. Bashford-Rogers and L. P. Santos
    Recent surface acquisition technologies based on microsensors produce three-space tangential curve data which can be transformed into a network of space curves with surface normals. This paper addresses the problem of surfacing an arbitrary closed 3D curve network with given surface normals. Thanks to the normal vector input, the patch finding problem can be solved unambiguously and an initial piecewise smooth triangle mesh is computed. The input normals are propagated throughout the mesh and used to compute mean curvature vectors. We then introduce a new variational optimization method in which the standard bi-Laplacian is penalized by a term based on the mean curvature vectors. The intuition behind this original approach is to guide the standard Laplacian-based variational methods by the curvature information extracted from the input normals. The normal input increases shape fidelity and allows to achieve globally smooth and visually pleasing shapes.