Integral Boundary Points of Convex Polyhedra
نویسندگان
چکیده
منابع مشابه
Maximal Lattice-free Convex sets in 3 Dimensions
Given a lattice Λ, a lattice polyhedra is a convex polyhedra P , such that all vertices of P are lattice points and no other other point in P is a lattice point. By lattice-free convex set we mean a convex set with no lattice point from Λ in its strict interior. However lattice points are allowed on the boundary. We will usually work with the standard lattice in R3, i.e. points which have all t...
متن کاملBisubmodular polyhedra, simplicial divisions, and discrete convexity
We consider a class of integer-valued discrete convex functions, called BS-convex functions, defined on integer lattices whose affinity domains are sets of integral points of integral bisubmodular polyhedra. We examine discrete structures of BSconvex functions and give a characterization of BS-convex functions in terms of their convex conjugate functions by means of (discordant) Freudenthal sim...
متن کاملOptimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon
Given a convex polyhedron P and a convex polygon Q in ~3 such that Q's supporting plane does not intersect P, we are interested in tetrahedralizing the closure of the difference conve:c_hull(P U Q ) \ P; since P is convex, this difference is a connected nonconvex subset of T~ 3 which we call the region "between" P and Q. The problem is motivated by the work of Bern on tetrahedralizing the regio...
متن کاملThe Volume of a Lattice
In the area of automatic parallelization of programs, restructura-tion of nested loops or parallelization of systems of aane recurrence equations use classically a geometrical model based on convex polyhedra of lattices. Since these algorithms are speciied for parametric sized calculation domains, para-metric lattice polyhedra have to be considered. Computing on such domains is a grand challeng...
متن کاملNoname Manuscript-nr. the Volume of a Lattice Polyhedron to Enumerate Processors and Parallelism
In the area of automatic parallelization of programs, restructura-tion of nested loops or parallelization of systems of aane recurrence equations use classically a geometrical model based on convex polyhedra of lattices. Since these algorithms are speciied for parametric sized calculation domains, para-metric lattice polyhedra have to be considered. Computing on such domains is a grand challeng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010