Eurographics 2016 Additional material accompanying paper This document contains a number of additional re-photography examples. Each example consists of a vintage and contemporary photo pair with corresponding line constraints, the quad-based AAAP re-photo of the contemporary photo and a blend of this result with the vintage photo to better appreciate the match. Images courtesy of nycvintageima...

We present an improved algorithm for the progressive simplification of quad meshes, which adapts the resolution of the mesh to details of the modeled shape. We extend previous work [TPC∗10], by simplifying the approach and combining it with the concept of Fitmaps introduced in [PPT∗10]. The new algorithm has several advantages: it is simpler and more robust; it does not need a parametrization o...

A well-documented problem of Catmull and Clark subdivision is that, in the neighborhood of extraordinary point, the curvature is unbounded and fluctuates. In fact, since one of the eigenvalues that determines elliptic shape is too small, the limit surface can have a saddle point when the designer’s input mesh suggests a convex shape. Here, we replace, near the extraordinary point, CatmullClark ...

One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...

We study the elliptic inclusion given in following divergence form $$\begin{aligned}&-\mathrm {div}\,A(x,\nabla u) \ni f\quad \mathrm {in}\quad \Omega ,\\&u=0\quad {on}\quad \partial . \end{aligned}$$ As we assume that $$f\in L^1(\Omega )$$ , solutions to above problem are understood renormalized sense. also nonstandard, possibly nonpolynomial, heterogeneous and anisotropic growth coercivity co...

Approaches to polygonal decomposition for hierarchical image representation are described. For planar decomposition, quad trees using square and triangular neighborhoods are found to be the only feasible methods, having the same computational complexity. For grid images the choice of the appropriate tree type is determined by the grid topology. Triangular and square quad trees are appropriate f...

The effects of quad rugby training on physical capacity and physical strain during standardized activities of daily living were investigated in 9 trained (A) and 5 untrained quad rugby players (B), and 7 inactive persons with tetraplegia (C) at 0, 3 and 6 months after the start of a quad rugby training program (1.5h.wk[-1]). Physical capacity was measured as maximal isometric strength, peak pow...

In multi-objective evolutionary algorithms (MOEAs) with elitism, the data structures for storing and updating archives may have a great impact on the required computational (CPU) time, especially when optimizing higherdimensional problems with large Pareto-sets. In this chapter, we introduce Quad-trees as an alternative data structure to linear lists for storing Paretosets. In particular, we in...

This article presents the design, control, and implementation of a small quad-rotor system under the practical limitation of being cost effective for private use, such as in the cases of control education or hobbies involving radio-controlled systems. Several practical problems associated with implementing a small quad-rotor system had to be taken into account to satisfy this cost constraint. F...

A widely used method for constructing phylogenetic trees is the neighbour-joining method of Saitou and Nei. We develope heuristics for speeding up the neighbour-joining method which generate the same phylogenetic trees as the original method. All heuristics are based on using a quad-tree to guide the search for the next pair of nodes to join, but differ in the information stored in quad-tree no...