Pages that link to "Item:Q1102120"

The following pages link to Corrections to Lee's visibility polygon algorithm (Q1102120):

Displaying 43 items.

• Computing a visibility polygon using few variables (Q396475) (← links)
• Space-time trade-offs for stack-based algorithms (Q494797) (← links)
• Planar lower envelope of monotone polygonal chains (Q495682) (← links)
• Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
• A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
• An upper bound for conforming Delaunay triangulations (Q685182) (← links)
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
• Corrections to Lee's visibility polygon algorithm (Q1102120) (← links)
• Minimum-link paths among obstacles in the plane (Q1201747) (← links)
• Recognizing weakly convex visible polygons (Q1392848) (← links)
• Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines (Q1765056) (← 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)
• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← 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 constrained shortest paths in simple polygons (Q2465622) (← links)
• A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
• On circularly-hidden surface removal. (Q2583547) (← links)
• On Voronoi visibility maps of 1.5D terrains with multiple viewpoints (Q2681407) (← links)
• How to Draw a Planarization (Q2971142) (← links)
• Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
• Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
• LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
• Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (Q3575388) (← links)
• On the correctness of a linear-time visibility polygon algorithm^∗ (Q4009735) (← links)
• An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
• Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
• Triangle-Based Heuristics for Area Optimal Polygonizations (Q5102078) (← links)
• Routing in Polygonal Domains (Q5136225) (← links)
• Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
• How to Draw a Planarization (Q5233140) (← links)
• TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS (Q5261016) (← links)
• GUARDING ART GALLERIES BY GUARDING WITNESSES (Q5470173) (← links)
• Computing accumulation density of particles on a line with parabolic trajectories. (Q5943347) (← links)
• The influence of nucleus mechanics in modelling adhesion-independent cell migration in structured and confined environments (Q6049023) (← links)
• A faster algorithm for the constrained minimum covering circle problem to expedite solving <i>p</i>‐center problems in an irregularly shaped area with holes (Q6053130) (← links)