skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Computer simulations for the effectiveness of CT image reconstruction using hexagonal grids versus the usual square grids with the same sampling rate
Award ID(s):
2000158
PAR ID:
10594773
Author(s) / Creator(s):
Publisher / Repository:
ACM
Date Published:
ISBN:
9798400717499
Page Range / eLocation ID:
98 to 103
Format(s):
Medium: X
Location:
Hong Kong Shaanxi Hong Kong
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Adjacent dyadic systems are pivotal in analysis and related fields to study continuous objects via collections of dyadic ones. In our prior work (joint with Jiang, Olson, and Wei), we describe precise necessary and sufficient conditions for two dyadic systems on the real line to be adjacent. Here, we extend this work to all dimensions, which turns out to have many surprising difficulties due to the fact that $d+1$ , not $2^d$ , grids is the optimal number in an adjacent dyadic system in $$\mathbb {R}^d$$ . As a byproduct, we show that a collection of $d+1$ dyadic systems in $$\mathbb {R}^d$$ is adjacent if and only if the projection of any two of them onto any coordinate axis are adjacent on $$\mathbb {R}$$ . The underlying geometric structures that arise in this higher-dimensional generalization are interesting objects themselves, ripe for future study; these lead us to a compact, geometric description of our main result. We describe these structures, along with what adjacent dyadic (and n -adic, for any n ) systems look like, from a variety of contexts, relating them to previous work, as well as illustrating a specific exa. 
    more » « less
  2. Abstract We show that the size-Ramsey number of the$$\sqrt{n} \times \sqrt{n}$$grid graph is$$O(n^{5/4})$$, improving a previous bound of$$n^{3/2 + o(1)}$$by Clemens, Miralaei, Reding, Schacht, and Taraz. 
    more » « less
  3. null (Ed.)