Some dynamic computational geometry problems

Cites work

scientific article; zbMATH DE number 3557226 (Why is no real title available?)
scientific article; zbMATH DE number 3569833 (Why is no real title available?)
A Combinatorial Problem Connected with Differential Equations
A Lower Bound to Finding Convex Hulls
A combinatorial problem connected with differential equations II
An efficient algorithm for determining the convex hull of a finite planar set
Convex hulls of finite sets of points in two and three dimensions
On Finding the Maxima of a Set of Vectors
On a problem of Davenport and Schinzel
On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
On the complexity of computations under varying sets of primitives
Some dynamic computational geometry problems

Cited in

(63)

scientific article; zbMATH DE number 911776 (Why is no real title available?)
The Minimum Moving Spanning Tree Problem
scientific article; zbMATH DE number 19025 (Why is no real title available?)
CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING
Interview with Micha Sharir
scientific article; zbMATH DE number 7576806 (Why is no real title available?)
PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
The overlay of lower envelopes and its applications
Linear approximation of simple objects
Voronoi Diagrams of Moving Points
Fast algorithms for collision and proximity problems involving moving geometric objects
The minimum moving spanning tree problem
Approximation algorithm for the kinetic robust \(k\)-center problem
Fréchet distance between a line and avatar point set
A nearly optimal deterministic parallel Voronoi diagram algorithm
Finding effective ``Force targets for two-dimensional, multifinger frictional grips
``The big sweep: On the power of the wavefront approach to Voronoi diagrams
Common intersections of polygons
Voronoi diagrams of moving points in higher dimensional spaces
Dynamic computational geometry on meshes and hypercubes
An algorithm for generalized point location and its applications
scientific article; zbMATH DE number 7559224 (Why is no real title available?)
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
Parametric problems on graphs of bounded tree-width
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
An algorithmic toolbox for network calculus
Orthogonal queries in segments
Transitions in geometric minimum spanning trees
Ready, set, go! The Voronoi diagram of moving points that start from a line
A convex polygon among polygonal obstacle: Placement and high-clearance motion
On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
Structural tolerance and Delaunay triangulation
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
Complexity of projected images of convex subdivisions
The upper envelope of Voronoi surfaces and its applications
Dynamic geometric data structures via shallow cuttings
Energy-optimal routes for battery electric vehicles
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
On arrangements of Jordan arcs with three intersections per pair
Kinetic clustering of points on the line
Separating translates in the plane: Combinatorial bounds and an algorithm
Finding the upper envelope of n line segments in O(n log n) time
On minimum and maximum spanning trees of linearly moving points
Computing bisectors in a dynamic geometry environment
Trajectory clustering of points in \(\mathbb{R}\)
A sensor-based framework for kinetic data compression
Maintaining the extent of a moving point set
Distribution-sensitive construction of the greedy spanner
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
The maximum absolute deviation measure in location problems on networks
Some dynamic computational geometry problems
On the two-dimensional Davenport-Schinzel problem
Visibility with a moving point of view
On \(k\)-sets in arrangements of curves and surfaces
On the general motion-planning problem with two degrees of freedom
QuickhullDisk: a faster convex hull algorithm for disks
scientific article; zbMATH DE number 1859221 (Why is no real title available?)
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
Swap conditions for dynamic Voronoi diagrams for circles and line segments
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
scientific article; zbMATH DE number 108277 (Why is no real title available?)

This page was built for publication: Some dynamic computational geometry problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071526)