Pages that link to "Item:Q1102120"
From MaRDI portal
The following pages link to Corrections to Lee's visibility polygon algorithm (Q1102120):
Displayed 19 items.
- 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)
- Parametric search: three new applications (Q2266831) (← 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)
- 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<sup>∗</sup> (Q4009735) (← links)
- GUARDING ART GALLERIES BY GUARDING WITNESSES (Q5470173) (← links)
- Computing accumulation density of particles on a line with parabolic trajectories. (Q5943347) (← links)