Pages that link to "Item:Q1122981"
From MaRDI portal
The following pages link to Topologically sweeping an arrangement (Q1122981):
Displaying 50 items.
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Monotone paths in line arrangements (Q1869746) (← links)
- Optimal and suboptimal robust algorithms for proximity graphs (Q1873154) (← links)
- Asymptotic speed-ups in constructive solid geometry (Q1894301) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) (← links)
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees (Q1907033) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- Minimal tangent visibility graphs (Q1924714) (← links)
- Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
- Complexity of computing interval matrix powers for special classes of matrices. (Q2216226) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- On some monotone path problems in line arrangements (Q2387201) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- Corrigendum: Topologically sweeping an arrangement (Q2638777) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Taking a walk in a planar arrangement (Q2706112) (← links)
- Regular systems of paths and families of convex sets in convex position (Q2790591) (← links)
- Algorithms for Colourful Simplicial Depth and Medians in the Plane (Q2958332) (← links)
- Connected Rectilinear Graphs on Point Sets (Q3611865) (← links)
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS (Q3628100) (← links)
- Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
- (Q4011326) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- On Combinatorial Depth Measures (Q4631012) (← links)
- THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS (Q4650088) (← links)
- EXACT ALGORITHMS FOR CIRCLES ON THE SPHERE (Q4682168) (← links)
- THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS (Q4682193) (← links)
- TOPOLOGICAL PEELING AND APPLICATIONS (Q4818578) (← links)
- A Practical, Globally Optimal Algorithm for Geometric Matching under Uncertainty (Q4917099) (← links)
- ON COMPUTING TRANSLATIONAL SWEPT VOLUMES (Q4949993) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- The Parameterized Complexity of Finding Point Sets with Hereditary Properties (Q5009473) (← links)
- Output-sensitive cell enumeration in hyperplane arrangements (Q5054865) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining (Q5057431) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- (Q5088995) (← links)
- Linear approximation of simple objects (Q5096785) (← links)
- On some geometric optimization problems in layered manufacturing (Q5096933) (← links)
- (Q5111239) (← links)
- Gathering by Repulsion. (Q5116477) (← links)
- FINDING POPULAR PLACES (Q5305062) (← links)
- MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT (Q5386741) (← links)
