3 research outputs found

    Procedural function-based modelling of volumetric microstructures

    Get PDF
    We propose a new approach to modelling heterogeneous objects containing internal volumetric structures with size of details orders of magnitude smaller than the overall size of the object. The proposed function-based procedural representation provides compact, precise, and arbitrarily parameterised models of coherent microstructures, which can undergo blending, deformations, and other geometric operations, and can be directly rendered and fabricated without generating any auxiliary representations (such as polygonal meshes and voxel arrays). In particular, modelling of regular lattices and cellular microstructures as well as irregular porous media is discussed and illustrated. We also present a method to estimate parameters of the given model by fitting it to microstructure data obtained with magnetic resonance imaging and other measurements of natural and artificial objects. Examples of rendering and digital fabrication of microstructure models are presented

    Modélisation procédurale par composants

    Full text link
    Le rĂ©alisme des images en infographie exige de crĂ©er des objets (ou des scĂšnes) de plus en plus complexes, ce qui entraĂźne des coĂ»ts considĂ©rables. La modĂ©lisation procĂ©durale peut aider Ă  automatiser le processus de crĂ©ation, Ă  simplifier le processus de modification ou Ă  gĂ©nĂ©rer de multiples variantes d'une instance d'objet. Cependant mĂȘme si plusieurs mĂ©thodes procĂ©durales existent, aucune mĂ©thode unique permet de crĂ©er tous les types d'objets complexes, dont en particulier un Ă©difice complet. Les travaux rĂ©alisĂ©s dans le cadre de cette thĂšse proposent deux solutions au problĂšme de la modĂ©lisation procĂ©durale: une solution au niveau de la gĂ©omĂ©trie de base, et l’autre sous forme d'un systĂšme gĂ©nĂ©ral adaptĂ© Ă  la modĂ©lisation des objets complexes. PremiĂšrement, nous prĂ©sentons le bloc, une nouvelle primitive de modĂ©lisation simple et gĂ©nĂ©rale, basĂ©e sur une forme cubique gĂ©nĂ©ralisĂ©e. Les blocs sont disposĂ©s et connectĂ©s entre eux pour constituer la forme de base des objets, Ă  partir de laquelle est extrait un maillage de contrĂŽle pouvant produire des arĂȘtes lisses et vives. La nature volumĂ©trique des blocs permet une spĂ©cification simple de la topologie, ainsi que le support des opĂ©rations de CSG entre les blocs. La paramĂ©trisation de la surface, hĂ©ritĂ©e des faces des blocs, fournit un soutien pour les textures et les fonctions de dĂ©placements afin d'appliquer des dĂ©tails de surface. Une variĂ©tĂ© d'exemples illustrent la gĂ©nĂ©ralitĂ© des blocs dans des contextes de modĂ©lisation Ă  la fois interactive et procĂ©durale. DeuxiĂšmement, nous prĂ©sentons un nouveau systĂšme de modĂ©lisation procĂ©durale qui unifie diverses techniques dans un cadre commun. Notre systĂšme repose sur le concept de composants pour dĂ©finir spatialement et sĂ©mantiquement divers Ă©lĂ©ments. À travers une sĂ©rie de dĂ©clarations successives exĂ©cutĂ©es sur un sous-ensemble de composants obtenus Ă  l'aide de requĂȘtes, nous crĂ©ons un arbre de composants dĂ©finissant ultimement un objet dont la gĂ©omĂ©trie est gĂ©nĂ©rĂ©e Ă  l'aide des blocs. Nous avons appliquĂ© notre concept de modĂ©lisation par composants Ă  la gĂ©nĂ©ration d'Ă©difices complets, avec intĂ©rieurs et extĂ©rieurs cohĂ©rents. Ce nouveau systĂšme s'avĂšre gĂ©nĂ©ral et bien adaptĂ© pour le partionnement des espaces, l'insertion d'ouvertures (portes et fenĂȘtres), l'intĂ©gration d'escaliers, la dĂ©coration de façades et de murs, l'agencement de meubles, et diverses autres opĂ©rations nĂ©cessaires lors de la construction d'un Ă©difice complet.The realism of computer graphics images requires the creation of objects (or scenes) of increasing complexity, which leads to considerable costs. Procedural modeling can help to automate the creation process, to simplify the modification process or to generate multiple variations of an object instance. However although several procedural methods exist, no single method allows the creation of all types of complex objects, including in particular a complete building. This thesis proposes two solutions to the problem of procedural modeling: one solution addressing the geometry level, and the other introducing a general system suitable for complex object modeling. First, we present a simple and general modeling primitive, called a block, based on a generalized cuboid shape. Blocks are laid out and connected together to constitute the base shape of complex objects, from which is extracted a control mesh that can contain both smooth and sharp edges. The volumetric nature of the blocks allows for easy topology specification, as well as CSG operations between blocks. The surface parameterization inherited from the block faces provides support for texturing and displacement functions to apply surface details. A variety of examples illustrate the generality of our blocks in both interactive and procedural modeling contexts. Second, we present a novel procedural modeling system which unifies some techniques into a common framework. Our system relies on the concept of components to spatially and semantically define various elements. Through a series of successive statements executed on a subset of queried components, we grow a tree of components ultimately defining an object whose geometry is made from blocks. We applied our concept and representation of components to the generation of complete buildings, with coherent interiors and exteriors. It proves general and well adapted to support partitioning of spaces, insertion of openings (doors and windows), embedding of staircases, decoration of façades and walls, layout of furniture, and various other operations required when constructing a complete building

    Large bichromatic point sets admit empty monochromatic 4-gons

    No full text
    We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES(k) such that any set S of at least fES(k) points in general position in the plane has a subset of k points that are the vertices of a convex k-gon. In our setting the points of S are colored, and we say that a (not necessarily convex) spanned polygon is monochromatic if all its vertices have the same color. Moreover, a polygon is called empty if it does not contain any points of S in its interior. We show that any bichromatic set of n ≄ 5044 points in R2 in general position determines at least one empty, monochromatic quadrilateral (and thus linearly many).Postprint (published version
    corecore