Scattering characteristics of polygon plate
نویسندگان
چکیده
منابع مشابه
The polygon-circle paradox and convergence in thin plate theory
The solution for a simply supported many-sided polygonal plate does not agree with that for the corresponding circular plate. This paper describes the earlier work of Rao and Rajaiah on polygonal plates and then explains why best convergence of series solutions occurs when the boundary conditions are denned as w = Vw> = 0. Notation D — operator in original problems, D = operator adjoint to D, F...
متن کاملExtending Backward Polygon Beam Tracing to Glossy Scattering Surfaces
Backward polygon beam tracing methods, that is beam tracing from the light source (L), are well suited to gather path coherency from specular (S) scattering surfaces. These methods are useful for modelling and efficiently simulating caustics on diffuse (D) surfaces; an effect due to LS+D transport paths. This paper generalizes backward polygon beam tracing to include a glossy (G) scattering sur...
متن کاملPermeability characteristics of the human nail plate.
Synopsis The permeation of chemicals across the nail plate and their consequent effects are discussed in relation to cosmetic toxicity and possible clinical efficacy. The reviewed data are then assessed and placed in context with recent observations on the direct assessment of permeability of the human nail plate. Although marked differences between the diffusional barrier characteristics of na...
متن کاملPolygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. Afte...
متن کاملCoherent and Exact Polygon-to-Polygon Visibility
Visibility computation is a classical problem in computer graphics. A wide variety of algorithms provides solutions with a different accuracy. However, the four dimensional nature of the 3D visibility has prevented for a long time from leading to exact from-polygon visibility algorithms. Recently, the two first tractable solutions were presented by Nirenstein, then Bittner. Their works give the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Engineering
سال: 2019
ISSN: 2051-3305,2051-3305
DOI: 10.1049/joe.2019.0485