Results 41 to 50 of about 78,112 (316)
An Upper Bound on the Average Size of Silhouettes [PDF]
, 2006 It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for a large class
Marc Glisse +6 more
core +8 more sources
Vertex-Unfoldings of Simplicial Polyhedra [PDF]
, 2001 We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected
Demaine, Erik D. +4 more
core +5 more sources
The Journal of Engineering, 2019 As the penetration of wind generation increases, the uncertainty it brings has imposed great challenges to power system operation. To cope with the challenges, tremendous research work has been conducted, among which two aspects are of most importance ...
Bin Liu +5 more
doaj +1 more source
Rigid ball-polyhedra in Euclidean 3-space
, 2012 A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather natural way.
F Aurenhammer +12 more
core +1 more source
Klein polyhedra and lattices with positive norm minima [PDF]
, 2006 A Klein polyhedron is defined as the convex hull of nonzero lattice points inside an orthant of $\R^n$. It generalizes the concept of continued fraction.
German, Oleg N.
core +3 more sources
ReligionsMigration is a multidimensional process that reshapes identities and communities. This article adopts a polyhedral framework inspired by Pope Francis’s Laudato si’ and Michel Foucault’s concepts of “subjectivation” and the “polyhedron of intelligibility”.
Linda Koncz +2 more
doaj +1 more source
Refinement of the approximation of celestial bodies' gravitational field using polyhedra
Вісник Астрономічної школи, 2013 The polyhedral method is an effective computational approach to the approximation of the gravitational potential and attraction of an irregularly shaped body.
A. A. Tereshchenko +2 more
doaj +1 more source
New algorithm for calculating cycle intersection indices
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 Background. The objects of study are triangulated compact polyhedron P , which are n -dimensional manifolds with boundary. The goal is to create new efficient algorithms for calculating modulo 2 intersection indices. Materials and methods.
E.I. Yakovlev
doaj +1 more source
An infinitesimally nonrigid polyhedron with nonstationary volume in the Lobachevsky 3-space
, 2011 We give an example of an infinitesimally nonrigid polyhedron in the Lobachevsky 3-space and construct an infinitesimal flex of that polyhedron such that the volume of the polyhedron isn't stationary under the flex.Comment: 10 pages, 2 Postscript ...
A. D. Alexandrov +9 more
core +1 more source
Volume estimates for equiangular hyperbolic Coxeter polyhedra
, 2010 An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to \pi/n for some fixed integer n at least 2.
Agol +9 more
core +1 more source