35 search results - page 2 / 7 » compgeom 2010 |
COMPGEOM
2010
ACM
13 years 8 months ago
2010
ACM
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
COMPGEOM
2010
ACM
13 years 9 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
2010
ACM
13 years 9 months ago
2010
ACM
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, ...