A Distance Function for Comparing Straight-Edge Geometric Figures

11/25/2016
by   Apoorva Honnegowda Roopa, et al.
0

This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of geometric figures that are graphically isomorphic, one function measures the angular dissimilarity and another function measures the edge length disproportionality. The distance function is then defined as the convex sum of these two functions. The novelty of the presented function is that it satisfies all properties of a distance function and the computation of the same is done by projecting appropriate features to a cartesian plane. To compute the deviation from the angular similarity property, the Euclidean distance between the given angular pairs and the corresponding points on the y=x line is measured. Further while computing the deviation from the edge length proportionality property, the best fit line, for the set of edge lengths, which passes through the origin is found, and the Euclidean distance between the given edge length pairs and the corresponding point on a y=mx line is calculated. Iterative Proportional Fitting Procedure (IPFP) is used to find this best fit line. We demonstrate the behavior of the defined function for some sample pairs of figures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2018

Plane and Planarity Thresholds for Random Geometric Graphs

A random geometric graph, G(n,r), is formed by choosing n points indepen...
research
06/20/2017

The well-separated pair decomposition for balls

Given a real number t>1, a geometric t-spanner is a geometric graph for ...
research
09/15/2021

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane

Given two sets S and T of points in the plane, of total size n, a many-t...
research
09/13/2019

Linear Size Planar Manhattan Network for Convex Point Sets

Let G = (V, E) be an edge-weighted geometric graph such that every edge ...
research
12/24/2018

Near-Optimal O(k)-Robust Geometric Spanners

For any constants d> 1, ϵ >0, t>1, and any n-point set P⊂R^d, we show th...
research
04/17/2023

On taxicab distance mean functions and their geometric applications: methods, implementations and examples

A distance mean function measures the average distance of points from th...
research
11/20/2020

Escherization with Generalized Distance Functions Focusing on Local Structural Similarity

The Escherization problem involves finding a closed figure that tiles th...

Please sign up or login with your details

Forgot password? Click here to reset