Embedding Shapes without Predefined Parts

Download
index.pdf
2010-8
Keles, Hacer Yalim
Özkar, Mine
Tarı, Zehra Sibel
Show full item record
163
views
185
downloads
For a practical computer implementation of part embedding in shapes that is also true to their continuous character and the shape grammar formalism, shapes and their boundaries are handled together in composite shape and label algebras. Temporary representations of shapes, termed 'overcomplete graphs', comprise boundary elements of shapes and how they are assembled, and are utilized in a two-phase algorithm that systematically searches for embedded parts. The associated implementation is developed to receive user-defined constraints for an interactive search. In particular, the user-defined reference shape extends the search to nondeterministic cases.
Supporting designers hierarchies, Implementation, Recognition, Generation, Grammars, System
https://hdl.handle.net/11511/28123
Environment and Planning B: Planning and Design
Department of Computer Engineering, Article

Suggestions

Nested local symmetry set
Tarı, Zehra Sibel (Elsevier BV, 2000-08-01)
A local-symmetry-based representation for shapes in arbitrary dimensions and a method for its computation are presented. The method depends on analyzing the Hessian of a specific boundaryness function, v, which is computed as the minimizer of an energy functional. The method is basically a generalized ridge finding scheme in which the ridges are defined in terms of the orbit of the gradient vector del v under the action of the Hessian of v. Once the ridges are determined, the local extrema of the magnitude ...
Weighted shapes for embedding perceived wholes
Keles, Hacer Yalim; Özkar Kabakçıoğlu, Mine; Tarı, Zehra Sibel (2012-01-01)
Embedding parts is a key problem in computing when dealing with continuous matter such as shapes rather than discrete matter such as symbols. For computing part relations such as embedding, a technical framework that uses weighted shapes is introduced and implemented. In the proposed framework, for any given two-dimensional shape, the entire canvas is defined as a weighted shape and serves as a registration mark in detecting embedded parts. The approach treats shapes as perceived wholes rather than composed...
An octree-based solution-adaptive Cartesian grid generator and Euler solver for the simulation of three-dimensional inviscid compressible flows
Kara, Emre; KUTLAR, AHMET İHSAN; Aksel, Mehmet Haluk (2016-01-01)
Cartesian grid generation methods are especially designed algorithms to generate automatic grids for complex geometries and to simulate flows around such geometries regardless of the body shape. Cartesian grids are generated by constructing an octree-based data structure for the purpose of connecting the Cartesian cells to each other. Entire algorithm is implemented in object-oriented FORTRAN programming language. Some special Cartesian algorithms, namely, Ray-Casting method and cut-cell adaptation are used...
Numerical and experimental analysis of indentation
Koray, Erge; Tekkaya, Erman; Department of Mechanical Engineering (2005)
Indentation tests are widely used with simultaneous measurements of indentation depth and force especially for determining material properties. In this study; numerical and experimental investigation of the force-indentation measurements is presented. For indentation tests on anisotropic metals, a novel indenter which is not self similar is used with three transducers to measure the displacements. It is seen that in order to have high repeatability and accuracy at the tests, workpiece and indenter parameter...
Multiple Shape Correspondence by Dynamic Programming
Sahillioğlu, Yusuf (2014-10-01)
We present a multiple shape correspondence method based on dynamic programming, that computes consistent bijective maps between all shape pairs in a given collection of initially unmatched shapes. As a fundamental distinction from previous work, our method aims to explicitly minimize the overall distortion, i.e., the average isometric distortion of the resulting maps over all shape pairs. We cast the problem as optimal path finding on a graph structure where vertices are maps between shape extremities. We e...
Citation Formats
H. Y. Keles, M. Özkar, and Z. S. Tarı, “Embedding Shapes without Predefined Parts,” Environment and Planning B: Planning and Design, pp. 664–681, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/28123.
METU IIS - Integrated Information Service open@metu.edu.tr