Approximation of Discs by Octagons on Pixel-Plane via Jaccards Proximity Criterion: Theoretical Approach and Experimental Results Analysis

11/05/2022
by   Irakli Dochviri, et al.
0

In the present paper we study approximation of discs by octagons on the pixel plane. To decide which octagon approximates better the given disc we use Jaccard's distance. The table of Jaccard's distances (calculated by a software created for these purposes) are presented at the end of the paper. The results for proximity are given in the form of a graph. Some properties of considered octagons are also studied

READ FULL TEXT

page 8

page 11

page 14

page 21

page 23

page 24

page 28

page 30

research
12/03/2020

Saturated k-Plane Drawings with Few Edges

A drawing of a graph is k-plane if no edge is crossed more than k times....
research
10/01/2018

On the density of sets of the Euclidean plane avoiding distance 1

A subset A ⊂ R^2 is said to avoid distance 1 if: ∀ x,y ∈ A, x-y _2 ≠ 1....
research
01/16/2018

Plane-Casting: 3D Cursor Control with a SmartPhone

We present Plane-Casting, a novel technique for 3D object manipulation f...
research
07/27/2023

The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs

We study the reverse shortest path problem on disk graphs in the plane. ...
research
06/14/2019

A local characterization for perfect plane near-triangulations

We derive a local criterion for a plane near-triangulated graph to be pe...
research
09/19/2023

Empirical Study of Ground Proximity Effects for Small-scale Electroaerodynamic Thrusters

Electroaerodynamic (EAD) propulsion, where thrust is produced by collisi...
research
06/20/2021

Solving for best linear approximates

Our goal is to finally settle a persistent problem in Diophantine Approx...

Please sign up or login with your details

Forgot password? Click here to reset