Computing farthest neighbors on a convex polytope. (Q1401257): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Farthest neighbors, maximum spanning trees and related problems in higher dimensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear time algorithm for finding all farthest neighbors in a convex polygon / 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: Applications of random sampling in computational geometry. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992847 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic algorithms for 3-D diameter and some 2-D lower envelopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank | |||
Normal rank |
Latest revision as of 09:48, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing farthest neighbors on a convex polytope. |
scientific article |
Statements
Computing farthest neighbors on a convex polytope. (English)
0 references
17 August 2003
0 references
Computational geometry
0 references
Polytope
0 references
Farthest-point Voronoi Diagram
0 references
Farthest neighbors
0 references
3D
0 references