Pages that link to "Item:Q910213"

The following pages link to Visibility and intersection problems in plane geometry (Q910213):

Displaying 37 items.

• Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
• Weak visibility counting in simple polygons (Q2351072) (← links)
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
• Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
• Optimum sweeps of simple polygons with two guards (Q2445401) (← links)
• Minimization of the maximum distance between the two guards patrolling a polygonal region (Q2445875) (← links)
• Query point visibility computation in polygons with holes (Q2462733) (← links)
• A unified and efficient solution to the room search problem (Q2479474) (← links)
• Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
• An algorithm for generalized point location and its applications (Q2639635) (← links)
• Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
• Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
• PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS (Q3173480) (← links)
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
• FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← links)
• Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
• Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
• Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554) (← links)
• OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS (Q4818564) (← links)
• Graphics in flatland revisited (Q5056094) (← links)
• The visibility diagram: A data structure for visibility problems and motion planning (Q5056095) (← links)
• Upper envelope onion peeling (Q5056118) (← links)
• Intersection queries in sets of disks (Q5056120) (← links)
• Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
• Computing depth orders and related problems (Q5056161) (← links)
• Computing common tangents without a separating line (Q5057432) (← links)
• An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
• Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
• (Q5302815) (← links)
• Processing an Offline Insertion-Query Sequence with Applications (Q5321704) (← links)
• Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
• Polygons cuttable by a circular saw (Q5952972) (← links)
• Guarding a terrain by two watchtowers (Q5961974) (← links)
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
• Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)