Iterated nearest neighbors and finding minimal polytopes (Q1327455): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Constructing kth-Order Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of geometric duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a circle placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic algorithms for k-point clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum area \(k\)-gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with No Empty Convex 7-Gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertical ray shooting in arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining the minimal distance of a point set in polylogarithmic time / 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 16:33, 22 May 2024

scientific article
Language Label Description Also known as
English
Iterated nearest neighbors and finding minimal polytopes
scientific article

    Statements

    Iterated nearest neighbors and finding minimal polytopes (English)
    0 references
    0 references
    0 references
    0 references
    1 March 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references