Derivation of an Algorithm for Calculation of the Intersection Area of a Circle with a Grid with Finite Fill Factor

12/16/2018
by   Dmitrij Gendler, et al.
0

The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the intersection area of the circle and the squares of the grid. We analyze the geometry of the problem and derive an algorithm for the exact computation of the intersection areas. The results of the analysis are summarized in the tally sheet. In a real world example this might be a CCD or CMOS chip, or the tile structure of a floor.

READ FULL TEXT
research
04/08/2019

A note on Cunningham's algorithm for matroid intersection

In the matroid intersection problem, we are given two matroids of rank r...
research
09/27/2022

Semigroup intersection problems in the Heisenberg groups

We consider two algorithmic problems concerning sub-semigroups of Heisen...
research
05/25/2020

Stratified Formal Deformations and Intersection Homology of Data Point Clouds

Intersection homology is a topological invariant which detects finer inf...
research
11/18/2021

On the Recoverable Traveling Salesman Problem

In this paper we consider the Recoverable Traveling Salesman Problem (TS...
research
06/19/2017

Combinatorial Properties and Recognition of Unit Square Visibility Graphs

Unit square (grid) visibility graphs (USV and USGV, resp.) are described...
research
02/08/2021

Semi-Streaming Algorithms for Submodular Matroid Intersection

While the basic greedy algorithm gives a semi-streaming algorithm with a...
research
12/27/2018

The Wynn identity as the long sought criterion for the choice of the optimal Padé approximant

The performed numerical analysis reveals that Wynn's identity for the co...

Please sign up or login with your details

Forgot password? Click here to reset