Adjacency properties of extreme points of a convex polyhedron are discussed. In mathematical programming we are quite often faced with problems of characterizing the ...
Abstract: This paper presents an algorithm to determine whether a point-set composed of n-points is in the polyhedron or not-which is called the convex hull method. With this method, it is not ...
PPLite is an open-source C++ library implementing the abstract domain of convex polyhedra, to be used in tools for static analysis and verification. Note: this public repository also collects previous ...
POINTWISE ERROR ESTIMATES OF FINITE ELEMENT APPROXIMATIONS TO THE STOKES PROBLEM ON CONVEX POLYHEDRA
The aim of the paper is to show the stability of the finite element solution for the Stokes system in ${\mathrm{W}}_{\mathrm{\infty }}^{1}$ norm on general convex polyhedral domain. In contrast to ...
aspect_ratio: threshold value for ratio of the incribed circle to the outscribed circle of any face on the polyhedra. If any face has a value below the threshold the polyhedra is discarded ...
This media is in the public domain (free of copyright restrictions). You can copy, modify, and distribute this work without contacting the Smithsonian. For more information, visit the Smithsonian's ...
The work of the Greek polymath Plato has kept millions of people busy for millennia. A few among them have been mathematicians who have obsessed about Platonic solids, a class of geometric forms that ...
Ancient Greek mathematicians – most notably Plato - classified solid shapes thousands of years ago. Since then, remarkably few geometric ‘solid’ forms have been discovered and the last collection was ...
Thurston gave a concrete procedure to construct triangulations of the 2-sphere where 5 or 6 triangles meet at each vertex. How can you get the icosahedron using this procedure? Gerard Westendorp has a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results