scientific article; zbMATH DE number 5046292

MaRDI QIDQ5482926zbMATH OpenFDO

Authors Markus Mannila, Mirko Zadravec, Merja Wanne, Borut Žalik

Publication date 15 August 2006

zbMATH Keywords

algorithmsnumerical examplescomputational geometrycomputer graphicshash tablenearest point problemskip lists

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
• Dynamic rectangular point location, with an application to the closest pair problem
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems
• An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
• Best proximity points: approximation and optimization
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
• An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
• Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
• Improved dynamic geodesic nearest neighbor searching in a simple polygon

Cited in

(1)

• A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

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 Q5482926)