Laplace's equation on convex polyhedra via the unified method
نویسندگان
چکیده
منابع مشابه
Laplace's equation on convex polyhedra via the unified method.
We provide a new method to study the classical Dirichlet problem for Laplace's equation on a convex polyhedron. This new approach was motivated by Fokas' unified method for boundary value problems. The central object in this approach is the global relation: an integral equation which couples the known boundary data and the unknown boundary values. This integral equation depends holomorphically ...
متن کاملA Finite Element Method on Convex Polyhedra
We present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced 3D mean value coordinates to define smooth interpolants within the elements. The mathematical properties of our basis functions guarantee convergence. Our method is a natural extension to linear interpolants on tetrahedr...
متن کاملUnfolding Convex Polyhedra via Quasigeodesics
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds the surface to a planar simple polygon.
متن کاملA Formalization of Convex Polyhedra Based on the Simplex Method
We present a formalization of convex polyhedra in the proof assistant Coq. The cornerstone of our work is a complete implementation of the simplex method, together with the proof of its correctness and termination. This allows us to define the basic predicates over polyhedra in an effective way (i.e. as programs), and relate them with the corresponding usual logical counterparts. To this end, w...
متن کاملStar Unfolding Convex Polyhedra via Quasigeodesic Loops
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2015
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2014.0884