Abstract.
Let D be a set of vectors in R d . A function f: R d → R is called D-convex if its restriction to each line parallel to a nonzero vector of D is a convex function. For a set A⊆ R d , the functional D-convex hull of A, denoted by coD (A) , is the intersection of the zero sets of all nonnegative D -convex functions that are 0 on A .
We prove some results concerning the structure of functional D -convex hulls, e.g., a Krein—Milman-type theorem and a result on separation of connected components.
We give a polynomial-time algorithm for computing coD (A) for a finite point set A (in any fixed dimension) in the case of D being a basis of R d (the case of separate convexity).
This research is primarily motivated by questions concerning the so-called rank-one convexity, which is a particular case of D -convexity and is important in the theory of systems of nonlinear partial differential equations and in mathematical modeling of microstructures in solids. As a direct contribution to the study of rank-one convexity, we construct a configuration of 20 symmetric 2 x 2 matrices in a general (stable) position with a nontrivial functionally rank-one convex hull (answering a question of K. Zhang on the existence of higher-dimensional nontrivial configurations of points and matrices).
Article PDF
Author information
Authors and Affiliations
Additional information
Received October 3, 1995, and in revised form June 24, 1996.
Rights and permissions
About this article
Cite this article
Matoušek, J., Plecháč, P. On Functional Separately Convex Hulls . Discrete Comput Geom 19, 105–130 (1998). https://doi.org/10.1007/PL00009331
Issue Date:
DOI: https://doi.org/10.1007/PL00009331