scientific article; zbMATH DE number 732977
From MaRDI portal
Publication:4325546
Recommendations
Cited in
(only showing first 100 items - show all)- On overlays and minimization diagrams
- Strongly polynomial-time truthful mechanisms in one shot
- On regular vertices of the union of planar convex objects
- An algorithmic toolbox for network calculus
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Single facility collection depots location problem in the plane
- Kinetic maintenance of mobile \(k\)-centres on trees
- Conflict-free coloring of unit disks
- Kinetic hanger
- Ready, set, go! The Voronoi diagram of moving points that start from a line
- Searching for equilibrium positions in a game of political competition with restrictions
- Facility location problems in the plane based on reverse nearest neighbor queries
- Extremal problems on triangle areas in two and three dimensions
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
- Notes on the complexity of exact view graph algorithms for piecewise smooth algebraic surfaces
- Separable partitions
- Solving restricted line location problems via a dual interpretation
- Extremal problems for colored trees and Davenport-Schinzel sequences
- Excess in arrangements of segments
- Combinatorial aspects of Davenport-Schinzel sequences
- The common exterior of convex polygons in the plane
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- On trees and noncrossing partitions
- Indexing moving points
- Continuous location of dimensional structures.
- Remarks on the computation of the horizon of a digital terrain
- Computing an obnoxious anchored segment.
- The weighted farthest color Voronoi diagram on trees and graphs.
- Spanning trees crossing few barriers
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- On the number of views of translates of a cube and related problems.
- Kinetic collision detection between two simple polygons.
- On numbers of Davenport-Schinzel sequences
- 2-point site Voronoi diagrams
- Shattering a set of objects in 2D
- Kinetic \(k\)-semi-Yao graph and its applications
- A crossing lemma for Jordan curves
- Revisiting k-sum optimization
- Bounds on parameters of minimally nonlinear patterns
- Forest-like abstract Voronoi diagrams in linear time
- On the computation of zone and double zone diagrams
- Computing a minimum-width square annulus in arbitrary orientation
- Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
- On the number of maximum empty boxes amidst \(n\) points
- Minimum width color spanning annulus
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- \(L^3\) estimates for an algebraic variable coefficient Wolff circular maximal function
- Ray shooting and stone throwing with near-linear storage
- A near-linear algorithm for the planar segment-center problem
- Efficient randomized algorithms for some geometric optimization problems
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces
- A lower bound on Voronoi diagram complexity.
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- The overlay of lower envelopes and its applications
- Computing depth orders for fat objects and related problems
- Connected component and simple polygon intersection searching
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- Queries on Voronoi diagrams on moving points
- On computing the convex hull of (piecewise) curved objects
- On the number of permutations avoiding a given pattern
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
- On separating points by lines
- On the complexity of the \(k\)-level in arrangements of pseudoplanes
- Union of hypercubes and 3D Minkowski sums with random sizes
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Nondegenerate spheres in four dimensions
- Constructing sparse Davenport-Schinzel sequences
- A crossing lemma for multigraphs
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Trajectory planning for an articulated probe
- Eliminating depth cycles among triangles in three dimensions
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Constructing planar support for non-piercing regions
- A 2D advancing-front Delaunay mesh refinement algorithm
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- Location of weighted anti-ordered median straight lines with Euclidean distances
- Bichromatic 2-center of pairs of points
- Parametric search: three new applications
- Faster algorithms for growing prioritized disks and rectangles
- On the zone of the boundary of a convex body
- A simple, faster method for kinetic proximity problems
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- On the planar piecewise quadratic 1-center problem
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
- On incremental rendering of silhouette maps of a polyhedral scene
- On finding widest empty curved corridors
- Cutting algebraic curves into pseudo-segments and applications
- Extremal functions of forbidden multidimensional matrices
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Nearest-neighbor searching under uncertainty. I
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Near-linear approximation algorithms for geometric hitting sets
- Three problems about simple polygons
- On 2-site Voronoi diagrams under geometric distance functions
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)
