A linear-time algorithm for solving the strong hidden-line problem in a simple polygon

Authors:
G T Toussaint
Affiliations:
-
Venue:
Pattern Recognition Letters
Year:
1986

Citing 0
Cited 4

Structured visibility profiles with applications to problems in simple polygons (extended abstract)

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An optimal parallel algorithm for detecting weak visibility of a simple polygon

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Randomized Algorithms for Minimum Distance Localization

International Journal of Robotics Research
On polyhedra induced by point sets in space

Discrete Applied Mathematics

Quantified Score

Hi-index	0.10

Visualization

Abstract