Pages that link to "Item:Q3910036"
From MaRDI portal
The following pages link to A linear algorithm for computing the visibility polygon from a point (Q3910036):
Displaying 50 items.
- Planar lower envelope of monotone polygonal chains (Q495682) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Simulation of pedestrian route choice with local view: a potential field approach (Q823338) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- Towards a definition of higher order constrained Delaunay triangulations (Q1005329) (← 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)
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder (Q1099952) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← 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)
- Computing the link center of a simple polygon (Q1104086) (← links)
- On decomposing polygons into uniformly monotone parts (Q1108793) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- Computing bushy and thin triangulations (Q1190294) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach (Q1205702) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- Optimum placement of guards (Q1328566) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← 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)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- Solving visibility problems on MCCs of smaller size (Q2638829) (← links)
- An algorithm for generalized point location and its applications (Q2639635) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- GUARD PLACEMENT FOR MAXIMIZING <font>L</font>-VISIBILITY EXTERIOR TO A CONVEX POLYGON (Q3401891) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- On the correctness of a linear-time visibility polygon algorithm<sup>∗</sup> (Q4009735) (← links)
