Highly Influenced

- Published 2011 in Symposium on Computational Geometry
DOI:10.1145/1998196.1998258

Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. To apply them one typically transcribes an algorithm execution or geometric object as a sequence over some alphabet or a 0-1 matrix, proves that this object avoids some subsequence… (More)

### Presentations referencing similar topics