The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 81 –
100 of
152
Given a combinatorial description C of a polyhedron having E edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize C is generally not a convex subset of RE. If C has five or more faces, Andreev's Theorem states that the corresponding space of dihedral angles AC obtained by restricting to non-obtuse angles is a convex polytope. In this paper we explain why Andreev did not consider tetrahedra, the only polyhedra having fewer than five faces, by demonstrating that the...
The definition of n-width of a bounded subset A in a normed linear space X is based on the existence of n-dimensional subspaces. Although the concept of an n-dimensional subspace is not available for metric trees, in this paper, using the properties of convex and compact subsets, we present a notion of n-widths for a metric tree, called Tn-widths. Later we discuss properties of Tn-widths, and show that the compact width is attained. A relationship between the compact widths and Tn-widths is also...
La notion de complète réductibilité d’une représentation linéaire peut se définir en termes de l’action de sur l’immeuble de Tits de . Cela suggère une notion analogue pour tous les immeubles sphériques, et donc aussi pour tous les groupes réductifs. On verra comment cette notion se traduit en termes topologiques et quelles applications on peut en tirer.
This paper gives a simple algorithm for the identification of the insidedness and the autsidedness of a plane bounded region. The region can be the union, intersection or difference of an arbitrary number of -tuple connected regions.
The Voronoi diagram of n distinct generating points divides the plane into cells, each of which consists of points most close to one particular generator. After introducing 'limit Voronoi diagrams' by analyzing diagrams of moving and coinciding points, we define compactifications of the configuration space of n distinct, labeled points. On elements of these compactifications we define Voronoi diagrams.
Currently displaying 81 –
100 of
152