On the zone of the boundary of a convex body

Orit E. Raz

doi:10.1016/j.comgeo.2014.12.001

On the zone of the boundary of a convex body

Orit E. Raz^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

We consider an arrangement A of n hyperplanes in ℝ^d and the zone Z in A of the boundary of an arbitrary convex set in Rd 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).

Original language	English
Pages (from-to)	333-341
Number of pages	9
Journal	Computational Geometry: Theory and Applications
Volume	48
Issue number	4
DOIs	https://doi.org/10.1016/j.comgeo.2014.12.001
State	Published - May 2015
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2014, Elsevier B.V. All rights reserved.

Keywords

Hyperplane arrangements
Zone theorem

Access to Document

10.1016/j.comgeo.2014.12.001

Cite this

@article{ede1a788a8eb49bfabd150d93c36adc9,

title = "On the zone of the boundary of a convex body",

abstract = "We consider an arrangement A of n hyperplanes in ℝd and the zone Z in A of the boundary of an arbitrary convex set in Rd in such an arrangement. We show that, whereas the combinatorial complexity of Z is known only to be O(nd-1 log n) [3], the outer part of the zone has complexity O(nd-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).",

keywords = "Hyperplane arrangements, Zone theorem",

author = "Raz, {Orit E.}",

year = "2015",

month = may,

doi = "10.1016/j.comgeo.2014.12.001",

language = "אנגלית",

volume = "48",

pages = "333--341",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - On the zone of the boundary of a convex body

AU - Raz, Orit E.

PY - 2015/5

Y1 - 2015/5

N2 - We consider an arrangement A of n hyperplanes in ℝd and the zone Z in A of the boundary of an arbitrary convex set in Rd in such an arrangement. We show that, whereas the combinatorial complexity of Z is known only to be O(nd-1 log n) [3], the outer part of the zone has complexity O(nd-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).

AB - We consider an arrangement A of n hyperplanes in ℝd and the zone Z in A of the boundary of an arbitrary convex set in Rd in such an arrangement. We show that, whereas the combinatorial complexity of Z is known only to be O(nd-1 log n) [3], the outer part of the zone has complexity O(nd-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).

KW - Hyperplane arrangements

KW - Zone theorem

UR - http://www.scopus.com/inward/record.url?scp=84919914107&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2014.12.001

DO - 10.1016/j.comgeo.2014.12.001

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84919914107

SN - 0925-7721

VL - 48

SP - 333

EP - 341

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

IS - 4

ER -

On the zone of the boundary of a convex body

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this