Inaccessibility-Inside Theorem for Point in Polygon

10/04/2010
by   Shriprakash Sinha, et al.
0

The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of solving the point in polygon problem by employing the properties of epigraphs and hypographs, explicitly. Contrary to the ambiguous solutions given by the cross over for the simple and self intersecting polygons and the solution of a point being multiply inside a self intersecting polygon given by the winding number rule, the current solution gives unambiguous and singular result for both kinds of polygons. Finally, the current theoretical solution proves to be mathematically correct for simple and self intersecting polygons.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2020

A simple proof for visibility paths in simple polygons

The purpose of this note is to give a simple proof for a necessary and s...
research
08/10/2021

Tutorial on the Robust Interior Point Method

We give a short, self-contained proof of the interior point method and i...
research
01/27/2022

An improved judgement algorithm of point in-out convex polygons

This paper proposed a method to judge whether the point is inside or out...
research
12/02/2021

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery

Given a simple polygon P, in the Art Gallery problem the goal is to find...
research
11/27/2017

Probabilistic solution of Yao's millionaires' problem

We offer a probabilistic solution of Yao's millionaires' problem that gi...
research
09/21/2022

Downward Self-Reducibility in TFNP

A problem is downward self-reducible if it can be solved efficiently giv...

Please sign up or login with your details

Forgot password? Click here to reset