## Decision Trees For Geometric Models (1993)

Citations: | 32 - 4 self |

### BibTeX

@MISC{Arkin93decisiontrees,

author = {Esther M. Arkin and Henk Meijer and Joseph S. B. Mitchell and David Rappaport and Steven S. Skiena},

title = {Decision Trees For Geometric Models},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### Abstract

A fundamental problem in model-based computer vision is that of identifying which of a given set of geometric models is present in an image. Considering a "probe" to be an oracle that tells us whether or not a model is present at a given point, we study the problem of computing efficient strategies ("decision trees") for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine which single model is present. We show that a dlg ke height binary decision tree always exists for k polygonal models (in fixed position), provided (1) they are non-degenerate (do not share boundaries) and (2) they share a common point of intersection. Further, we give an efficient algorithm for constructing such decision tress when the models are given as a set of polygons in the plane. We show that constructing a minimum height tree is NP-complete if either of the two assumptions is omitted. We provide an efficient greedy heuristic strategy and show ...