Diameter, width, closest line pair, and parametric searching
From MaRDI portal
(Redirected from Publication:685180)
Recommendations
Cites work
- scientific article; zbMATH DE number 432848 (Why is no real title available?)
- scientific article; zbMATH DE number 437553 (Why is no real title available?)
- scientific article; zbMATH DE number 4213496 (Why is no real title available?)
- scientific article; zbMATH DE number 4151829 (Why is no real title available?)
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- scientific article; zbMATH DE number 742988 (Why is no real title available?)
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Applications of random sampling in computational geometry. II
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Computing a Segment Center for a Planar Point Set
- Euclidean minimum spanning trees and bichromatic closest pairs
- Linear Optimization Queries
- On k-Hulls and Related Problems
- On the zone of a surface in a hyperplane arrangement
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Parallelism in Comparison Problems
- Randomized optimal algorithm for slope selection
- Selecting distances in the plane
- Slowing down sorting networks to obtain faster sorting algorithms
- -nets and simplex range queries
Cited in
(30)- New lower bounds for Hopcroft's problem
- Lower Bounds for Geometric Diameter Problems
- Linear approximation of simple objects
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Dynamic half-space range reporting and its applications
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- A note on searching line arrangements and applications
- Efficient randomized algorithms for some geometric optimization problems
- On enclosing k points by a circle
- On range searching with semialgebraic sets
- Largest \(j\)-simplices in \(n\)-polytopes
- On computing the diameter of a point set in high dimensional Euclidean space.
- A deterministic algorithm for the three-dimensional diameter problem
- Computing grasp functions
- All convex polyhedra can be clamped with parallel jaw grippers
- Continuous location of dimensional structures.
- A near-linear algorithm for the planar segment-center problem
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- Applications of Parametric Searching in Geometric Optimization
- Almost tight upper bounds for lower envelopes in higher dimensions
- Optimal parametric search on graphs of bounded tree-width
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Using sparsification for parametric minimum spanning tree problems
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Computing the width of a set
- Minimum-width double-slabs and widest empty slabs in high dimensions
- Optimal slope selection via cuttings
This page was built for publication: Diameter, width, closest line pair, and parametric searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685180)
