Pages that link to "Item:Q3137709"

The following pages link to Ray Shooting and Parametric Search (Q3137709):

Displaying 35 items.

• A faster algorithm for computing motorcycle graphs (Q471142) (← links)
• Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
• Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
• Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
• Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
• Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
• Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra (Q1196293) (← links)
• Applications of a new space-partitioning technique (Q1196362) (← links)
• Efficient partition trees (Q1199132) (← links)
• Efficient hidden surface removal for objects with small union size (Q1208434) (← links)
• On range searching with semialgebraic sets (Q1329188) (← links)
• Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
• Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
• Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
• Dynamic half-space range reporting and its applications (Q1891228) (← links)
• Vertical decompositions for triangles in 3-space (Q1907609) (← links)
• Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
• Computing the visibility map of fat objects (Q2269142) (← links)
• Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
• OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM (Q2708039) (← links)
• PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS (Q3173480) (← links)
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
• An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
• THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL (Q4513239) (← links)
• Approximate Polytope Membership Queries (Q4600697) (← links)
• Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
• Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)
• On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
• Processing an Offline Insertion-Query Sequence with Applications (Q5321704) (← links)
• POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA (Q5470166) (← links)
• Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
• Linear approximation of simple objects (Q5890660) (← links)
• Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
• Maximum matchings in geometric intersection graphs (Q6050213) (← links)