36 search results - page 8 / 8 » Polynomial Time Parsing of Combinatory Categorial Grammars |
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...