C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons.
Yu-Kumg Chen
Shuo-Yan Chou
Tzong-Chen Wu
Published in:
ICDCS Workshops (2001)
Keyphrases
</>
efficient method for computing
convex hull
minkowski sum
digital convexity
feasible solution
feasible set
input image
image processing
query optimization
region of interest
convex optimization
globally optimal
graph cuts
cell complexes
convex polyhedra