DocumentCode :
1594198
Title :
Spherical Cubes and Rounding in High Dimensions
Author :
Kindler, Guy ; Donnell, Ryan O. ; Rao, Anup ; Wigderson, Avi
Author_Institution :
Weizmann Inst.
fYear :
2008
Firstpage :
189
Lastpage :
198
Abstract :
What is the least surface area of a shape that tiles Ropfd under translations by Zopfd? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, namely Omega(radicd). Our main result is a construction with surface area O(radicd), matching the lower bound up to a constant factor of 2radic2pi/eap3. The best previous tile known was only slightly better than the cube, having surface area on the order of d. We generalize this to give a construction that tiles Ropfd by translations of any full rank discrete lattice Lambda with surface area 2piparV-1parfb, where V is the matrix of basis vectors of Lambda, and par.parfb denotes the Frobenius norm. We show that our bounds are optimal within constant factors for rectangular lattices. Our proof is via a random tessellation process, following recent ideas of Raz in the discrete setting. Our construction gives an almost optimal noise-resistant rounding scheme to round points in Ropfd to rectangular lattice points.
Keywords :
computational geometry; lattice theory; Frobenius norm; full rank discrete lattice; least surface area; lower bound; random tessellation process; rectangular lattice; rounding; shape surface area; spherical cubes; Computer science; Concrete; Immune system; Lattices; Sampling methods; Shape; Tiles; Upper bound; Foams; Parallel Repetition; Rounding; Tiling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on
Conference_Location :
Philadelphia, PA
ISSN :
0272-5428
Print_ISBN :
978-0-7695-3436-7
Type :
conf
DOI :
10.1109/FOCS.2008.50
Filename :
4690953
Link To Document :
بازگشت