scientific article
From MaRDI portal
Publication:3219753
zbMath0556.68003MaRDI QIDQ3219753
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)
Related Items (97)
Lower bounds for off-line range searching ⋮ Computing rectangle enclosures ⋮ The searching over separators strategy to solve some NP-hard problems in subexponential time ⋮ Computing the intersection-depth to polyhedra ⋮ Shortest paths in the plane with convex polygonal obstacles ⋮ Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem ⋮ Computing a poset from its realizer ⋮ Efficient dynamic range searching using data replication ⋮ Hashing lazy numbers ⋮ Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ New primal and dual matching heuristics ⋮ Neighbours on a grid ⋮ Constrained square-center problems ⋮ Sequent reconstruction in LLM -- A sweepline proof ⋮ On the dynamization of data structures ⋮ Improvements on geometric pattern matching problems ⋮ Computing depth orders and related problems ⋮ An algorithm to compute bounds for the star discrepancy ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems ⋮ Translation separability of sets of polygons ⋮ Efficient data structures for adaptive remeshing with the FEM ⋮ A log log n data structure for three-sided range queries ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ Bounds on the size of tetrahedralizations ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ Boundary labeling: Models and efficient algorithms for rectangular maps ⋮ On estimating the complexity of logarithmic decomposition ⋮ An algorithmic approach to some problems in terrain navigation ⋮ Cellular tree classifiers ⋮ Computing depth orders for fat objects and related problems ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Connected component and simple polygon intersection searching ⋮ A survey of motion planning and related geometric algorithms ⋮ Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ Randomized search trees ⋮ 3D Rectangulations and Geometric Matrix Multiplication ⋮ Concatenable segment trees ⋮ Getting around a lower bound for the minimum Hausdorff distance ⋮ Improved bounds on absolute positiveness of multivariate polynomials ⋮ An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3 ⋮ Improved algorithms for placing undesirable facilities ⋮ An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs ⋮ A time-optimal parallel algorithm for the computing of Voronoi-diagrams ⋮ 3D rectangulations and geometric matrix multiplication ⋮ Dynamic fractional cascading ⋮ Computational geometry in a curved world ⋮ Hidden line elimination for isooriented rectangles ⋮ Triangulating a nonconvex polytope ⋮ Dynamic planar point location with optimal query time ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Efficient dynamic algorithms for some geometric intersection problems ⋮ Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox ⋮ Visibility graphs and obstacle-avoiding shortest paths ⋮ A special case the of dynamization problem for least cost paths ⋮ Satisfying general proximity/similarity queries with metric trees ⋮ Linear approximation of simple objects ⋮ Space efficient dynamic orthogonal range reporting ⋮ Filling gaps in the boundary of a polyhedron ⋮ Off-line dynamic maintenance of the width of a planar point set ⋮ Trapezoid graphs and generalizations, geometry and algorithms ⋮ Line-segment intersection reporting in parallel ⋮ Hidden surface removal for \(c\)-oriented polyhedra ⋮ Probing a scene of nonconvex polyhedra ⋮ Applications of a new space-partitioning technique ⋮ How hard is half-space range searching? ⋮ On the number of upward planar orientations of maximal planar graphs ⋮ Quasi-optimal upper bounds for simplex range searching and new zone theorems ⋮ A combinatorial approach to cartograms. ⋮ Kinetic spanners in \(\mathbb R^{d}\) ⋮ An efficient algorithm for computing the maximum empty rectangle in three dimensions ⋮ Witness (Delaunay) graphs ⋮ Succinct data structures for searchable partial sums with optimal worst-case performance ⋮ A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) ⋮ Upward planar morphs ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ Combining Traditional Map Labeling with Boundary Labeling ⋮ Connected component and simple polygon intersection searching ⋮ Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Dynamic planar point location with optimal query time ⋮ An incremental reconstruction method for dynamic planar point location ⋮ The intersection searching problem for c-oriented polygons ⋮ Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model ⋮ Building Mathematics-Based Software Systems to Advance Science and Create Knowledge ⋮ Maintaining Ideally Distributed Random Search Trees without Extra Space ⋮ On Map Labeling with Leaders ⋮ Quasi-optimal range searching in spaces of finite VC-dimension ⋮ Does a point lie inside a polygon ? ⋮ An improved algorithm for the maximum agreement subtree problem ⋮ Efficient searching with linear constraints ⋮ Efficient splitting and merging algorithms for order decomposable problems. ⋮ Real-time properties of indirect recursive procedures ⋮ An optimal algorithm for solving collision distance between convex polygons in plane ⋮ Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects ⋮ Calculation of Discrepancy Measures and Applications ⋮ Efficient visibility queries in simple polygons ⋮ Metric trees
This page was built for publication:
