Log In Sign Up

Dual perspective method for solving the point in a polygon problem

by   Karim M. Ali, et al.

A novel method has been introduced to solve a point inclusion in a polygon problem. The method is applicable to convex as well as non-convex polygons which are not self-intersecting. The introduced method is independent of rounding off errors, which gives it a leverage over some methods prone to this problem. A brief summary of the methods used to solve this problem is presented and the introduced method is discussed. The introduced method is compared to other existing methods from the point of view of computational cost. This method was inspired from a Computational Fluid Dynamics (CFD) application using grids not fitted to the simulated objects.


Stochastic Constrained DRO with a Complexity Independent of Sample Size

Distributionally Robust Optimization (DRO), as a popular method to train...

The back-and-forth method for Wasserstein gradient flows

We present a method to efficiently compute Wasserstein gradient flows. O...

Asymptotic study of stochastic adaptive algorithm in non-convex landscape

This paper studies some asymptotic properties of adaptive algorithms wid...

The basins of attraction of the global minimizers of the non-convex sparse spikes estimation problem

The sparse spike estimation problem consists in estimating a number of o...

Going Further with Point Pair Features

Point Pair Features is a widely used method to detect 3D objects in poin...

Reputation blackboard systems

Blackboard systems are motivated by the popular view of task forces as b...