scientific article; zbMATH DE number 732977
From MaRDI portal
Publication:4325546
Recommendations
Cited in
(only showing first 100 items - show all)- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Near-linear approximation algorithms for geometric hitting sets
- Geometric optimization and sums of algebraic functions
- The combinatorial encoding of disjoint convex sets in the plane
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
- On separating points by lines
- Parametric search: three new applications
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- Extremal problems for colored trees and Davenport-Schinzel sequences
- On 2-site Voronoi diagrams under geometric distance functions
- Covering a set of line segments with a few squares
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- The higher-order Voronoi diagram of line segments
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- On the zone of the boundary of a convex body
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- On the minimum-area rectangular and square annulus problem
- On the dilation spectrum of paths, cycles, and trees
- Kinetic collision detection with fast flight plan changes
- On the number of regular vertices of the union of Jordan regions
- Faster algorithms for growing prioritized disks and rectangles
- Minimum vertex cover in rectangle graphs
- Trajectory planning for an articulated probe
- Bichromatic 2-center of pairs of points
- Linear approximation of simple objects
- Facility location problems in the plane based on reverse nearest neighbor queries
- THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
- Information spreading by mobile particles on a line
- Bounding sequence extremal functions with formations
- Subdivision Drawings of Hypergraphs
- Ready, set, go! The Voronoi diagram of moving points that start from a line
- Intersection searching amid tetrahedra in 4-space and efficient continuous collision detection
- Optimal Triangulation with Steiner Points
- Ray shooting and stone throwing with near-linear storage
- Smarter Lions: efficient cooperative pursuit in general bounded arenas
- Kinetic spanners in \(\mathbb R^{d}\)
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- Throwing a sofa through the window
- Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Farthest-polygon Voronoi diagrams
- Remarks on the computation of the horizon of a digital terrain
- Covering moving points with anchored disks
- Lines avoiding balls in three dimensions revisited
- Multi-dimensional dynamic facility location and fast computation at query points
- Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Polygonal chain approximation: A query based approach
- On the number of regular vertices of the union of Jordan regions
- A crossing lemma for multigraphs
- PRECISE VORONOI CELL EXTRACTION OF FREE-FORM PLANAR PIECEWISE C1-CONTINUOUS CLOSED RATIONAL CURVES
- Farthest line segment Voronoi diagrams
- Robust location problems with pos/neg weights on a tree
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
- On the number of incidences when avoiding an induced biclique in geometric settings
- On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
- Throwing a sofa through the window
- Dynamic data structures for fat objects and their applications
- Kinetic \(k\)-semi-Yao graph and its applications
- Parametric multiple sequence alignment and phylogeny construction
- Faster algorithms for largest empty rectangles and boxes
- Covering point sets with two disjoint disks or squares
- On the number of maximum empty boxes amidst \(n\) points
- The bi‐criteria doubly weighted center‐median path problem on a tree
- Line intersection searching amid unit balls in 3-space
- Improved bounds on the union complexity of fat objects
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- On overlays and minimization diagrams
- Indexing moving points
- Bounds on parameters of minimally nonlinear patterns
- Abstract Voronoi diagrams from closed bisecting curves
- Improved output-sensitive snap rounding
- On computing the convex hull of (piecewise) curved objects
- scientific article; zbMATH DE number 7053339 (Why is no real title available?)
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- Efficient randomized algorithms for some geometric optimization problems
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- Minimum width color spanning annulus
- The weighted farthest color Voronoi diagram on trees and graphs.
- On the number of views of translates of a cube and related problems.
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
- Empty squares in arbitrary orientation among points
- Minimum width color spanning annulus
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- A lower bound on Voronoi diagram complexity.
- Coverage restricted to an angle
- Single facility collection depots location problem in the plane
- A 2D advancing-front Delaunay mesh refinement algorithm
- 2-point site Voronoi diagrams
- Constrained square-center problems
- Computing depth orders for fat objects and related problems
- Two proofs for shallow packings
- scientific article; zbMATH DE number 7673608 (Why is no real title available?)
- Solving restricted line location problems via a dual interpretation
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325546)
