Pages that link to "Item:Q1821557"
From MaRDI portal
The following pages link to Reporting and counting segment intersections (Q1821557):
Displaying 26 items.
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- An improved upper bound on the number of intersections between two rectangular paths (Q758223) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Computing the update of the repeated median regression line in linear time (Q1028994) (← links)
- Line arrangements and range search (Q1107313) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Computing the convex hull in a hammock (Q1177390) (← links)
- A tight upper bound for the number of intersections between two rectangulars paths (Q1182612) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Reporting red-blue intersections between two sets of connected ine segments (Q1566372) (← links)
- Reporting curve segment intersections using restricted predicates (Q1581057) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- A fast planar partition algorithm. I (Q2638830) (← links)
- Reporting Intersections of Polygons (Q3811702) (← links)
- An optimal algorithm for intersecting line segments in the plane (Q4302817) (← links)
- Reporting red-blue intersections between two sets of connected line segments (Q4595496) (← links)
- A tail estimate for Mulmuley's segment intersection algorithm (Q5204337) (← links)
- Approximating the Packedness of Polygonal Curves (Q6065398) (← links)
