Name
Abstract | ||
|---|---|---|
A (not necessarily convex) object C in the plane is kappa-curved for some constant 0 < kappa < 1, if it has constant description complexity, and for each point p on the boundary of C, one can place a disk B subset of or equal to C of radius kappa . diam(C) whose boundary passes through p. We prove that the combinatorial complexity of the boundary of the union of a set C of n kappa-curved objects (e.g., fat ellipses or rounded heart-shaped objects) is O(lambda(s) (n) log n), for some constant s. (C) 1999 Elsevier Science B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0925-7721(99)00036-X | Symposium on Computational Geometry 2013 |
Keywords | DocType | Volume |
k-curved object | Journal | 14 |
Issue | ISSN | Citations |
4 | 0925-7721 | 12 |
PageRank | References | Authors |
0.69 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alon Efrat | 1 | 1312 | 93.92 |
| Matthew J. Katz | 2 | 225 | 19.92 |