Pages that link to "Item:Q4302817"
From MaRDI portal
The following pages link to An optimal algorithm for intersecting line segments in the plane (Q4302817):
Displaying 50 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- Efficient view point selection for silhouettes of convex polyhedra (Q634248) (← links)
- Bold graph drawings (Q654288) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object (Q688223) (← links)
- Geometric algorithms for finding a point in the intersection of balls (Q827997) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Searching for segments with largest relative overlap (Q1186585) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900) (← links)
- Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559) (← links)
- Untangling planar curves (Q1688858) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Isomorphism of spiral polygons (Q1816417) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- Reporting intersections among thick objects. (Q1853186) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Iterated snap rounding (Q1862124) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Asymptotic speed-ups in constructive solid geometry (Q1894301) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
