The following pages link to Visibility of a simple polygon (Q3315016):
Displaying 46 items.
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- Corrections to Lee's visibility polygon algorithm (Q1102120) (← links)
- Solving visibility and separability problems on a mesh-of-processors (Q1104081) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach (Q1205702) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- An approximate algorithm for the minimal vertex nested polygon problem (Q1812727) (← links)
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Visibility extension via mirror-edges to cover invisible segments (Q2272374) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- Multiple point visibility and related problems (Q2710754) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments (Q2980897) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- On the correctness of a linear-time visibility polygon algorithm<sup>∗</sup> (Q4009735) (← links)
- TOWARDS WEB-BASED COMPUTING (Q4682178) (← links)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- The influence of nucleus mechanics in modelling adhesion-independent cell migration in structured and confined environments (Q6049023) (← links)
