Login / Signup
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.
Ondrej Sýkora
Imrich Vrto
Published in:
STACS (1984)
Keyphrases
</>
upper bound
piecewise linear
convex hull
optimal solution
multiresolution
convex constraints
tree structure
tree traversal
semi infinite programming
binary search trees
spanning tree
worst case
dynamic programming
region of interest
closed form
globally optimal
tree structures
np hard
data structure
feature selection