Pages that link to "Item:Q1122981"
From MaRDI portal
The following pages link to Topologically sweeping an arrangement (Q1122981):
Displaying 50 items.
- Separating and shattering long line segments (Q293158) (← links)
- LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies (Q377487) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- On 2D constrained discrete rigid transformations (Q499723) (← links)
- Sweeping points (Q548657) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Computing a sweeping-plane in regular (``general'') position: A numerical and a symbolic solution (Q751863) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Combinatorial polar orderings and recursively orderable arrangements (Q846218) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Polygon nesting and robustness (Q917303) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Submodular function minimization (Q995782) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Computing convolutions by reciprocal search (Q1091816) (← links)
- Line arrangements and range search (Q1107313) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- The complexity of cutting complexes (Q1115186) (← links)
- Verifiable implementations of geometric algorithms using finite precision arithmetic (Q1116270) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Finding minimum area simple pentagons (Q1267196) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- Finding degeneracies among sets of lines (Q1343155) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Illumination by floodlights (Q1388133) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
- A topology construction from line drawings using a uniform plane subdivision technique. (Q1401741) (← links)
- Shattering a set of objects in 2D (Q1613422) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
