Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.     

Synthesen von Heterocyclen, 130. Mitt.: Über das Glomerin und das Arborin

Zusammenfassung Es werden einstufige Synthesen desGlomerins (2) [1,2-Dimethyl-4(1H)-chinazolinon] und desArborins (3) [1-Methyl-2-benzyl-4(1H)-chinazolinon] bekanntgegeben.

---

Syntheses of heterocycles, CXXX: Glomerine and arborine

A one step synthesis ofglomerine (2) [1.2-dimethyl-4(1H)-quinazolinone] andarborine (3) [1-methyl-2-benzyl-4(1H)-quinazolinone] is described.