On the correctness of a linear-time visibility polygon algorithm∗

DOI10.1080/00207169008803824MaRDI QIDQ4009735zbMATH OpenOpenAlexFDO

Authors Barry Joe

Publication date 27 September 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803824

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A linear algorithm for computing the visibility polygon from a point
• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
• An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
• Corrections to Lee's visibility polygon algorithm
• Decomposition of Polygons into Convex Sets
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangular meshes for regions of complicated shape
• Visibility of a simple polygon

Cited in

(4)

• Visibility and ray shooting queries in polygonal domains
• Parametric search: three new applications
• A linear time algorithm to remove winding of a simple polygon
• Computing the visibility polygon of an island in a polygonal domain

This page was built for publication: On the correctness of a linear-time visibility polygon algorithm^∗

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