VISUALIZATION
2003
IEEE
13 years 9 months ago
2003
IEEE
There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standa...
STOC
2007
ACM
14 years 4 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...