Results 41 to 50 of about 4,255,094 (265)
Fabrication of ZnO/CuO Hybrid Nanocomposite for Photocatalytic Degradation of Brilliant Cresyl Blue (BCB) Dye in Aqueous Solutions [PDF]
Journal of Water and Environmental Nanotechnology, 2021 Here in the present study, we report the synthesis of ZnO nanoparticles, ZnO/CuO(3%), ZnO/CuO(5%), and ZnO/CuO(10%), nanocomposites using simple precipitation method with variation of CuO content and the activities of prepared samples were investigated ...
PARMESHWAR MEENA +2 more
doaj +1 more source
New results on stabbing segments with a polygon [PDF]
, 2015 We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element
Díaz Bañez, José Miguel +5 more
core +2 more sources
Pre-determination of prediction of yield-line pattern of slabs using Voronoi diagrams
Open Engineering, 2022 The article presents a new method of predicting the yield-lines of statically loaded slabs, based on roof geometry (straight skeletons) and Voronoi diagrams for a polygon.
Koźniewski Edwin, Orłowski Marcin
doaj +1 more source
Constructing A Simple Polygonalizations
, 2011 We consider the methods of construction simple polygons for a set S of n points and applying them for searching the minimal area polygon. In this paper we propose the approximate algorithm, which generates the simple polygonalizations of a fixed set of points and finds the minimal area polygon, in O (n3) time and using O(n2) memory.
V. Tereshchenko, V. Muravitskiy
openaire +2 more sources
On compatible triangulations of simple polygons
Computational Geometry, 1993 AbstractIt is well known that, given two simple n-sided polygons, it may not be possible to triangulate the two polygons in a compatible fashion, if one's choice of triangulation vertices is restricted to polygon corners. Is it always possible to produce compatible triangulations if additional vertices inside the polygon are allowed? We give a positive
Raimund Seidel +2 more
openaire +2 more sources
Diffuse reflection diameter in simple polygons [PDF]
Discrete Applied Mathematics, 2016 We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with $n$ walls from any interior point light source is $\lfloor n/2 \rfloor - 1$. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular
Barequet, Gill +6 more
openaire +3 more sources
On link diameter of a simple rectilinear polygon [PDF]
Computer Science Journal of Moldova, 1993 The rectilinear link distance between two points inside a simple rectilinear polygon P is defined to be the minimum number of edges of a path consisting of axis-parallel segments lying inside P. The link diameter of P is the maximum link distance between
V. Chepoi, F. Dragan
doaj
A Spatially Bounded Airspace Axiom
Axioms, 2022 Free Route Airspace (FRA), a new concept implemented across European airspace, is designed to eliminate the adverse effects of air traffic, reduce fuel consumption, simplify and expand flight planning.
Peter Szabó +2 more
doaj +1 more source
Space-Time Trade-offs for Stack-Based Algorithms [PDF]
, 2013 In memory-constrained algorithms we have read-only access to the input, and the number of additional variables is limited. In this paper we introduce the compressed stack technique, a method that allows to transform algorithms whose space bottleneck is a
Barba, Luis +4 more
core +4 more sources
Diffuse Reflection Radius in a Simple Polygon [PDF]
Algorithmica, 2014 It is shown that every simple polygon in general position with $n$ walls can be illuminated from a single point light source $s$ after at most $\lfloor (n-2)/4\rfloor$ diffuse reflections, and this bound is the best possible. A point $s$ with this property can be computed in $O(n\log n)$ time.
Fox-Epstein, Eli +2 more
openaire +4 more sources