A note on the combinatorial structure of the visibility graph in simple polygons
From MaRDI portal
(Redirected from Publication:673765)
Recommendations
Cites work
- scientific article; zbMATH DE number 4149525 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A linear algorithm for computing the visibility polygon from a point
- A note on the combinatorial structure of the visibility graph in simple polygons
- A unified approach to visibility representations of planar graphs
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An optimal visibility graph algorithm for triangulated simple polygons
- On recognizing and characterizing visibility graphs of simple polygons
- Shape from probing
- Visibility and intersection problems in plane geometry
Cited in
(6)- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- New Results on Visibility in Simple Polygons
- A P-Completeness Result for Visibility Graphs of Simple Polygons
- Performance bounds for planning in unknown terrain
- A note on the combinatorial structure of the visibility graph in simple polygons
This page was built for publication: A note on the combinatorial structure of the visibility graph in simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673765)