scientific article; zbMATH DE number 1424307
From MaRDI portal
Publication:4945520
Recommendations
- Visibility between two edges of a simple polygon
- scientific article; zbMATH DE number 1182918
- Visibility Algorithms in the Plane
- Computing the visibility graph of points within a polygon
- Visibility and ray shooting queries in polygonal domains
- On recognizing and characterizing visibility graphs of simple polygons
- Shortest path solves edge-to-edge visibility in a polygon
- An optimal visibility graph algorithm for triangulated simple polygons
- Unsolved problems in visibility graphs of points, segments, and polygons
- Visibility and Ray Shooting Queries in Polygonal Domains
Cited in
(27)- Segment endpoint visibility graphs are Hamiltonian
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- Compatible spanning trees
- Computing the maximum clique in the visibility graph of a simple polygon
- Visibility maps of segments and triangles in 3D
- A linear time algorithm to remove winding of a simple polygon
- Diffuse reflection diameter in simple polygons
- A new upper bound for the VC-dimension of visibility regions
- Computing a visibility polygon using few variables
- An improved algorithm for reconstructing a simple polygon from its visibility angles
- Watchman tours for polygons with holes
- Point-set embeddings of plane 3-trees
- scientific article; zbMATH DE number 1182918 (Why is no real title available?)
- Reconstructing generalized staircase polygons with uniform step length
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER
- PLANAR STRONG VISIBILITY
- Reconstructing generalized staircase polygons with uniform step length
- Visibility Algorithms in the Plane
- Characterizing LR-visibility polygons and related problems
- Long non-crossing configurations in the plane
- New variants of perfect non-crossing matchings
- A note on the combinatorial structure of the visibility graph in simple polygons
- Searching in the plane
- Computing pseudotriangulations via branched coverings
- New variants of perfect non-crossing matchings
- The embracing Voronoi diagram and closest embracing number
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945520)
