scientific article; zbMATH DE number 3887061
From MaRDI portal
Publication:3219753
Recommendations
Cited in
(only showing first 100 items - show all)- Low complexity algorithms for optimal consumer push-pull partial covering in the plane
- An improved algorithm for the maximum agreement subtree problem
- Shortest paths in the plane with convex polygonal obstacles
- On the dynamization of data structures
- Translation separability of sets of polygons
- A log log n data structure for three-sided range queries
- On estimating the complexity of logarithmic decomposition
- An algorithmic approach to some problems in terrain navigation
- A survey of motion planning and related geometric algorithms
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- A special case the of dynamization problem for least cost paths
- Satisfying general proximity/similarity queries with metric trees
- Efficient structures for geometric data management
- Off-line dynamic maintenance of the width of a planar point set
- 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
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- An optimal algorithm for solving collision distance between convex polygons in plane
- Hashing lazy numbers
- 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
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Getting around a lower bound for the minimum Hausdorff distance
- Efficient searching with linear constraints
- 3D rectangulations and geometric matrix multiplication
- Quasi-optimal range searching in spaces of finite VC-dimension
- Does a point lie inside a polygon ?
- Efficient splitting and merging algorithms for order decomposable problems.
- Real-time properties of indirect recursive procedures
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- Efficient visibility queries in simple polygons
- Lower bounds for intersection searching and fractional cascading in higher dimension
- New primal and dual matching heuristics
- Sequent reconstruction in LLM -- A sweepline proof
- Bounds on the size of tetrahedralizations
- Computing depth orders for fat objects and related problems
- Connected component and simple polygon intersection searching
- Randomized search trees
- Improved algorithms for placing undesirable facilities
- Improved bounds on absolute positiveness of multivariate polynomials
- On the number of upward planar orientations of maximal planar graphs
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)
- 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
- An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
- Space efficient dynamic orthogonal range reporting
- A combinatorial approach to cartograms.
- Foundations of multidimensional and metric data structures.
- Efficient data structures for adaptive remeshing with the FEM
- Multi-method dispatching: a geometric approach with applications to string matching problems
- 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
- 3D rectangulations and geometric matrix multiplication
- Combining traditional map labeling with boundary labeling
- Cellular tree classifiers
- 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
- Algorithms for BD trees
- Visibility graphs and obstacle-avoiding shortest paths
- scientific article; zbMATH DE number 645770 (Why is no real title available?)
- scientific article; zbMATH DE number 1182924 (Why is no real title available?)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Efficient splitting and merging algorithms for order decomposable problems
- Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox
- scientific article; zbMATH DE number 194610 (Why is no real title available?)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
- Neighbours on a grid
- Constrained square-center problems
- Improvements on geometric pattern matching problems
- Computing depth orders and related problems
- Connected component and simple polygon intersection searching
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- Dynamic planar point location with optimal query time (extended abstract)
- Concatenable segment trees (extended abstract)
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- Calculation of discrepancy measures and applications
- Kinetic spanners in \(\mathbb R^{d}\)
- Geometric data structures for computer graphics.
- Witness (Delaunay) graphs
- Linear approximation of simple objects
- Upward planar morphs
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- A time-optimal parallel algorithm for the computing of Voronoi-diagrams
- Computational geometry and discrete computations
- Filling gaps in the boundary of a polyhedron
- Trapezoid graphs and generalizations, geometry and algorithms
- How hard is half-space range searching?
- Pizza sharing is PPA-hard
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- On planar straight-line dominance drawings
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 Q3219753)
