期刊
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
卷 42, 期 1, 页码 81-89出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.comgeo.2008.03.003
关键词
Directional convexity; D-convexity; Separate convexity
A function f : R-d -> R is called D-convex, where D is a set of vectors in R-d, if its restriction to each line parallel to a nonzero v is an element of D is convex. The D-convex hull of a compact set A subset of Rd is the intersection of the zero sets of all nonnegative D-convex functions that are 0 on A. Matousek and Plechac provided an algorithm for computing the D-convex hull of a finite set in R-d for D consisting of d linearly independent vectors (in this case one speaks about separately convex hulls). Here we present a (polynomial-time) algorithm for the D-convex hull of a finite point set in the plane for arbitrary finite D. (c) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据