40 search results - page 1 / 8 » On the perimeter of fat objects |
COMGEO
2011
ACM
12 years 11 months ago
2011
ACM
In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Specifically, for an (α, β)-covered object O, per(O) ≤ c...
CCCG
2010
13 years 5 months ago
2010
We show that the size of the perimeter of (, )-covered objects is a linear function of the diameter. Specifically, for an (, )-covered object O, per(O) c diam(O) sin2 , for a pos...
WADS
1997
Springer
13 years 8 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
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...
ALGORITHMICA
2000
13 years 4 months ago
2000
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...