scientific article; zbMATH DE number 437530

MaRDI QIDQ3140402zbMATH OpenFDO

Authors David Eppstein, Jeff Erickson

Publication date 29 November 1994

zbMATH Keywords

dynamic algorithmdynamic data structurehigh order Voronoi diagramsnearest neighbors

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Iterated nearest neighbors and finding minimal polytopes
• scientific article; zbMATH DE number 742951
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• Finding k points with minimum diameter and related problems
• An O(n log n) algorithm for the all-nearest-neighbors problem

Cited in

(9)

• Iterated nearest neighbors and finding minimal polytopes
• On geometric optimization with few violated constraints
• On finding \(p\)-th nearest neighbours of scattered points in two dimensions for small \(p\)
• A branch-and-bound method for the minimum \(k\)-enclosing ball problem
• Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
• Minimum area polygons with two reflex angles enclosingkPoints
• Graef-Younes method with backward iteration
• Static and dynamic algorithms for k-point clustering problems
• On enclosing k points by a circle

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140402)