نتایج جستجو برای: shape factor

تعداد نتایج: 1023669  

2016
Iestyn Jowers Christopher Earl

Research into shape grammar implementation has largely been concerned with rectilinear shapes and there has been little research concerning implementation on curved shapes. This reflects developments of the shape grammar formalism which has traditionally been defined according to straight lines. In this paper, issues regarding the application of shape grammars on curved shapes are investigated....

2002
Shin Yoshizawa Alexander G. Belyaev Hans-Peter Seidel

In this paper, we propose a set of free-form shape deformation techniques. The basic approach can be described as follows. Given a surface represented by a mesh and a control point, for every mesh vertex let us consider the difference between the control point and the vertex. The vertex is shifted by a displacement equal to the difference times a scale factor where the scale factor is given by ...

2007
Dmitry Chetverikov Judit Verest

In the framework of a European technological research project 2], a general method is presented for shape measurement and defect detection of industrially produced objects using the characteristic 2D projections of the objects. The method is applied to the visual inspection and dimensional measurement of ferrite cores. An optical shape gauge system is described, based on rotation-invariant shap...

2004
Sheng Zhou Christopher B. Jones

Few line generalisation algorithms provide explicit control over the style of generalisation that results. In this paper we introduce weighted effective area, a set of area-based metrics for cartographic line generalisation following the bottom-up approach of the Visvalingam-Whyatt algorithm. Various weight factors are used to reflect the flatness, skewness and convexity of the triangle upon wh...

2014
Karen Villaverde Olga Kosheleva Martine Ceberio

In many practical applications, we encounter ellipsoid constraints, ellipsoid-shaped clusters, etc. A usual justification for this ellipsoid shape comes from the fact that many real-life quantities are normally distributed, and for a multi-variate normal distribution, a natural confidence set (containing the vast majority of the objects) is an ellipsoid. However, ellipsoids appear more frequent...

1996
Mourad Zerroug Ramakant Nevatia

Mourad Zerroug and Ramakant Nevatia We address the inference of 3-D segmented descriptions of complex objects from a single intensity image. Our approach is based on the analysis of the projective properties of a small number of generalized cylinder primitives and their relationships in the image which make up common man-made objects. Past work on this problem has either assumed perfect contour...

2005
Jayant Shah

The emphasis of the two approaches described in this chapter is on determining shape skeletons in the presence of noise. The parts of the skeleton which are most robust in the presence of noise correspond to the parts of the shape where its width varies slowly. In contrast, singular points of the skeleton such as junctions tend to be sensitive to noise. The strategy therefore is to concentrate ...

2000
Gregory D. Durgin

This paper presents a new theory of multipath shape factors that greatly simplifies the description of small-scale fading statistics of a wireless receiver. A method is presented for reducing a multipath channel with arbitrary spatial complexity to three shape factors that have simple intuitive geometrical interpretations. Furthermore, these shape factors are shown to describe the statistics of...

2011
Evan Bolton Sunghwan Kim Stephen H. Bryant

BACKGROUND The shape diversity of 16.4 million biologically relevant molecules from the PubChem Compound database and their 1.46 billion diverse conformers was explored as a function of molecular volume. RESULTS The diversity of shape space was investigated by determining the shape similarity threshold to achieve a maximum on the count of reference shapes per unit of conformer volume. The rat...

2013
Holger Siegel Axel Simon

A static shape analysis is presented that can prove the absence of NULLand dangling pointer dereferences in standard algorithms on lists, trees and graphs. It is conceptually simpler than other analyses that use symbolically represented logic to describe the heap. Instead, it represents the heap as a single graph and a Boolean formula. The key idea is to summarize two nodes by calculating their...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید