2 results
Search Results
Now showing 1 - 2 of 2
Item Generation of Folded Terrains from Simple Vector Maps(The Eurographics Association, 2015) Michel, Elie; Emilien, Arnaud; Cani, Marie-Paule; B. Bickel and T. RitschelWhile several terrain generation methods focused on plausible watersheds, the fact that most mountains should not be isolated but rather be part of wider scale mountain ranges was seldom considered. In this work, we present the first procedural method that generates folded terrains from simple user input, in the form of some sparse peak distribution on a vector map. The key idea is to infer possible continental plates from this distribution and to use simplified plate tectonics to generate relevant terrain folds. The resulting terrain with large-scale folds, computed in real-time, can be further refined using standard erosion simulation. This leads to detailed terrains with plausible mountain ranges that match the peak distributions and main rivers specified on simple vector maps.Item Replaceable Substructures for Efficient Part-Based Modeling(The Eurographics Association and John Wiley & Sons Ltd., 2015) Liu, Han; Vimont, Ulysse; Wand, Michael; Cani, Marie-Paule; Hahmann, Stefanie; Rohmer, Damien; Mitra, Niloy J.; Olga Sorkine-Hornung and Michael WimmerA popular mode of shape synthesis involves mixing and matching parts from different objects to form a coherent whole. The key challenge is to efficiently synthesize shape variations that are plausible, both locally and globally. A major obstacle is to assemble the objects with local consistency, i.e., all the connections between parts are valid with no dangling open connections. The combinatorial complexity of this problem limits existing methods in geometric and/or topological variations of the synthesized models. In this work, we introduce replaceable substructures as arrangements of parts that can be interchanged while ensuring boundary consistency. The consistency information is extracted from part labels and connections in the original source models. We present a polynomial time algorithm that discovers such substructures by working on a dual of the original shape graph that encodes inter-part connectivity. We demonstrate the algorithm on a range of test examples producing plausible shape variations, both from a geometric and from a topological viewpoint.