Pages that link to "Item:Q910213"
From MaRDI portal
The following pages link to Visibility and intersection problems in plane geometry (Q910213):
Displaying 50 items.
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Shortcut sets for plane Euclidean networks (extended abstract) (Q510569) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- LR-visibility in polygons (Q676582) (← links)
- On the minimality of polygon triangulation (Q751276) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Non-Euclidean visibility problems (Q998215) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Special subgraphs of weighted visibility graphs (Q1199937) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- An improved technique for output-sensitive hidden surface removal (Q1322562) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Distance measures on intersecting objects and their applications (Q1334639) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Computing simple paths from given points inside a polygon (Q1630775) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- A unifying approach for a class of problems in the computational geometry of polygons (Q1822499) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Generalized hidden surface removal (Q1917036) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)