Model Synthesis: A General Procedural Modeling Algorithm.
ABSTRACT We present a method for procedurally modeling general complex 3D shapes. Our approach can automatically generate complex models of buildings, man-made structures, or urban datasets in a few minutes based on user-defined inputs. The algorithm attempts to generate complex 3D models that resemble a user-defined input model and that satisfy various dimensional, geometric, and algebraic constraints to control the shape. These constraints are used to capture the intent of the user and generate shapes that look more natural. We also describe efficient techniques to handle complex shapes, highlight its performance on many different types of models. We compare model synthesis algorithms with other procedural modeling techniques, discuss the advantages of different approaches, and describe as close connection between model synthesis and context-sensitive grammars.
- SourceAvailable from: kddresearch.com
Conference Proceeding: Development models of herbaceous plants for computer imagery purposes.[show abstract] [hide abstract]
ABSTRACT: In this paper we present a method for modeling herbaceous plants, suitable for generating realistic plant images and animating developmental processes. The idea is to achieve realism by simulating mechanisms which control plant growth in nature. The developmental approach to the modeling of plant architecture is extended to the modeling of leaves and flowers. The method is expressed using the formalism of L-systems.Proceedings of the 15st Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1988; 01/1988
- [show abstract] [hide abstract]
ABSTRACT: "Symmetry is a complexity-reducing concept [...]; seek it every-where." - Alan J. Perlis Many natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models and efficiently discovers and extracts a compact representation of their Euclidean symmetries. These symmetries can be partial, approximate, or both. The method is based on matching simple local shape signatures in pairs and using these matches to accumulate evidence for symmetries in an appropriate transformation space. A clustering stage extracts potential significant symmetries of the object, followed by a verification step. Based on a statistical sampling analysis, we provide theoretical guarantees on the success rate of our algorithm. The extracted symmetry graph representation captures important high-level information about the structure of a geometric model which in turn enables a large set of further processing operations, including shape compression, segmentation, consistent editing, symmetrization, indexing for retrieval, etc. Copyright © 2006 by the Association for Computing Machinery, Inc.
Conference Proceeding: The use of positional information in the modeling of plants.[show abstract] [hide abstract]
ABSTRACT: We integrate into plant models three elements of plant representation identified as important by artists: posture (manifested in curved stems and elongated leaves), gradual variation of features, and the progression of the drawing process from overall silhouette to local details. The resulting algorithms increase the visual realism of plant models by offering an intuitive control over plant form and supporting an interactive modeling process. The algorithms are united by the concept of expressing local attributes of plant architecture as functions of their location along the stems.01/2001