An efficient algorithm for the three-dimensional diameter problem
From MaRDI portal
Publication:5932809
DOI10.1007/s004540010086zbMath0996.68217OpenAlexW3138944346MaRDI QIDQ5932809
Publication date: 20 June 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010086
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
Computing farthest neighbors on a convex polytope. ⋮ A tight lower bound for computing the diameter of a 3D convex polytope
Cites Work
- Unnamed Item
- Unnamed Item
- On ray shooting in convex polytopes
- Fast detection of polyhedral intersection
- The symmetric all-furthest-neighbor problem
- A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Linear combinations from power domains
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- Cutting hyperplanes for divide-and-conquer
- Applications of random sampling in computational geometry. II
- A deterministic algorithm for the three-dimensional diameter problem
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Algorithms for Reporting and Counting Geometric Intersections
- Voronoi Diagram in the Laguerre Geometry and Its Applications
- Computing the extreme distances between two convex polygons
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Improved algorithms for discs and balls using power diagrams
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Convex hulls of finite sets of points in two and three dimensions
- Product Range Spaces, Sensitive Sampling, and Derandomization
- Power Diagrams: Properties, Algorithms and Applications
- A Combinatorial Problem Connected with Differential Equations
- Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
This page was built for publication: An efficient algorithm for the three-dimensional diameter problem
