A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-007-9010-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019890869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the three-dimensional diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized semi-algebraic test complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting a Delaunay triangulation in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for Hopcroft's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical approach for computing the diameter of a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE DIAMETER OF A POINT SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ray shooting in convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal deterministic algorithm for computing the diameter of a three-dimensional point set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:36, 27 June 2024

scientific article
Language Label Description Also known as
English
A tight lower bound for computing the diameter of a 3D convex polytope
scientific article

    Statements

    Identifiers