Pages that link to "Item:Q1071526"
From MaRDI portal
The following pages link to Some dynamic computational geometry problems (Q1071526):
Displayed 50 items.
- Kinetic clustering of points on the line (Q301594) (← links)
- Trajectory clustering of points in \(\mathbb{R}\) (Q324719) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875) (← links)
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 (Q748891) (← links)
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Common intersections of polygons (Q911274) (← links)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- An algorithmic toolbox for network calculus (Q1020549) (← links)
- Ready, set, go! The Voronoi diagram of moving points that start from a line (Q1029088) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments (Q1098294) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
- Swap conditions for dynamic Voronoi diagrams for circles and line segments (Q1274463) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Structural tolerance and Delaunay triangulation (Q1606996) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- The overlay of lower envelopes and its applications (Q1907607) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Energy-optimal routes for battery electric vehicles (Q2309482) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space (Q2388506) (← links)
- On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
- An algorithm for generalized point location and its applications (Q2639635) (← links)
- On Kinetic Delaunay Triangulations (Q2796411) (← links)
- Voronoi Diagrams of Moving Points (Q4513216) (← links)
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS (Q4818540) (← links)
- Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
- Voronoi diagrams of moving points in higher dimensional spaces (Q5056158) (← links)
- Separating translates in the plane: Combinatorial bounds and an algorithm (Q5056170) (← links)
- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams (Q5096887) (← links)
- Maintaining the extent of a moving point set (Q5096923) (← links)