نتایج جستجو برای: polyhedra
تعداد نتایج: 3832 فیلتر نتایج به سال:
In this paper we present an output-sensitive algorithm to maintain the view of a set of c-oriented polyhedra under insertions into or deletions from the set. (A set of polyhedra is c-oriented ifthe number of different orientations of its edges is bounded by some constant c.) Cyclic overlap in the scene is aJlowed and the polyhedra may even intersect. The time needed for an update is 0« k + 1) l...
Bombyx mori cypovirus is a major pathogen which causes significant losses in silkworm cocoon harvests because the virus particles are embedded in micrometer-sized protein crystals called polyhedra and can remain infectious in harsh environmental conditions for years. But the remarkable stability of polyhedra can be applied on slow-release carriers of cytokines for tissue engineering. Here we sh...
Disordered structures such as liquids and glasses, grains and foams, galaxies, etc. are often represented as polyhedral tilings. Characterizing the associated polyhedral tiling is a promising strategy to understand the disordered structure. However, since a variety of polyhedra are arranged in complex ways, it is challenging to describe what polyhedra are tiled in what way. Here, to solve this ...
We present new graph-theoretical conditions for polyhedra of inscribable type and Delaunay triangulations. We establish several sufficient conditions of the following general form: if a polyhedron has a sufficiently rich collection of Hamiltonian subgraphs, then it is of inscribable type. These results have several consequences: • All 4-connected polyhedra are of inscribable type. • All simplic...
Sets of linear inequalities are an expressive reasoning tool for approximating the reachable states of a program. However, the most precise way to join two states is to calculate the convex hull of the two polyhedra that are represented by the inequality sets, an operation that is exponential in the dimension of the polyhedra. We investigate how similarities in the two input polyhedra can be ex...
We prove that the class of rational polyhedra and the class of topologically regular regions definable in an o-minimal structure are each elementarily equivalent to the class of polyhedra for topological languages.
We prove that the class of rational polyhedra and the class of topologically regular regions definable in an o-minimal structure over the reals are each elementarily equivalent to the class of polyhedra for topological languages.
We study the Minkowski length L(P ) of a lattice polytope P , which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P . The Minkowski length represents the largest possible number of factors in a factorization of polynomials with exponent vectors in P , and shows up in lower bounds for the minimum distance of toric codes. In this paper we give a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید