نتایج جستجو برای: geometrically cubical shape aggregate
تعداد نتایج: 242859 فیلتر نتایج به سال:
Two component X–ray spectra (soft multicolor black body plus harder power law) are frequently observed from accreting black holes. These components are presumably associated with the different parts of the accretion flow (optically thick and optically thin respectively) in the vicinity of the compact source. Timing analysis further suggests that most of the aperiodic variability of the X–ray fl...
We address the problem of estimating the three-dimensional shape and radiance of a surface in space from images obtained with different focal settings. We pose the problem as an infinite-dimensional optimization and seek for the global shape of the surface by numerically solving a partial differential equation (PDE). Our method has the advantage of being global (so that regularization can be im...
An efficient algorithm determines the blank shape necessary to manufacture a surface by press forming. The technique is independent of material properties and instead uses surface geometry and an area conservation constraint to generate a geometrically feasible blank shape. The algorithm is formulated as an approximate geometric interpretation of the reversal of the forming process. The primary...
We address the problem of estimating the three-dimensional shape and radiance of a surface in space from images obtained with different focal settings. We pose the problem as an infinite-dimensional optimization and seek for the global shape of the surface by numerically solving a partial differential equation (PDE). Our method has the advantage of being global (so that regularization can be im...
K Maps are generally and ideally , thought to be simplest form for obtaining solution of Boolean equations.Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws and different traits of Karnaugh Maps. Largest possible kcubes that exist for a given function are equivalent to its prime implicants. A technique...
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the associated chain complexes. Finally, we use this new tool to give the first combinatorial proof of the splitting necklace theorem of Alon. The paper ends wi...
We prove that any hyperplane H in a CAT(0) cubical complex X has no self-intersections and separates X into two convex complementary components. These facts were originally proved by Sageev. Our argument shows that his theorem (or this direction of his theorem) is a corollary of Gromov’s link condition. We also give new arguments establishing some combinatorial properties of hyperplanes. We sho...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید