A linear time algorithm to remove winding of a simple polygon

DOI10.1016/J.COMGEO.2005.05.001zbMATH Open1088.65011OpenAlexW2088816968MaRDI QIDQ2489541FDOQ2489541

Authors: Binay Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer 

Publication date: 28 April 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.05.001

Recommendations

• Triangulating a simple polygon in linear time
• Finding the convex hull of a simple polygon in linear time
• Linear-time algorithms for weakly-monotone polygons
• Recognizing weakly simple polygons
• Finding the convex hull of a simple polygon

zbMATH Keywords

PruningRevolutionVisibility polygon

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Title not available (Why is that?)
• Corrections to Lee's visibility polygon algorithm
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Computing Visibility in the Plane
• Visibility of disjoint polygons
• Visibility of a simple polygon
• On the correctness of a linear-time visibility polygon algorithm^∗
• Sorting jordan sequences in linear time using level-linked search trees

This page was built for publication: A linear time algorithm to remove winding of a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489541)