LR-visibility in polygons (Q676582)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	LR-visibility in polygons	scientific article

Statements

scholarly article

0 references

LR-visibility in polygons (English)

0 references

Paul J. Heffernan

0 references

Giri Narasimhan

0 references

0 references

Computational Geometry

0 references

publication date

4 September 1997

0 references

zbMATH Keywords

polygonal visibility

0 references

weak visibility

0 references

LR-visibility

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0925-7721(95)00042-9

0 references

Triangulating a simple polygon in linear time

0 references

Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

0 references

Visibility and intersection problems in plane geometry

0 references

An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment

0 references

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

0 references

THE TWO GUARDS PROBLEM

0 references

An Optimal Algorithm for Finding the Kernel of a Polygon

0 references

Convex hulls of finite sets of points in two and three dimensions

0 references

An optimal algorithm for detecting weak visibility of a polygon

0 references

Two-Guard Walkability of Simple Polygons

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0925-7721(95)00042-9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:676582

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q676582&oldid=34178126"