Output-sensitive algorithms for computing nearest-neighbour decision boundaries.

DOI10.1007/B11837MaRDI QIDQ5900775zbMATH OpenFDO

Authors David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried Toussaint

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Output-sensitive algorithms for computing nearest-neighbour decision boundaries
• Separability of point sets by \(k\)-level linear classification trees
• Chromatic nearest neighbor searching: A query sensitive approach
• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• Algorithms and hardness results for nearest neighbor problems in bicolored point sets

Cited in

(3)

• Guarantees on nearest-neighbor condensation heuristics
• Output-sensitive algorithms for computing nearest-neighbour decision boundaries
• Improved search of relevant points for nearest-neighbor classification

This page was built for publication: Output-sensitive algorithms for computing nearest-neighbour decision boundaries.

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