Cited By
View all- Nivasch G(2017)On the zone of a circle in an arrangement of linesDiscrete Mathematics10.1016/j.disc.2017.02.022340:7(1535-1552)Online publication date: 1-Jul-2017
Abstract
We consider an arrangement A of n hyperplanes in R d and the zone Z in A of the boundary of an arbitrary convex set in R d in such an arrangement. We show that, whereas the combinatorial complexity of Z is known only to be O ( n d - 1 log n ) 3], the outer part of the zone has complexity O ( n d - 1 ) (without the logarithmic factor). Whether this bound also holds for the complexity of the inner part of the zone is still an open question (even for d = 2 ).
References
[1]
P.K. Agarwal, M. Sharir, Davenport-Schinzel sequences and their geometric applications, in: Handbook of Computational Geometry, Elsevier Science B.V., North Holland, 1999, pp. 1-47.
[2]
P. Alevizos, J.D. Boissonnat, F.P. Preparata, An optimal algorithm for the boundary of a cell in a union of rays, Algorithmica, 5 (1990) 573-590.
[3]
B. Aronov, M. Pellegrini, M. Sharir, On the zone of a surface in a hyperplane arrangement, Discrete Comput. Geom., 9 (1993) 177-186.
[4]
H. Edelsbrunner, R. Seidel, M. Sharir, On the zone theorem for hyperplane arrangements, SIAM J. Comput., 22 (1993) 418-429.
[5]
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin/Heidelberg, 1987.
[6]
B. Grunbaum, Convex Polytopes, Wiley, New York, 1967.
[7]
P. Orlik, H. Terao, Arrangements of Hyperplanes, Springer-Verlag, Berlin/Heidelberg, 1992.
[8]
R. Pollack, M. Sharir, S. Sifrony, Separating two simple polygons by a sequence of translations, Discrete Comput. Geom., 3 (1988) 123-136.
[9]
M. Sharir, P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge/New York/Melbourne, 1995.
[10]
A. Wiernik, M. Sharir, Planar realizations of nonlinear Davenport-Schinzel sequences by segments, Discrete Comput. Geom., 3 (1988) 15-47.
Index Terms
- On the zone of the boundary of a convex body
Index terms have been assigned to the content through auto-classification.
Recommendations
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
A geometric approach to sample compression
The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for a quarter century. While maximum classes (concept classes meeting Sauer's Lemma with equality) can be compressed, the compression of general concept classes reduces to ...
A geometric approach to sample compression
The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for a quarter century. While maximum classes (concept classes meeting Sauer's Lemma with equality) can be compressed, the compression of general concept classes reduces to ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 May 2015
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Aug 2024
Other Metrics
Citations
Cited By
View all- Nivasch G(2017)On the zone of a circle in an arrangement of linesDiscrete Mathematics10.1016/j.disc.2017.02.022340:7(1535-1552)Online publication date: 1-Jul-2017
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in