An improved judgement algorithm of point in-out convex polygons

01/27/2022
by   Sun Yixuan, et al.
0

This paper proposed a method to judge whether the point is inside or outside of the simple convex polygon by the intersection of the vertical line. It determined the point to an area enclosed by two straight lines, then convert the problem of determining whether a point is inside or outside of a convex polygon into the problem of determining whether a point is inside or outside of a quadrilateral. After that, use the ray method to judge it. The complexity of this algorithm is O(1) to O(n). As the experimental results show, the algorithm has fewer intersections and greatly improves the efficiency of the judgment.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2023

On Maximizing the Distance to a Given Point over an Intersection of Balls II

In this paper the problem of maximizing the distance to a given fixed po...
research
04/19/2014

Geometric Abstraction from Noisy Image-Based 3D Reconstructions

Creating geometric abstracted models from image-based scene reconstructi...
research
07/08/2018

Online exploration outside a convex obstacle

A watchman route is a path such that a direct line of sight exists betwe...
research
10/04/2010

Inaccessibility-Inside Theorem for Point in Polygon

The manuscript presents a theoretical proof in conglomeration with new d...
research
08/06/2022

Pitching strategy evaluation via stratified analysis using propensity score

Recent measurement technologies enable us to analyze baseball at higher ...
research
04/03/2019

Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoders

We introduce deep inside-outside recursive autoencoders (DIORA), a fully...
research
04/16/2019

One-adhesive polymatroids

Adhesive polymatroids were defined by F. Matúš motivated by entropy func...

Please sign up or login with your details

Forgot password? Click here to reset