43 search results - page 2 / 9 » Combinatorial complexity in O-minimal geometry |
COCOA
2007
Springer
13 years 11 months ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
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...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...