Pages that link to "Item:Q4302817"

The following pages link to An optimal algorithm for intersecting line segments in the plane (Q4302817):

Displaying 39 items.

• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← links)
• Line-segment intersection made in-place (Q2385700) (← links)
• Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
• Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
• The touring rays and related problems (Q2662682) (← links)
• Combinatorics of intervals in the plane. I: Trapezoids (Q2679604) (← links)
• Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
• (Q3033317) (← links)
• Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
• Every Graph Admits an Unambiguous Bold Drawing (Q3223967) (← links)
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (Q3575388) (← links)
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS (Q3628100) (← links)
• An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220) (← links)
• (Q3796750) (← links)
• On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm (Q3978777) (← links)
• Rounding Arrangements Dynamically (Q4513207) (← links)
• Decision Trees for Geometric Models (Q4513214) (← links)
• New upper bounds for generalized intersection searching problems (Q4645201) (← links)
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
• OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS (Q4818564) (← links)
• ON COMPUTING TRANSLATIONAL SWEPT VOLUMES (Q4949993) (← links)
• (Q4952599) (← links)
• Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
• Point probe decision trees for geometric concept classes (Q5060103) (← links)
• Filling polyhedral molds (Q5060114) (← links)
• Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
• (Q5091157) (← links)
• A tail estimate for Mulmuley's segment intersection algorithm (Q5204337) (← links)
• A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (Q5247063) (← links)
• LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
• REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS (Q5300004) (← links)
• RED-BLUE SEPARABILITY PROBLEMS IN 3D (Q5311632) (← links)
• Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)
• OVERLAYING SURFACE MESHES, PART I: ALGORITHMS (Q5711093) (← links)
• Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)
• An elementary algorithm for reporting intersections of red/blue curve segments (Q5959559) (← links)
• External-memory algorithms for processing line segments in geographic information systems (Q6102308) (← links)
• Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
• Concyclic intervals in the plane (Q6624190) (← links)