Point in polygon

Computational Geometry in C

Joseph O’Rourke

Citations: 842 • 1998

An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

Avis, Toussaint

Citations: 167 • 1981

Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots

Stephen L. Smith, Mireille E. Broucke, Bruce A. Francis

Citations: 61 • 2007

Monitoring environmental boundaries with a robotic sensor network

Sara Susca, Sonia Martı́nez, Francesco Bullo

Citations: 61 • 2006

Competitive searching in a generalized street

Amitava Datta, Christian Icking

Citations: 42 • 1994

Computational Complexity of Motion and Stability of Polygons

Richard S. Palmer

Citations: 40 • 1987

The robot localization problem in two dimensions

Leonidas Guibas, Rajeev Motwani, Prabhakar Raghavan

Citations: 39 • 1992

Decomposition Algorithms in Geometry

Bernard Chazelle, Leonidas Palios

Citations: 36 • 1994

Autonomous mobile robot global motion planning and geometric beacon collection using traversability vectors

J.A. Janet, R.C. Luo, Michael G. Kay

Citations: 36 • 1997

An Extension to Winding Number and Point-in-Polygon Algorithm

G. Naresh Kumar, Mallikarjun Bangi

Citations: 33 • 2018

Competitive searching in polygons—Beyond generalised streets

Amitava Datta, Christoph A. Hipke, Sven Schuierer

Citations: 33 • 1995

A competitive strategy for learning a polygon

Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel

Citations: 29 • 1997

An improved method for calculating the no-fit polygon

Hamish T. Dean, Yiliu Tu, John F. Raffensperger

Citations: 27 • 2005

Computing some distance functions between polygons

Mikhail J. Atallah, Celso C. Ribeiro, Sérgio Lifschitz

Citations: 26 • 1991

Generalized streets revisited

Alejandro López-Ortíz, Sven Schuierer

Citations: 25 • 1996

On covering orthogonal polygons with star-shaped polygons

Laxmi Gewali, Mark Keil, Simeon Ntafos

Citations: 18 • 1992

Constant-Time Convexity Problems on Reconfigurable Meshes

V. Bokka, H. Gurla, Stephan Olariu, J.L. Schwing

Citations: 15 • 1995

On finding an empty staircase polygon of largest area (width) in a planar point-set

Subhas C. Nandy, Bhargab B. Bhattacharya

Citations: 14 • 2003

Polygon exploration with time-discrete vision

Sándor P. Fekete, Christiane Schmidt

Citations: 13 • 2009

Gradient algorithms for polygonal approximation of convex contours

Sara Susca, Francesco Bullo, Sonia Martı́nez

Citations: 7 • 2009