The following pages link to Stabbing line segments (Q1163869):
Displaying 35 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- Stabbers of line segments in the plane (Q543793) (← links)
- Geometric orderings of intersecting translates and their applications (Q676584) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 (Q748891) (← links)
- Computing shortest transversals (Q757096) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- On the maximal number of edges of many faces in an arrangement (Q1071264) (← links)
- The one-dimensional weighted Voronoi diagram (Q1071508) (← links)
- Diameter partitioning (Q1076974) (← links)
- The complexity of cells in three-dimensional arrangements (Q1078804) (← links)
- Finding transversals for sets of simple geometric figures (Q1083215) (← links)
- Ordered stabbing of pairwise disjoint convex sets in linear time (Q1175783) (← links)
- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems (Q1179028) (← links)
- A convex hull algorithm for discs, and applications (Q1188286) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Some clustering algorithms in normed planes (Q1792096) (← links)
- Polyhedral line transversals in space (Q1822999) (← links)
- Geometry of the Gass-Saaty parametric cost LP algorithm (Q1825128) (← links)
- Efficient algorithm for transversal of disjoint convex polygons. (Q1853055) (← links)
- Transversal of disjoint convex polygons. (Q1853175) (← links)
- Sets of lines and cutting out polyhedral objects (Q1873156) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Maximum spanning trees in normed planes (Q2042214) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- On intersecting a set of parallel line segments with a convex polygon of minimum area (Q2380042) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA (Q3405971) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
