19 search results - page 2 / 4 » The Complexity of Proving the Discrete Jordan Curve Theorem |
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
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. T...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
COLT
2004
Springer
13 years 11 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....