Pages that link to "Item:Q4837542"

The following pages link to A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk (Q4837542):

Displaying 46 items.

• Optimal partition trees (Q420575) (← links)
• A faster algorithm for computing motorcycle graphs (Q471142) (← links)
• Binary plane partitions for disjoint line segments (Q540437) (← links)
• Stabbers of line segments in the plane (Q543793) (← links)
• The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
• Diffuse reflection radius in a simple polygon (Q727965) (← links)
• Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
• Visibility queries in a polygonal region (Q833709) (← links)
• Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
• Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
• Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
• Convex subdivisions with low stabbing numbers (Q1046805) (← links)
• Dynamic motion planning in low obstacle density environments (Q1276943) (← links)
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
• Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
• Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
• Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
• Covering a simple polygon by monotone directions (Q2269836) (← links)
• Quickest visibility queries in polygonal domains (Q2316797) (← links)
• On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
• Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
• Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
• Median trajectories (Q2375955) (← links)
• Minimum weight pseudo-triangulations (Q2385693) (← links)
• Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
• Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
• Watchman routes for lines and line segments (Q2445196) (← links)
• Minimum-link paths revisited (Q2450201) (← links)
• Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
• Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT (Q4818547) (← links)
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS (Q4949991) (← links)
• Adaptive Planar Point Location (Q5009786) (← links)
• Dynamic motion planning in low obstacle density environments (Q5096921) (← links)
• A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
• On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
• Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← links)
• PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING (Q5386745) (← links)
• Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)
• GUARDING ART GALLERIES BY GUARDING WITNESSES (Q5470173) (← links)
• Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
• Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
• Finding the shortest boundary guard of a simple polygon (Q5941506) (← links)
• Polygons cuttable by a circular saw (Q5952972) (← links)
• How to cut corners and get bounded convex curvature (Q6045790) (← links)