A linear time algorithm to remove winding of a simple polygon

Authors:
Binay Kumar Bhattacharya;Subir Kumar Ghosh;Thomas Caton Shermer
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC Canada V5A 1S6;School of Computer Science, Tata Institute of Fundamental Research, Mumbai 400005, India;School of Computing Science, Simon Fraser University, Burnaby, BC Canada V5A 1S6
Venue:
Computational Geometry: Theory and Applications
Year:
2006

Citing 5
Cited 0

Visibility of disjoint polygons

Algorithmica
Sorting Jordan sequences in linear time using level-linked search trees

Information and Control
Worst-case optimal algorithms for constructing visibility polygons with holes

SCG '86 Proceedings of the second annual symposium on Computational geometry
Corrections to Lee's visibility polygon algorithm

BIT
An Optimal Algorithm for Computing Visibility in the Plane

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a linear time algorithm to remove winding of a simple polygon P with respect to a given point q inside P. The algorithm removes winding by locating a subset of Jordan sequence that is in the proper order and uses only one stack.